Guy Even

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.

[BibT_eX]

[DOI]

Ioana O. Bercea

Algorithmica, June, 2023

Optimal distributed covering algorithms.

[BibT_eX]

[DOI]

Distributed Comput., March, 2023

Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership.

[BibT_eX]

[DOI]

Gabriel Marques Domingues

Parham Toutian

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

Prefix Filter: Practically and Theoretically Better Than Bloom.

[BibT_eX]

[DOI]

Tomer Even

Adam Morrison

Proc. VLDB Endow., 2022

An extendable data structure for incremental stable perfect hashing.

[BibT_eX]

[DOI]

Ioana Oriana Bercea

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Upper tail analysis of bucket sort and random tries.

[BibT_eX]

[DOI]

Ioana O. Bercea

Theor. Comput. Sci., 2021

Sublinear Random Access Generators for Preferential Attachment Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Optimization of resource-constrained policies for COVID-19 testing and quarantining.

[BibT_eX]

[DOI]

Koffi-Emmanuel Sadzi

Moni Shahar

J. Commun. Networks, 2021

2020

A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations.

[BibT_eX]

[DOI]

Ioana Oriana Bercea

CoRR, 2020

A Dynamic Space-Efficient Filter with Constant Time Operations.

[BibT_eX]

[DOI]

Ioana O. Bercea

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Distributed Graph Algorithms (NII Shonan Meeting 162).

[BibT_eX]

[DOI]

NII Shonan Meet. Rep., 2019

On-Line Path Computation and Function Placement in SDNs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses.

[BibT_eX]

[DOI]

Ioana Oriana Bercea

CoRR, 2019

Asymptotically Optimal Filters.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Deep Learning, 2019

Sign Based Derivative Filtering for Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2019: Deep Learning, 2019

2018

Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels.

[BibT_eX]

[DOI]

Benny Applebaum

Liron David

Theory Comput., 2018

Best of two local models: Centralized local and distributed local algorithms.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Optimal Distributed Weighted Set Cover Approximation.

[BibT_eX]

[DOI]

CoRR, 2018

Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence.

[BibT_eX]

[DOI]

CoRR, 2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds.

[BibT_eX]

[DOI]

CoRR, 2018

Minimal controllability of conjunctive Boolean networks is NP-complete.

[BibT_eX]

[DOI]

Eyal Weiss

Michael Margaliot

Autom., 2018

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality.

[BibT_eX]

[DOI]

Mohsen Ghaffari

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Online Generalized Caching with Varying Weights and Costs.

[BibT_eX]

[DOI]

Dror Rawitz

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.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2018

Recursive Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

SDNoC: Software defined network on a chip.

[BibT_eX]

[DOI]

Yaniv Fais

Jonatan Ostrometzky

Microprocess. Microsystems, 2017

Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model.

[BibT_eX]

[DOI]

Reut Levi

CoRR, 2017

Online Packet-Routing in Grids with Bounded Buffers.

[BibT_eX]

[DOI]

Algorithmica, 2017

Three Notes on Distributed Property Testing.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Competitive Path Computation and Function Placement in SDNs.

[BibT_eX]

[DOI]

CoRR, 2016

An Approximation Algorithm for Path Computation and Function Placement in SDNs.

[BibT_eX]

[DOI]

Matthias Rost

Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2016

A Constant Approximation Algorithm for Scheduling Packets on Line Networks.

[BibT_eX]

[DOI]

Adi Rosén

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Better Online Deterministic Packet Routing on Grids.

[BibT_eX]

[DOI]

CoRR, 2015

Algorithms for Network-on-Chip Design with Guaranteed QoS.

[BibT_eX]

[DOI]

Yaniv Fais

CoRR, 2015

Better Deterministic Online Packet Routing on Grids.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Deterministic Rateless Codes for BSC.

[BibT_eX]

[DOI]

Benny Applebaum

Liron David

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Distributed Maximum Matching in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014

On Decoding Irregular Tanner Codes With Local-Optimality Guarantees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Hitting sets online and unique-max coloring.

[BibT_eX]

[DOI]

Shakhar Smorodinsky

Discret. Appl. Math., 2014

Best of Two Local Models: Local Centralized and Local Distributed Algorithms.

[BibT_eX]

[DOI]

CoRR, 2014

Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Competitive and deterministic embeddings of virtual networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Local-Optimality Guarantees Based on Paths for Optimal Decoding.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices

[BibT_eX]

[DOI]

CoRR, 2013

Observability of Boolean networks: A graph-theoretic approach.

[BibT_eX]

[DOI]

Dmitriy Laschov

Michael Margaliot

Autom., 2013

2012

Revisiting randomized parallel load balancing algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Local-Optimality Guaranties for Optimal Decoding Based on Paths

[BibT_eX]

[DOI]

CoRR, 2012

Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks.

[BibT_eX]

[DOI]

Alexander Zadorojniy

Ann. Oper. Res., 2012

Online Multi-Commodity Flow with High Demands.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Local-optimality guarantees for optimal decoding based on paths.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

Hierarchies of local-optimality characterizations in decoding Tanner codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Linear-programming decoding of Tanner codes with local-optimality certificates.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Graph Algorithms, Second Edition.

[BibT_eX]

[DOI]

Shimon Even

Cambridge University Press, ISBN: 978-0-521-73653-4, 2012

Digital Logic Design - A Rigorous Approach.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-1-107-02753-4, 2012

2011

LP Decoding of Regular LDPC Codes in Memoryless Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Parallel randomized load balancing: A lower bound for a more general model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Set connectivity problems in undirected graphs and the directed steiner network problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.

