default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Even
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]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: 104992 (2024)- [c69]Marcin Bienkowski, Guy Even:
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. STACS 2024: 15:1-15:19 - 2023
- [j60]Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. Algorithmica 85(6): 1786-1804 (2023) - [j59]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal distributed covering algorithms. Distributed Comput. 36(1): 45-55 (2023) - [c68]Guy Even, Gabriel Marques Domingues, Parham Toutian:
Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership. SPAA 2023: 291-294 - 2022
- [j58]Tomer Even, Guy Even, Adam Morrison:
Prefix Filter: Practically and Theoretically Better Than Bloom. Proc. VLDB Endow. 15(7): 1311-1323 (2022) - [c67]Ioana Oriana Bercea, Guy Even:
An extendable data structure for incremental stable perfect hashing. STOC 2022: 1298-1310 - [i35]Tomer Even, Guy Even, Adam Morrison:
Prefix Filter: Practically and Theoretically Better Than Bloom. CoRR abs/2203.17139 (2022) - 2021
- [j57]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): 326-339 (2021) - [j56]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ACM Trans. Algorithms 17(4): 28:1-28:26 (2021) - [j55]Ioana O. Bercea, Guy Even:
Upper tail analysis of bucket sort and random tries. Theor. Comput. Sci. 895: 55-67 (2021) - [c66]Ioana O. Bercea, Guy Even:
Upper Tail Analysis of Bucket Sort and Random Tries. CIAC 2021: 116-129 - [c65]Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. WADS 2021: 144-157 - 2020
- [c64]Ioana O. Bercea, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. SWAT 2020: 11:1-11:17 - [i34]Ioana Oriana Bercea, Guy Even:
Upper Tail Analysis of Bucket Sort and Random Tries. CoRR abs/2002.10499 (2020) - [i33]Ioana Oriana Bercea, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. CoRR abs/2005.01098 (2020) - [i32]Ioana Oriana Bercea, Guy Even:
A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations. CoRR abs/2005.02143 (2020)
2010 – 2019
- 2019
- [j54]Guy Even, Moti Medina, Boaz Patt-Shamir:
On-Line Path Computation and Function Placement in SDNs. Theory Comput. Syst. 63(2): 306-325 (2019) - [c63]Konstantin Berestizshevsky, Guy Even:
Sign Based Derivative Filtering for Stochastic Gradient Descent. ICANN (2) 2019: 208-219 - [c62]Konstantin Berestizshevsky, Guy Even:
Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. ICANN (2) 2019: 306-320 - [c61]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. PODC 2019: 104-106 - [c60]Guy Even:
Asymptotically Optimal Filters. SPAA 2019: 47 - [c59]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. DISC 2019: 5:1-5:15 - [i31]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Covering Algorithms. CoRR abs/1902.09377 (2019) - [i30]Ioana Oriana Bercea, Guy Even:
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. CoRR abs/1911.05060 (2019) - [i29]Guy Even, Gregory Schwartzman:
Distributed Graph Algorithms (NII Shonan Meeting 162). NII Shonan Meet. Rep. 2019 (2019) - 2018
- [j53]Eyal Weiss, Michael Margaliot, Guy Even:
Minimal controllability of conjunctive Boolean networks is NP-complete. Autom. 92: 56-62 (2018) - [j52]Guy Even, Moti Medina, Dana Ron:
Best of two local models: Centralized local and distributed local algorithms. Inf. Comput. 262: 69-89 (2018) - [j51]Benny Applebaum, Liron David, Guy Even:
Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. Theory Comput. 14(1): 1-29 (2018) - [c58]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM 2018: 8:1-8:19 - [c57]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: 226-236 - [c56]Guy Even, Moti Medina, Dror Rawitz:
Online Generalized Caching with Varying Weights and Costs. SPAA 2018: 205-212 - [c55]Guy Even, Mohsen Ghaffari, Moti Medina:
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. DISC 2018: 22:1-22:14 - [p1]Guy Even:
Recursive Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 71-84 - [i28]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR abs/1802.10403 (2018) - [i27]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(log n logΔ/ log2 logΔ) Rounds. CoRR abs/1804.01308 (2018) - [i26]Konstantin Berestizshevsky, Guy Even:
Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence. CoRR abs/1805.10982 (2018) - [i25]Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal Distributed Weighted Set Cover Approximation. CoRR abs/1808.05809 (2018) - 2017
- [j50]Guy Even, Moti Medina:
Online Packet-Routing in Grids with Bounded Buffers. Algorithmica 78(3): 819-868 (2017) - [j49]Konstantin Berestizshevsky, Guy Even, Yaniv Fais, Jonatan Ostrometzky:
SDNoC: Software defined network on a chip. Microprocess. Microsystems 50: 138-153 (2017) - [c54]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. ICALP 2017: 6:1-6:15 - [c53]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: 15:1-15:30 - [i24]Eyal Weiss, Michael Margaliot, Guy Even:
Minimal Controllability of Conjunctive Boolean Networks is NP-Complete. CoRR abs/1704.07291 (2017) - [i23]Guy Even, Reut Levi, Moti Medina:
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. CoRR abs/1705.04898 (2017) - 2016
- [c52]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. ESA 2016: 40:1-40:16 - [c51]Guy Even, Matthias Rost, Stefan Schmid:
An Approximation Algorithm for Path Computation and Function Placement in SDNs. SIROCCO 2016: 374-390 - [c50]Guy Even, Moti Medina, Boaz Patt-Shamir:
On-Line Path Computation and Function Placement in SDNs. SSS 2016: 131-147 - [i22]Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. CoRR abs/1602.06159 (2016) - [i21]Guy Even, Moti Medina, Boaz Patt-Shamir:
Competitive Path Computation and Function Placement in SDNs. CoRR abs/1602.06169 (2016) - [i20]Guy Even, Moti Medina, Adi Rosén:
A Constant Approximation Algorithm for Scheduling Packets on Line Networks. CoRR abs/1602.06174 (2016) - [i19]Guy Even, Matthias Rost, Stefan Schmid:
An Approximation Algorithm for Path Computation and Function Placement in SDNs. CoRR abs/1603.09158 (2016) - 2015
- [j48]Guy Even, Moti Medina:
A nonmonotone analysis with the primal-dual approach: Online routing of virtual circuits with unknown durations. Theor. Comput. Sci. 584: 144-154 (2015) - [j47]Guy Even, Nissim Halabi:
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming. IEEE Trans. Inf. Theory 61(10): 5295-5305 (2015) - [c49]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. ICDCN 2015: 18:1-18:10 - [c48]Benny Applebaum, Liron David, Guy Even:
Deterministic Rateless Codes for BSC. ITCS 2015: 31-40 - [c47]Guy Even, Moti Medina, Boaz Patt-Shamir:
Better Deterministic Online Packet Routing on Grids. SPAA 2015: 284-293 - [i18]Guy Even, Moti Medina, Boaz Patt-Shamir:
Better Online Deterministic Packet Routing on Grids. CoRR abs/1501.06140 (2015) - [i17]Guy Even, Yaniv Fais:
Algorithms for Network-on-Chip Design with Guaranteed QoS. CoRR abs/1509.00249 (2015) - 2014
- [j46]Guy Even, Shakhar Smorodinsky:
Hitting sets online and unique-max coloring. Discret. Appl. Math. 178: 71-82 (2014) - [j45]Nissim Halabi, Guy Even:
On Decoding Irregular Tanner Codes With Local-Optimality Guarantees. IEEE Trans. Inf. Theory 60(1): 191-211 (2014) - [c46]Guy Even, Moti Medina, Dana Ron:
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs. ESA 2014: 394-405 - [i16]Guy Even, Moti Medina, Dana Ron:
Best of Two Local Models: Local Centralized and Local Distributed Algorithms. CoRR abs/1402.3796 (2014) - [i15]Benny Applebaum, Liron David, Guy Even:
Deterministic Rateless Codes for BSC. CoRR abs/1406.0157 (2014) - [i14]Guy Even, Moti Medina:
Online Packet-Routing in Grids with Bounded Buffers. CoRR abs/1407.4498 (2014) - [i13]Guy Even, Moti Medina, Dana Ron:
Distributed Maximum Matching in Bounded Degree Graphs. CoRR abs/1407.7882 (2014) - 2013
- [j44]Dmitriy Laschov, Michael Margaliot, Guy Even:
Observability of Boolean networks: A graph-theoretic approach. Autom. 49(8): 2351-2362 (2013) - [j43]Guy Even, Nissim Halabi:
Local-Optimality Guarantees Based on Paths for Optimal Decoding. SIAM J. Discret. Math. 27(4): 2049-2063 (2013) - [j42]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and deterministic embeddings of virtual networks. Theor. Comput. Sci. 496: 184-194 (2013) - [c45]Guy Even, Moti Medina:
A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations. SIROCCO 2013: 104-115 - [i12]Guy Even, Nissim Halabi:
Message-Passing Algorithms for Packing and Covering Linear Programs with Zero-One Matrices. CoRR abs/1302.3518 (2013) - [i11]Guy Even, Moti Medina:
A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations. CoRR abs/1304.7687 (2013) - 2012
- [b3]Shimon Even, Guy Even:
Graph Algorithms, Second Edition. Cambridge University Press 2012, ISBN 978-0-521-73653-4, pp. I-XII, 1-189 - [b2]Guy Even, Moti Medina:
Digital Logic Design - A Rigorous Approach. Cambridge University Press 2012, ISBN 978-1-107-02753-4, pp. I-XX, 1-348 - [j41]Guy Even, Alexander Zadorojniy:
Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks. Ann. Oper. Res. 201(1): 159-167 (2012) - [j40]Guy Even, Moti Medina:
Revisiting randomized parallel load balancing algorithms. Theor. Comput. Sci. 444: 87-99 (2012) - [c44]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and Deterministic Embeddings of Virtual Networks. ICDCN 2012: 106-121 - [c43]Nissim Halabi, Guy Even:
Linear-programming decoding of Tanner codes with local-optimality certificates. ISIT 2012: 2686-2690 - [c42]Nissim Halabi, Guy Even:
Hierarchies of local-optimality characterizations in decoding Tanner codes. ISIT 2012: 2691-2695 - [c41]Nissim Halabi, Guy Even:
Local-optimality guarantees for optimal decoding based on paths. ISTC 2012: 205-209 - [c40]Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. WAOA 2012: 16-29 - [e2]Guy Even, Dror Rawitz:
Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7659, Springer 2012, ISBN 978-3-642-34861-7 [contents] - [e1]Guy Even, Magnús M. Halldórsson:
Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7355, Springer 2012, ISBN 978-3-642-31103-1 [contents] - [i10]Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. CoRR abs/1201.5030 (2012) - [i9]Nissim Halabi, Guy Even:
Hierarchies of Local-Optimality Characterizations in Decoding Tanner Codes. CoRR abs/1202.2251 (2012) - [i8]Nissim Halabi, Guy Even:
Local-Optimality Guaranties for Optimal Decoding Based on Paths. CoRR abs/1203.1854 (2012) - [i7]Guy Even, Shakhar Smorodinsky:
Hitting Sets Online and Unique-Max Coloring. CoRR abs/1207.2598 (2012) - 2011
- [j39]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): 296-300 (2011) - [j38]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): 18:1-18:17 (2011) - [j37]Guy Even, Moti Medina:
Parallel randomized load balancing: A lower bound for a more general model. Theor. Comput. Sci. 412(22): 2398-2408 (2011) - [j36]Nissim Halabi, Guy Even:
LP Decoding of Regular LDPC Codes in Memoryless Channels. IEEE Trans. Inf. Theory 57(2): 887-897 (2011) - [c39]Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy:
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. ALGOSENSORS 2011: 188-201 - [c38]Guy Even, Yakov Matsri, Moti Medina:
Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. ALGOSENSORS 2011: 202-214 - [c37]Guy Even, Shakhar Smorodinsky:
Hitting Sets Online and Vertex Ranking. ESA 2011: 347-357 - [c36]Guy Even, Moti Medina:
Online packet-routing in grids with bounded buffers. SPAA 2011: 215-224 - [i6]Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid:
Competitive and Deterministic Embeddings of Virtual Networks. CoRR abs/1101.5221 (2011) - [i5]Guy Even, Yaniv Fais, Moti Medina, Shimon Shahar, Alexander Zadorojniy:
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks. CoRR abs/1104.0779 (2011) - [i4]Guy Even, Yakov Matsri, Moti Medina:
Multi-Hop Routing and Scheduling in Wireless Networks in the SINR model. CoRR abs/1104.1330 (2011) - [i3]Nissim Halabi, Guy Even:
Local Optimality Certificates for LP Decoding of Tanner Codes. CoRR abs/1104.4646 (2011) - [i2]Guy Even, Nissim Halabi:
On Decoding Irregular Tanner Codes. CoRR abs/1107.2677 (2011) - 2010
- [c35]Guy Even, Moti Medina:
An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. ICALP (2) 2010: 139-150 - [c34]Nissim Halabi, Guy Even:
LP decoding of regular LDPC codes in memoryless channels. ISIT 2010: 744-748 - [c33]Guy Even, Moti Medina:
Parallel Randomized Load Balancing: A Lower Bound for a More General Model. SOFSEM 2010: 358-369 - [i1]Nissim Halabi, Guy Even:
LP Decoding of Regular LDPC Codes in Memoryless Channels. CoRR abs/1002.3117 (2010)
2000 – 2009
- 2009
- [j35]Alexander Zadorojniy, Guy Even, Adam Shwartz:
A Strongly Polynomial Algorithm for Controlled Queues. Math. Oper. Res. 34(4): 992-1007 (2009) - [j34]Guy Even, Magnús M. Halldórsson, Lotem Kaplan, Dana Ron:
Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2): 199-224 (2009) - [j33]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): 21:1-21:17 (2009) - [j32]Guy Even, Tamir Levi, Ami Litman:
Optimal conclusive sets for comparator networks. Theor. Comput. Sci. 410(14): 1369-1376 (2009) - [c32]Guy Even, Moti Medina:
Revisiting Randomized Parallel Load Balancing Algorithms. SIROCCO 2009: 209-221 - 2008
- [j31]Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3): 34:1-34:17 (2008) - [c31]Shai Erez, Guy Even:
An improved micro-architecture for function approximation using piecewise quadratic interpolation. ICCD 2008: 422-426 - [c30]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541 - 2007
- [c29]Ronen Goldberg, Guy Even, Peter-Michael Seidel:
An FPGA implementation of pipelined multiplicative division with IEEE Rounding. FCCM 2007: 185-196 - [c28]Guy Even, Tamir Levi, Ami Litman:
Optimal Conclusive Sets for Comparator Networks. SIROCCO 2007: 304-317 - [r1]Guy Even:
Recursive Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j30]Chandra Chekuri, Guy Even, Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem. Discret. Appl. Math. 154(1): 15-34 (2006) - [c27]Guy Even:
On Teaching Fast Adder Designs: Revisiting Ladner & Fischer. Essays in Memory of Shimon Even 2006: 313-347 - [c26]Guy Even, Shimon Shahar:
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs. CAAN 2006: 58-71 - [c25]Guy Even, Dror Rawitz, Shimon Shahar:
Approximation Algorithms for Capacitated Rectangle Stabbing. CIAC 2006: 18-29 - 2005
- [j29]Guy Even, Dror Rawitz, Shimon Shahar:
Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2): 358-362 (2005) - [j28]Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55(1): 76-92 (2005) - [j27]Guy Even, Peter-Michael Seidel, Warren E. Ferguson:
A parametric error analysis of Goldschmidt's division algorithm. J. Comput. Syst. Sci. 70(1): 118-139 (2005) - [j26]Guy Even, Guy Kortsarz, Wolfgang Slany:
On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms 1(1): 74-101 (2005) - [j25]Nissim Halabi, Guy Even:
Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding. IEEE Trans. Inf. Theory 51(1): 265-280 (2005) - 2004
- [j24]Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004) - [j23]Peter-Michael Seidel, Guy Even:
Delay-Optimized Implementation of IEEE Floating-Point Addition. IEEE Trans. Computers 53(2): 97-113 (2004) - 2003
- [j22]Shahar Bar-Or, Guy Even, Yariv Levin:
Generation of representative input vectors for parametric designs: from low precision to high precision. Integr. 36(1-2): 69-82 (2003) - [j21]Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. SIAM J. Comput. 33(1): 94-136 (2003) - [c24]Guy Even, Peter-Michael Seidel, Warren E. Ferguson:
A Parametric Error Analysis of Goldschmidt?s Division Algorithm. IEEE Symposium on Computer Arithmetic 2003: 165- - [c23]Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. ESA 2003: 55-66 - [c22]Guy Even, Peter-Michael Seidel:
Pipelined Multiplicative Division with IEEE Rounding. ICCD 2003: 240- - [c21]Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha:
Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35 - 2002
- [j20]Guy Even, Sudipto Guha, Baruch Schieber:
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Comput. 32(1): 231-252 (2002) - [c20]Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky:
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. FOCS 2002: 691-700 - [c19]Guy Even, Guy Kortsarz:
An approximation algorithm for the group Steiner problem. SODA 2002: 49-58 - [c18]Guy Even, Guy Kortsarz, Wolfgang Slany:
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. SWAT 2002: 318-327 - 2001
- [j19]Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor:
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. 5(4): 1-27 (2001) - [c17]Peter-Michael Seidel, Guy Even:
On the Design of Fast IEEE Floating-Point Adders. IEEE Symposium on Computer Arithmetic 2001: 184-194 - [c16]Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov:
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. RANDOM-APPROX 2001: 90-101 - 2000
- [j18]Guy Even, Silvia M. Müller, Peter-Michael Seidel:
A dual precision IEEE floating-point multiplier. Integr. 29(2): 167-180 (2000) - [j17]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4): 585-616 (2000) - [j16]Guy Even, Shimon Even:
Embedding interconnection networks in grids via the layered cross product. Networks 36(2): 91-95 (2000) - [j15]Guy Even, Joseph Naor, Leonid Zosin:
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. SIAM J. Comput. 30(4): 1231-1252 (2000) - [j14]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discret. Math. 13(2): 255-267 (2000) - [j13]Asger Munk Nielsen, David W. Matula, Chung Nan Lyu, Guy Even:
An IEEE Compliant Floating-Point Adder that Conforms with the Pipelined Packet-Forwarding Paradigm. IEEE Trans. Computers 49(1): 33-47 (2000) - [j12]Guy Even, Wolfgang J. Paul:
On the Design of IEEE Compliant Floating Point Units. IEEE Trans. Computers 49(5): 398-413 (2000) - [j11]Guy Even, Peter-Michael Seidel:
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication. IEEE Trans. Computers 49(7): 638-650 (2000) - [c15]Guy Even, Sudipto Guha, Baruch Schieber:
Improved approximations of crossings in graph drawings. STOC 2000: 296-305
1990 – 1999
- 1999
- [j10]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. 28(6): 2187-2214 (1999) - [c14]Guy Even, Peter-Michael Seidel:
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication. IEEE Symposium on Computer Arithmetic 1999: 225-232 - 1998
- [j9]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica 20(2): 151-174 (1998) - [j8]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Efficient approximation of product distributions. Random Struct. Algorithms 13(1): 1-16 (1998) - [c13]Peter-Michael Seidel, Guy Even:
How many logic levels does floating-point addition require? ICCD 1998: 142-149 - 1997
- [j7]Guy Even:
A real-time systolic integer multiplier. Integr. 22(1-2): 23-38 (1997) - [j6]Michael Braun, Guy Even, Thomas Walle:
Mirroring: a technique for pipelining semi-systolic and systolic arrays. Integr. 23(2): 115-130 (1997) - [j5]Guy Even, Ami Litman:
Overcoming chip-to-chip delays and clock skews. Integr. 24(2): 119-133 (1997) - [c12]Guy Even, Wolfgang J. Paul:
On the Design of IEEE Compliant Floating Point Units. IEEE Symposium on Computer Arithmetic 1997: 54-63 - [c11]Asger Munk Nielsen, David W. Matula, Chung Nan Lyu, Guy Even:
Pipelined Packet-Forwarding Floating Point: II. An Adder. IEEE Symposium on Computer Arithmetic 1997: 148-155 - [c10]Guy Even, Shimon Even:
Embedding Interconnection Networks in Grids via the Layered Cross Product. CIAC 1997: 3-12 - [c9]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms. PP 1997 - [c8]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SODA 1997: 639-648 - 1996
- [j4]Guy Even:
The Retiming Lemma: A simple proof and applications. Integr. 20(2): 123-137 (1996) - [j3]Guy Even, Ilan Y. Spillinger, Leon Stok:
Retiming revisited and reversed. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(3): 348-357 (1996) - [c7]Guy Even, Ami Litman:
Overcoming chip-to-chip delays and clock skews. ASAP 1996: 199-208 - [c6]Guy Even, Joseph Naor, Leonid Zosin:
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. FOCS 1996: 310-319 - [c5]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. ISTCS 1996: 78-88 - 1995
- [j2]Ran Canetti, Guy Even, Oded Goldreich:
Lower Bounds for Sampling Algorithms for Estimating the Average. Inf. Process. Lett. 53(1): 17-25 (1995) - [c4]Leon Stok, Ilan Y. Spillinger, Guy Even:
Improving initialization through reversed retiming. ED&TC 1995: 150-154 - [c3]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS 1995: 62-71 - [c2]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. IPCO 1995: 14-28 - 1994
- [b1]Guy Even:
Design of VLSI circuits using Retiming. Technion - Israel Institute of Technology, Israel, 1994 - 1993
- [j1]Guy Even, Ophir Rachman, Ilan Y. Spillinger:
Linear test sequences for detecting functionally faulty RAM's. Integr. 16(1): 75-89 (1993) - 1992
- [c1]Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic:
Approximations of General Independent Distributions. STOC 1992: 10-16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
