Guy Even

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 50

Top Venues

Publications

Guy Even, Gabriel Marques Domingues
A Micro-architecture that supports the Fano-Elias encoding and a hardware accelerator for approximate membership queries. Microprocess. Microsystems 105 (2024)
Marcin Bienkowski, Guy Even
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. STACS (2024)
Guy Even, Gabriel Marques Domingues, Parham Toutian
Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership. SPAA (2023)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
Optimal distributed covering algorithms. Distributed Comput. 36 (1) (2023)
Ioana O. Bercea, Guy Even
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. Algorithmica 85 (6) (2023)
Ioana Oriana Bercea, Guy Even
An extendable data structure for incremental stable perfect hashing. STOC (2022)
Tomer Even, Guy Even, Adam Morrison
Prefix Filter: Practically and Theoretically Better Than Bloom. CoRR (2022)
Tomer Even, Guy Even, Adam Morrison
Prefix Filter: Practically and Theoretically Better Than Bloom. Proc. VLDB Endow. 15 (7) (2022)
Ioana O. Bercea, Guy Even
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. WADS (2021)
Ioana O. Bercea, Guy Even
Upper Tail Analysis of Bucket Sort and Random Tries. CIAC (2021)
Konstantin Berestizshevsky, Koffi-Emmanuel Sadzi, Guy Even, Moni Shahar
Optimization of resource-constrained policies for COVID-19 testing and quarantining. J. Commun. Networks 23 (5) (2021)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17 (4) (2021)
Ioana O. Bercea, Guy Even
Upper tail analysis of bucket sort and random tries. Theor. Comput. Sci. 895 (2021)
Ioana Oriana Bercea, Guy Even
A Dynamic Space-Efficient Filter with Constant Time Operations. CoRR (2020)
Ioana O. Bercea, Guy Even
A Dynamic Space-Efficient Filter with Constant Time Operations. SWAT (2020)
Ioana Oriana Bercea, Guy Even
Upper Tail Analysis of Bucket Sort and Random Tries. CoRR (2020)
Ioana Oriana Bercea, Guy Even
A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations. CoRR (2020)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
Optimal Distributed Covering Algorithms. PODC (2019)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
Optimal Distributed Covering Algorithms. DISC (2019)
Guy Even, Moti Medina, Boaz Patt-Shamir
On-Line Path Computation and Function Placement in SDNs. Theory Comput. Syst. 63 (2) (2019)
Guy Even, Gregory Schwartzman
Distributed Graph Algorithms (NII Shonan Meeting 162). NII Shonan Meet. Rep. 2019 (2019)
Guy Even
Asymptotically Optimal Filters. SPAA (2019)
Konstantin Berestizshevsky, Guy Even
Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. ICANN (2) (2019)
Ioana Oriana Bercea, Guy Even
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. CoRR (2019)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
Optimal Distributed Covering Algorithms. CoRR (2019)
Konstantin Berestizshevsky, Guy Even
Sign Based Derivative Filtering for Stochastic Gradient Descent. ICANN (2) (2019)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR (2018)
Guy Even, Moti Medina, Dror Rawitz
Online Generalized Caching with Varying Weights and Costs. SPAA (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM (2018)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds. SIROCCO (2018)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
logΔ) Rounds. CoRR (2018)
Konstantin Berestizshevsky, Guy Even
Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. CoRR (2018)
Guy Even, Moti Medina, Dana Ron
Best of two local models: Centralized local and distributed local algorithms. Inf. Comput. 262 (2018)
Guy Even, Mohsen Ghaffari, Moti Medina
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. DISC (2018)
Eyal Weiss, Michael Margaliot, Guy Even
Minimal controllability of conjunctive Boolean networks is NP-complete. Autom. 92 (2018)
Benny Applebaum, Liron David, Guy Even
Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. Theory Comput. 14 (1) (2018)
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
Optimal Distributed Weighted Set Cover Approximation. CoRR (2018)
Guy Even, Moti Medina
Online Packet-Routing in Grids with Bounded Buffers. Algorithmica 78 (3) (2017)
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
Three Notes on Distributed Property Testing. DISC (2017)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP (2017)
Eyal Weiss, Michael Margaliot, Guy Even
Minimal Controllability of Conjunctive Boolean Networks is NP-Complete. CoRR (2017)
Guy Even, Reut Levi, Moti Medina
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. CoRR (2017)
Konstantin Berestizshevsky, Guy Even, Yaniv Fais, Jonatan Ostrometzky
SDNoC: Software defined network on a chip. Microprocess. Microsystems 50 (2017)
Guy Even, Moti Medina, Adi Rosén
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. CoRR (2016)
Guy Even, Reut Levi, Moti Medina, Adi Rosén
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR (2016)
Guy Even, Moti Medina, Adi Rosén
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. ESA (2016)
Guy Even, Moti Medina, Boaz Patt-Shamir
Competitive Path Computation and Function Placement in SDNs. CoRR (2016)
Guy Even, Matthias Rost, Stefan Schmid
An Approximation Algorithm for Path Computation and Function Placement in SDNs. CoRR (2016)
Guy Even, Matthias Rost, Stefan Schmid
An Approximation Algorithm for Path Computation and Function Placement in SDNs. SIROCCO (2016)
Guy Even, Moti Medina, Boaz Patt-Shamir
On-Line Path Computation and Function Placement in SDNs. SSS (2016)
Guy Even, Moti Medina
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. Theor. Comput. Sci. 584 (2015)
Guy Even, Moti Medina, Boaz Patt-Shamir
Better Online Deterministic Packet Routing on Grids. CoRR (2015)
Guy Even, Moti Medina, Dana Ron
Distributed Maximum Matching in Bounded Degree Graphs. ICDCN (2015)
Guy Even, Yaniv Fais
Algorithms for Network-on-Chip Design with Guaranteed QoS. CoRR (2015)
Benny Applebaum, Liron David, Guy Even
Deterministic Rateless Codes for BSC. ITCS (2015)
Guy Even, Moti Medina, Boaz Patt-Shamir
Better Deterministic Online Packet Routing on Grids. SPAA (2015)
Guy Even, Nissim Halabi
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming. IEEE Trans. Inf. Theory 61 (10) (2015)
Guy Even, Moti Medina
Online Packet-Routing in Grids with Bounded Buffers. CoRR (2014)
Guy Even, Moti Medina, Dana Ron
Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR (2014)
Benny Applebaum, Liron David, Guy Even
Deterministic Rateless Codes for BSC. CoRR (2014)
Guy Even, Moti Medina, Dana Ron
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. ESA (2014)
Nissim Halabi, Guy Even
On Decoding Irregular Tanner Codes With Local-Optimality Guarantees. IEEE Trans. Inf. Theory 60 (1) (2014)
Guy Even, Shakhar Smorodinsky
Hitting sets online and unique-max coloring. Discret. Appl. Math. 178 (2014)
Guy Even, Moti Medina, Dana Ron
Distributed Maximum Matching in Bounded Degree Graphs. CoRR (2014)
Dmitriy Laschov, Michael Margaliot, Guy Even
Observability of Boolean networks: A graph-theoretic approach. Autom. 49 (8) (2013)
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid
Competitive and deterministic embeddings of virtual networks. Theor. Comput. Sci. 496 (2013)
Guy Even, Moti Medina
A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations. SIROCCO (2013)
Guy Even, Nissim Halabi
Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices CoRR (2013)
Guy Even, Moti Medina
A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations CoRR (2013)
Guy Even, Nissim Halabi
Local-Optimality Guarantees Based on Paths for Optimal Decoding. SIAM J. Discret. Math. 27 (4) (2013)
Guy Even, Moti Medina
Revisiting randomized parallel load balancing algorithms. Theor. Comput. Sci. 444 (2012)
Nissim Halabi, Guy Even
Linear-programming decoding of Tanner codes with local-optimality certificates. ISIT (2012)
Nissim Halabi, Guy Even
Local-optimality guarantees for optimal decoding based on paths. ISTC (2012)
Nissim Halabi, Guy Even
Hierarchies of Local-Optimality Characterizations in Decoding Tanner Codes CoRR (2012)
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid
Competitive and Deterministic Embeddings of Virtual Networks. ICDCN (2012)
Nissim Halabi, Guy Even
Hierarchies of local-optimality characterizations in decoding Tanner codes. ISIT (2012)
Guy Even, Moti Medina
Online Multi-Commodity Flow with High Demands. WAOA (2012)
Guy Even, Alexander Zadorojniy
Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks. Ann. Oper. Res. 201 (1) (2012)
Nissim Halabi, Guy Even
Local-Optimality Guaranties for Optimal Decoding Based on Paths CoRR (2012)
Guy Even, Moti Medina
Online Multi-Commodity Flow with High Demands CoRR (2012)
Guy Even, Shakhar Smorodinsky
Hitting Sets Online and Unique-Max Coloring CoRR (2012)
Nissim Halabi, Guy Even
LP Decoding of Regular LDPC Codes in Memoryless Channels. IEEE Trans. Inf. Theory 57 (2) (2011)
Guy Even, Shakhar Smorodinsky
Hitting Sets Online and Vertex Ranking. ESA (2011)
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid
Competitive and Deterministic Embeddings of Virtual Networks CoRR (2011)
Guy Even, Moti Medina
Parallel randomized load balancing: A lower bound for a more general model. Theor. Comput. Sci. 412 (22) (2011)
Nissim Halabi, Guy Even
Local Optimality Certificates for LP Decoding of Tanner Codes CoRR (2011)
Guy Even, Guy Kortsarz, Zeev Nutov
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Inf. Process. Lett. 111 (6) (2011)
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms 7 (2) (2011)
Guy Even, Yakov Matsri, Moti Medina
Multi-Hop Routing and Scheduling in Wireless Networks in the SINR model CoRR (2011)
Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. ALGOSENSORS (2011)
Guy Even, Nissim Halabi
On Decoding Irregular Tanner Codes CoRR (2011)
Guy Even, Moti Medina
Online packet-routing in grids with bounded buffers. SPAA (2011)
Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks CoRR (2011)
Guy Even, Yakov Matsri, Moti Medina
Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. ALGOSENSORS (2011)
Nissim Halabi, Guy Even
LP decoding of regular LDPC codes in memoryless channels. ISIT (2010)
Guy Even, Moti Medina
)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. ICALP (2) (2010)
Guy Even, Moti Medina
Parallel Randomized Load Balancing: A Lower Bound for a More General Model. SOFSEM (2010)
Nissim Halabi, Guy Even
LP Decoding of Regular LDPC Codes in Memoryless Channels CoRR (2010)
Guy Even, Moti Medina
Revisiting Randomized Parallel Load Balancing Algorithms. SIROCCO (2009)
Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 5 (2) (2009)

Guy Even.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guy Even