[BibT_eX]

[DOI]

Zeev Nutov

Inf. Process. Lett., 2011

On Decoding Irregular Tanner Codes

[BibT_eX]

[DOI]

CoRR, 2011

Local Optimality Certificates for LP Decoding of Tanner Codes

[BibT_eX]

[DOI]

CoRR, 2011

Hitting Sets Online and Vertex Ranking.

[BibT_eX]

[DOI]

Shakhar Smorodinsky

Proceedings of the Algorithms - ESA 2011, 2011

Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model.

[BibT_eX]

[DOI]

Yakov Matsri

Proceedings of the Algorithms for Sensor Systems, 2011

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2011

2010

An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Optimal conclusive sets for comparator networks.

[BibT_eX]

[DOI]

Tamir Levi

Ami Litman

Theor. Comput. Sci., 2009

A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Scheduling with conflicts: online and offline algorithms.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Lotem Kaplan

J. Sched., 2009

A Strongly Polynomial Algorithm for Controlled Queues.

[BibT_eX]

[DOI]

Alexander Zadorojniy

Adam Shwartz

Math. Oper. Res., 2009

2008

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

An improved micro-architecture for function approximation using piecewise quadratic interpolation.

[BibT_eX]

[DOI]

Shai Erez

Proceedings of the 26th International Conference on Computer Design, 2008

2007

Recursive Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

An FPGA implementation of pipelined multiplicative division with IEEE Rounding.

[BibT_eX]

[DOI]

Ronen Goldberg

Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines, 2007

2006

A greedy approximation algorithm for the group Steiner problem.

[BibT_eX]

[DOI]

Chandra Chekuri

Discret. Appl. Math., 2006

Approximation Algorithms for Capacitated Rectangle Stabbing.

[BibT_eX]

[DOI]

Dror Rawitz

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

On Teaching Fast Adder Designs: Revisiting Ladner & Fischer.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

2005

Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On network design problems: fixed cost flows and the covering steiner problem.

[BibT_eX]

[DOI]

Wolfgang Slany

ACM Trans. Algorithms, 2005

A parametric error analysis of Goldschmidt's division algorithm.

[BibT_eX]

[DOI]

Warren E. Ferguson

J. Comput. Syst. Sci., 2005

On approximating a geometric prize-collecting traveling salesman problem with time windows.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

J. Algorithms, 2005

Hitting sets when the VC-dimension is small.

[BibT_eX]

[DOI]

Dror Rawitz

Inf. Process. Lett., 2005

2004

Delay-Optimized Implementation of IEEE Floating-Point Addition.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Min-max tree covers of graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

2003

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Generation of representative input vectors for parametric designs: from low precision to high precision.

[BibT_eX]

[DOI]

Shahar Bar-Or

Yariv Levin

Integr., 2003

Covering Graphs Using Trees and Stars.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

Pipelined Multiplicative Division with IEEE Rounding.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Proceedings of the Algorithms, 2003

2002

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.

[BibT_eX]

[DOI]

Sudipto Guha

Baruch Schieber

SIAM J. Comput., 2002

An approximation algorithm for the group Steiner problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

On the Design of Fast IEEE Floating-Point Adders.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2000

A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2000

On the Design of IEEE Compliant Floating Point Units.

[BibT_eX]

[DOI]

Wolfgang J. Paul

IEEE Trans. Computers, 2000

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Joseph Naor

Leonid Zosin

SIAM J. Comput., 2000

Embedding interconnection networks in grids via the layered cross product.

[BibT_eX]

[DOI]

Shimon Even

Networks, 2000

Divide-and-conquer approximation algorithms via spreading metrics.

[BibT_eX]

[DOI]

J. ACM, 2000

A dual precision IEEE floating-point multiplier.

[BibT_eX]

[DOI]

Silvia M. Müller

Integr., 2000

Improved approximations of crossings in graph drawings.

[BibT_eX]

[DOI]

Sudipto Guha

Baruch Schieber

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Fast Approximate Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

1998

Efficient approximation of product distributions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 1998

How many logic levels does floating-point addition require?

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors, 1998

1997

Overcoming chip-to-chip delays and clock skews.

[BibT_eX]

[DOI]

Ami Litman

Integr., 1997

A real-time systolic integer multiplier.

[BibT_eX]

[DOI]

Integr., 1997

Mirroring: a technique for pipelining semi-systolic and systolic arrays.

[BibT_eX]

[DOI]

Michael Braun

Thomas Walle

Integr., 1997

Spreading Metric Based Graph Partitioning Algorithms.

[BibT_eX]

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Pipelined Packet-Forwarding Floating Point: II. An Adder.

[BibT_eX]

[DOI]

Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

1996

Retiming revisited and reversed.

[BibT_eX]

[DOI]

Ilan Y. Spillinger

Leon Stok

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

The Retiming Lemma: A simple proof and applications.

[BibT_eX]

[DOI]

Integr., 1996

1995

Lower Bounds for Sampling Algorithms for Estimating the Average.

[BibT_eX]

[DOI]

Ran Canetti

Oded Goldreich

Inf. Process. Lett., 1995

Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Improving initialization through reversed retiming.

[BibT_eX]

[DOI]

Leon Stok

Ilan Y. Spillinger

Proceedings of the 1995 European Design and Test Conference, 1995

1994

Design of VLSI circuits using Retiming.

[BibT_eX]

[DOI]

PhD thesis, 1994

1993

Linear test sequences for detecting functionally faulty RAM's.

[BibT_eX]

[DOI]