Guy Even
Orcid: 0000-0001-5407-330X
According to our database1,
Guy Even
authored at least 126 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A Micro-architecture that supports the Fano-Elias encoding and a hardware accelerator for approximate membership queries.
Microprocess. Microsystems, 2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
2023
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations.
Algorithmica, June, 2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
2022
Proc. VLDB Endow., 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
2021
ACM Trans. Algorithms, 2021
J. Commun. Networks, 2021
2020
CoRR, 2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
2019
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses.
CoRR, 2019
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Deep Learning, 2019
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Deep Learning, 2019
2018
Theory Comput., 2018
Inf. Comput., 2018
Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence.
CoRR, 2018
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log<sup>2</sup> logΔ) Rounds.
CoRR, 2018
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds.
Proceedings of the Structural Information and Communication Complexity, 2018
Proceedings of the Approximation, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model.
CoRR, 2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
2016
Proceedings of the Structural Information and Communication Complexity, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming.
IEEE Trans. Inf. Theory, 2015
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations.
Theor. Comput. Sci., 2015
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015
2014
IEEE Trans. Inf. Theory, 2014
CoRR, 2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
Theor. Comput. Sci., 2013
SIAM J. Discret. Math., 2013
Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices
CoRR, 2013
2012
Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks.
Ann. Oper. Res., 2012
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Cambridge University Press, ISBN: 978-0-521-73653-4, 2012
Cambridge University Press, ISBN: 978-1-107-02753-4, 2012
2011
IEEE Trans. Inf. Theory, 2011
Theor. Comput. Sci., 2011
Set connectivity problems in undirected graphs and the directed steiner network problem.
ACM Trans. Algorithms, 2011
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
Inf. Process. Lett., 2011
Proceedings of the Algorithms - ESA 2011, 2011
Proceedings of the Algorithms for Sensor Systems, 2011
Proceedings of the Algorithms for Sensor Systems, 2011
2010
An <i>O</i>(log<i>n</i>)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
2009
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.
ACM Trans. Algorithms, 2009
2008
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Trans. Algorithms, 2008
An improved micro-architecture for function approximation using piecewise quadratic interpolation.
Proceedings of the 26th International Conference on Computer Design, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines, 2007
2006
Discret. Appl. Math., 2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006
Proceedings of the Theoretical Computer Science, 2006
2005
Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding.
IEEE Trans. Inf. Theory, 2005
ACM Trans. Algorithms, 2005
J. Comput. Syst. Sci., 2005
On approximating a geometric prize-collecting traveling salesman problem with time windows.
J. Algorithms, 2005
2004
IEEE Trans. Computers, 2004
2003
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
SIAM J. Comput., 2003
Generation of representative input vectors for parametric designs: from low precision to high precision.
Integr., 2003
Proceedings of the 21st International Conference on Computer Design (ICCD 2003), 2003
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract.
Proceedings of the Algorithms, 2003
2002
SIAM J. Comput., 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.
J. Graph Algorithms Appl., 2001
A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set.
Proceedings of the Approximation, 2001
Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001
2000
An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm.
IEEE Trans. Computers, 2000
IEEE Trans. Computers, 2000
SIAM J. Discret. Math., 2000
SIAM J. Comput., 2000
Networks, 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
1998
Algorithmica, 1998
Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors, 1998
1997
Integr., 1997
Spreading Metric Based Graph Partitioning Algorithms.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997
1996
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996
1995
Inf. Process. Lett., 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Proceedings of the 1995 European Design and Test Conference, 1995
1994
1993
1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992