Approximations of General Independent Distributions - Guy Even; Oded Goldreich 001; Michael Luby; Noam Nisan; Boban Velickovic (STOC, 1992)

Linear test sequences for detecting functionally faulty RAM's. - Guy Even; Ophir Rachman; Ilan Y. Spillinger (Integr., 1993)

Design of VLSI circuits using Retiming. - Guy Even (1994)

Improving initialization through reversed retiming. - Leon Stok; Ilan Y. Spillinger; Guy Even (ED&TC, 1995)

Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (FOCS, 1995)

Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. - Guy Even; Joseph Naor; Baruch Schieber; Madhu Sudan 001 (IPCO, 1995)

Lower Bounds for Sampling Algorithms for Estimating the Average. - Ran Canetti; Guy Even; Oded Goldreich 001 (Inf. Process. Lett., 1995)

The Retiming Lemma: A simple proof and applications. - Guy Even (Integr., 1996)

Retiming revisited and reversed. - Guy Even; Ilan Y. Spillinger; Leon Stok (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

Pipelined Packet-Forwarding Floating Point: II. An Adder. - Asger Munk Nielsen; David W. Matula; Chung Nan Lyu; Guy Even (IEEE Symposium on Computer Arithmetic, 1997)

Spreading Metric Based Graph Partitioning Algorithms. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (PP, 1997)

Mirroring: a technique for pipelining semi-systolic and systolic arrays. - Michael Braun 002; Guy Even; Thomas Walle (Integr., 1997)

A real-time systolic integer multiplier. - Guy Even (Integr., 1997)

Overcoming chip-to-chip delays and clock skews. - Guy Even; Ami Litman (Integr., 1997)

How many logic levels does floating-point addition require? - Peter-Michael Seidel; Guy Even (ICCD, 1998)

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. - Guy Even; Joseph Naor; Baruch Schieber; Madhu Sudan 001 (Algorithmica, 1998)

Efficient approximation of product distributions. - Guy Even; Oded Goldreich 001; Michael Luby; Noam Nisan; Boban Velickovic (Random Struct. Algorithms, 1998)

Fast Approximate Graph Partitioning Algorithms. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (SIAM J. Comput., 1999)

Improved approximations of crossings in graph drawings. - Guy Even; Sudipto Guha; Baruch Schieber (STOC, 2000)

A dual precision IEEE floating-point multiplier. - Guy Even; Silvia M. Müller; Peter-Michael Seidel (Integr., 2000)

Divide-and-conquer approximation algorithms via spreading metrics. - Guy Even; Joseph Naor; Satish Rao; Baruch Schieber (J. ACM, 2000)

Embedding interconnection networks in grids via the layered cross product. - Guy Even; Shimon Even (Networks, 2000)

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. - Guy Even; Joseph Naor; Leonid Zosin (SIAM J. Comput., 2000)

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. - Guy Even; Joseph Naor; Baruch Schieber; Leonid Zosin (SIAM J. Discret. Math., 2000)

On the Design of IEEE Compliant Floating Point Units. - Guy Even; Wolfgang J. Paul (IEEE Trans. Computers, 2000)

A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication. - Guy Even; Peter-Michael Seidel (IEEE Trans. Computers, 2000)

An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm. - Asger Munk Nielsen; David W. Matula; Chung Nan Lyu; Guy Even (IEEE Trans. Computers, 2000)

On the Design of Fast IEEE Floating-Point Adders. - Peter-Michael Seidel; Guy Even (IEEE Symposium on Computer Arithmetic, 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. - Guy Even; Jon Feldman; Guy Kortsarz; Zeev Nutov (RANDOM-APPROX, 2001)

Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. - Reuven Bar-Yehuda; Guy Even; Jon Feldman; Joseph Naor (J. Graph Algorithms Appl., 2001)

An approximation algorithm for the group Steiner problem. - Guy Even; Guy Kortsarz (SODA, 2002)

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. - Guy Even; Sudipto Guha; Baruch Schieber (SIAM J. Comput., 2002)

On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. - Reuven Bar-Yehuda; Guy Even; Shimon Shahar (ESA, 2003)

Pipelined Multiplicative Division with IEEE Rounding. - Guy Even; Peter-Michael Seidel (ICCD, 2003)

Covering Graphs Using Trees and Stars. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (RANDOM-APPROX, 2003)

Generation of representative input vectors for parametric designs: from low precision to high precision. - Shahar Bar-Or; Guy Even; Yariv Levin (Integr., 2003)

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. - Guy Even; Zvi Lotker; Dana Ron; Shakhar Smorodinsky (SIAM J. Comput., 2003)

Min-max tree covers of graphs. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (Oper. Res. Lett., 2004)

Delay-Optimized Implementation of IEEE Floating-Point Addition. - Peter-Michael Seidel; Guy Even (IEEE Trans. Computers, 2004)

Hitting sets when the VC-dimension is small. - Guy Even; Dror Rawitz; Shimon Shahar (Inf. Process. Lett., 2005)

On approximating a geometric prize-collecting traveling salesman problem with time windows. - Reuven Bar-Yehuda; Guy Even; Shimon Shahar (J. Algorithms, 2005)

A parametric error analysis of Goldschmidt's division algorithm. - Guy Even; Peter-Michael Seidel; Warren E. Ferguson (J. Comput. Syst. Sci., 2005)

On network design problems: fixed cost flows and the covering steiner problem. - Guy Even; Guy Kortsarz; Wolfgang Slany (ACM Trans. Algorithms, 2005)

Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding. - Nissim Halabi; Guy Even (IEEE Trans. Inf. Theory, 2005)

On Teaching Fast Adder Designs: Revisiting Ladner & Fischer. - Guy Even (Essays in Memory of Shimon Even, 2006)

Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs. - Guy Even; Shimon Shahar (CAAN, 2006)

Approximation Algorithms for Capacitated Rectangle Stabbing. - Guy Even; Dror Rawitz; Shimon Shahar (CIAC, 2006)

A greedy approximation algorithm for the group Steiner problem. - Chandra Chekuri; Guy Even; Guy Kortsarz (Discret. Appl. Math., 2006)

An FPGA implementation of pipelined multiplicative division with IEEE Rounding. - Ronen Goldberg; Guy Even; Peter-Michael Seidel (FCCM, 2007)

Recursive Greedy Methods. - Guy Even (Handbook of Approximation Algorithms and Metaheuristics, 2007)

An improved micro-architecture for function approximation using piecewise quadratic interpolation. - Shai Erez; Guy Even (ICCD, 2008)

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. - Guy Even; Retsef Levi; Dror Rawitz; Baruch Schieber; Shimon Shahar; Maxim Sviridenko (ACM Trans. Algorithms, 2008)

A Strongly Polynomial Algorithm for Controlled Queues. - Alexander Zadorojniy; Guy Even; Adam Shwartz (Math. Oper. Res., 2009)

Scheduling with conflicts: online and offline algorithms. - Guy Even; Magnús M. Halldórsson; Lotem Kaplan; Dana Ron (J. Sched., 2009)

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. - Guy Even; Jon Feldman; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2009)

Optimal conclusive sets for comparator networks. - Guy Even; Tamir Levi; Ami Litman (Theor. Comput. Sci., 2009)

An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. - Guy Even; Moti Medina (ICALP (2), 2010)

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. - Guy Even; Yaniv Fais; Moti Medina; Shimon Shahar; Alexander Zadorojniy (ALGOSENSORS, 2011)

Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. - Guy Even; Yakov Matsri; Moti Medina (ALGOSENSORS, 2011)

Hitting Sets Online and Vertex Ranking. - Guy Even; Shakhar Smorodinsky (ESA, 2011)

Local Optimality Certificates for LP Decoding of Tanner Codes - Nissim Halabi; Guy Even (CoRR, 2011)

On Decoding Irregular Tanner Codes - Guy Even; Nissim Halabi (CoRR, 2011)

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. - Guy Even; Guy Kortsarz; Zeev Nutov (Inf. Process. Lett., 2011)

Set connectivity problems in undirected graphs and the directed steiner network problem. - Chandra Chekuri; Guy Even; Anupam Gupta 001; Danny Segev (ACM Trans. Algorithms, 2011)

Parallel randomized load balancing: A lower bound for a more general model. - Guy Even; Moti Medina (Theor. Comput. Sci., 2011)

LP Decoding of Regular LDPC Codes in Memoryless Channels. - Nissim Halabi; Guy Even (IEEE Trans. Inf. Theory, 2011)

Digital Logic Design - A Rigorous Approach. - Guy Even; Moti Medina (Cambridge University Press, 2012)

Graph Algorithms, Second Edition. - Shimon Even; Guy Even (Cambridge University Press, 2012)

Linear-programming decoding of Tanner codes with local-optimality certificates. - Nissim Halabi; Guy Even (ISIT, 2012)

Hierarchies of local-optimality characterizations in decoding Tanner codes. - Nissim Halabi; Guy Even (ISIT, 2012)

Local-optimality guarantees for optimal decoding based on paths. - Nissim Halabi; Guy Even (ISTC, 2012)

Online Multi-Commodity Flow with High Demands. - Guy Even; Moti Medina (WAOA, 2012)

Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks. - Guy Even; Alexander Zadorojniy (Ann. Oper. Res., 2012)

Local-Optimality Guaranties for Optimal Decoding Based on Paths - Nissim Halabi; Guy Even (CoRR, 2012)

Revisiting randomized parallel load balancing algorithms. - Guy Even; Moti Medina (Theor. Comput. Sci., 2012)

Observability of Boolean networks: A graph-theoretic approach. - Dmitriy Laschov; Michael Margaliot; Guy Even (Autom., 2013)

Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices - Guy Even; Nissim Halabi (CoRR, 2013)

Local-Optimality Guarantees Based on Paths for Optimal Decoding. - Guy Even; Nissim Halabi (SIAM J. Discret. Math., 2013)

Competitive and deterministic embeddings of virtual networks. - Guy Even; Moti Medina; Gregor Schaffrath; Stefan Schmid 001 (Theor. Comput. Sci., 2013)

Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. - Guy Even; Moti Medina; Dana Ron (ESA, 2014)

Best of Two Local Models: Local Centralized and Local Distributed Algorithms. - Guy Even; Moti Medina; Dana Ron (CoRR, 2014)

Hitting sets online and unique-max coloring. - Guy Even; Shakhar Smorodinsky (Discret. Appl. Math., 2014)

On Decoding Irregular Tanner Codes With Local-Optimality Guarantees. - Nissim Halabi; Guy Even (IEEE Trans. Inf. Theory, 2014)

Distributed Maximum Matching in Bounded Degree Graphs. - Guy Even; Moti Medina; Dana Ron (ICDCN, 2015)

Deterministic Rateless Codes for BSC. - Benny Applebaum; Liron David; Guy Even (ITCS, 2015)

Better Deterministic Online Packet Routing on Grids. - Guy Even; Moti Medina; Boaz Patt-Shamir (SPAA, 2015)

Algorithms for Network-on-Chip Design with Guaranteed QoS. - Guy Even; Yaniv Fais (CoRR, 2015)

Better Online Deterministic Packet Routing on Grids. - Guy Even; Moti Medina; Boaz Patt-Shamir (CoRR, 2015)

A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. - Guy Even; Moti Medina (Theor. Comput. Sci., 2015)

Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming. - Guy Even; Nissim Halabi (IEEE Trans. Inf. Theory, 2015)

A Constant Approximation Algorithm for Scheduling Packets on Line Networks. - Guy Even; Moti Medina; Adi Rosén (ESA, 2016)

An Approximation Algorithm for Path Computation and Function Placement in SDNs. - Guy Even; Matthias Rost; Stefan Schmid 001 (SIROCCO, 2016)

Competitive Path Computation and Function Placement in SDNs. - Guy Even; Moti Medina; Boaz Patt-Shamir (CoRR, 2016)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Online Packet-Routing in Grids with Bounded Buffers. - Guy Even; Moti Medina (Algorithmica, 2017)

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. - Guy Even; Reut Levi; Moti Medina (CoRR, 2017)

SDNoC: Software defined network on a chip. - Konstantin Berestizshevsky; Guy Even; Yaniv Fais; Jonatan Ostrometzky (Microprocess. Microsystems, 2017)

Recursive Greedy Methods. - Guy Even (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Guy Even; Bundit Laekhanukit; Daniel Vaz 001 (APPROX-RANDOM, 2018)

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O( log N log varDelta / log ^2 log varDelta ) Rounds. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (SIROCCO, 2018)

Online Generalized Caching with Varying Weights and Costs. - Guy Even; Moti Medina; Dror Rawitz (SPAA, 2018)

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. - Guy Even; Mohsen Ghaffari 001; Moti Medina (DISC, 2018)

Minimal controllability of conjunctive Boolean networks is NP-complete. - Eyal Weiss 001; Michael Margaliot; Guy Even (Autom., 2018)

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. - Konstantin Berestizshevsky; Guy Even (CoRR, 2018)

Optimal Distributed Weighted Set Cover Approximation. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (CoRR, 2018)

Best of two local models: Centralized local and distributed local algorithms. - Guy Even; Moti Medina; Dana Ron (Inf. Comput., 2018)

Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. - Benny Applebaum; Liron David; Guy Even (Theory Comput., 2018)

Sign Based Derivative Filtering for Stochastic Gradient Descent. - Konstantin Berestizshevsky; Guy Even (ICANN (2), 2019)

Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. - Konstantin Berestizshevsky; Guy Even (ICANN (2), 2019)

Asymptotically Optimal Filters. - Guy Even (SPAA, 2019)

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. - Ioana Oriana Bercea; Guy Even (CoRR, 2019)

On-Line Path Computation and Function Placement in SDNs. - Guy Even; Moti Medina; Boaz Patt-Shamir (Theory Comput. Syst., 2019)

Distributed Graph Algorithms (NII Shonan Meeting 162). - Guy Even; Gregory Schwartzman (NII Shonan Meet. Rep., 2019)

A Dynamic Space-Efficient Filter with Constant Time Operations. - Ioana O. Bercea; Guy Even (SWAT, 2020)

A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations. - Ioana Oriana Bercea; Guy Even (CoRR, 2020)

Optimization of resource-constrained policies for COVID-19 testing and quarantining. - Konstantin Berestizshevsky; Koffi-Emmanuel Sadzi; Guy Even; Moni Shahar (J. Commun. Networks, 2021)

Sublinear Random Access Generators for Preferential Attachment Graphs. - Guy Even; Reut Levi; Moti Medina; Adi Rosén (ACM Trans. Algorithms, 2021)

Upper tail analysis of bucket sort and random tries. - Ioana O. Bercea; Guy Even (Theor. Comput. Sci., 2021)

An extendable data structure for incremental stable perfect hashing. - Ioana Oriana Bercea; Guy Even (STOC, 2022)

Prefix Filter: Practically and Theoretically Better Than Bloom. - Tomer Even; Guy Even; Adam Morrison 001 (Proc. VLDB Endow., 2022)

Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership. - Guy Even; Gabriel Marques Domingues; Parham Toutian (SPAA, 2023)

Optimal distributed covering algorithms. - Ran Ben-Basat; Guy Even; Ken-ichi Kawarabayashi; Gregory Schwartzman (Distributed Comput., 2023)

Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. - Ioana O. Bercea; Guy Even (Algorithmica, 2023)

An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. - Marcin Bienkowski; Guy Even (STACS, 2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements. - Aryan Agarwala; Guy Even (CoRR, 2024)

A Micro-architecture that supports the Fano-Elias encoding and a hardware accelerator for approximate membership queries. - Guy Even; Gabriel Marques Domingues (Microprocess. Microsystems, 2024)

Dynamic Filter and Retrieval with One Access to Modifiable Memory. - Ioana O. Bercea; Guy Even; Tomer Even; Gabriel Marques Domingues (CIAC (1), 2025)