2009 |
60 | EE | 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 Transactions on Algorithms 5(2): (2009) |
59 | EE | Guy Even,
Tamir Levi,
Ami Litman:
Optimal conclusive sets for comparator networks.
Theor. Comput. Sci. 410(14): 1369-1376 (2009) |
2008 |
58 | EE | Shai Erez,
Guy Even:
An improved micro-architecture for function approximation using piecewise quadratic interpolation.
ICCD 2008: 422-426 |
57 | EE | Chandra Chekuri,
Guy Even,
Anupam Gupta,
Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem.
SODA 2008: 532-541 |
56 | EE | 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 Transactions on Algorithms 4(3): (2008) |
2007 |
55 | EE | Ronen Goldberg,
Guy Even,
Peter-Michael Seidel:
An FPGA implementation of pipelined multiplicative division with IEEE Rounding.
FCCM 2007: 185-196 |
54 | EE | Guy Even,
Tamir Levi,
Ami Litman:
Optimal Conclusive Sets for Comparator Networks.
SIROCCO 2007: 304-317 |
2006 |
53 | EE | Guy Even,
Shimon Shahar:
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs.
CAAN 2006: 58-71 |
52 | EE | Guy Even,
Dror Rawitz,
Shimon Shahar:
Approximation Algorithms for Capacitated Rectangle Stabbing.
CIAC 2006: 18-29 |
51 | EE | Guy Even:
On Teaching Fast Adder Designs: Revisiting Ladner & Fischer.
Essays in Memory of Shimon Even 2006: 313-347 |
50 | EE | Chandra Chekuri,
Guy Even,
Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem.
Discrete Applied Mathematics 154(1): 15-34 (2006) |
2005 |
49 | EE | Guy Even,
Guy Kortsarz,
Wolfgang Slany:
On network design problems: fixed cost flows and the covering steiner problem.
ACM Transactions on Algorithms 1(1): 74-101 (2005) |
48 | EE | Nissim Halabi,
Guy Even:
Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding.
IEEE Transactions on Information Theory 51(1): 265-280 (2005) |
47 | EE | Guy Even,
Dror Rawitz,
Shimon Shahar:
Hitting sets when the VC-dimension is small.
Inf. Process. Lett. 95(2): 358-362 (2005) |
46 | EE | 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) |
45 | EE | 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) |
2004 |
44 | EE | Peter-Michael Seidel,
Guy Even:
Delay-Optimized Implementation of IEEE Floating-Point Addition.
IEEE Trans. Computers 53(2): 97-113 (2004) |
43 | EE | 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) |
2003 |
42 | EE | 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 |
41 | EE | Guy Even,
Peter-Michael Seidel:
Pipelined Multiplicative Division with IEEE Rounding.
ICCD 2003: 240- |
40 | EE | Guy Even,
Peter-Michael Seidel,
Warren E. Ferguson:
A Parametric Error Analysis of Goldschmidt?s Division Algorithm.
IEEE Symposium on Computer Arithmetic 2003: 165- |
39 | EE | Guy Even,
Naveen Garg,
Jochen Könemann,
R. Ravi,
Amitabh Sinha:
Covering Graphs Using Trees and Stars.
RANDOM-APPROX 2003: 24-35 |
38 | EE | Shahar Bar-Or,
Guy Even,
Yariv Levin:
Generation of representative input vectors for parametric designs: from low precision to high precision.
Integration 36(1-2): 69-82 (2003) |
37 | EE | 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) |
2002 |
36 | EE | 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 |
35 | EE | Guy Even,
Guy Kortsarz:
An approximation algorithm for the group Steiner problem.
SODA 2002: 49-58 |
34 | EE | Guy Even,
Guy Kortsarz,
Wolfgang Slany:
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.
SWAT 2002: 318-327 |
33 | EE | 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) |
2001 |
32 | EE | Peter-Michael Seidel,
Guy Even:
On the Design of Fast IEEE Floating-Point Adders.
IEEE Symposium on Computer Arithmetic 2001: 184-194 |
31 | EE | 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 |
30 | EE | 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): (2001) |
2000 |
29 | EE | Guy Even,
Sudipto Guha,
Baruch Schieber:
Improved approximations of crossings in graph drawings.
STOC 2000: 296-305 |
28 | EE | 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) |
27 | EE | Guy Even,
Wolfgang J. Paul:
On the Design of IEEE Compliant Floating Point Units.
IEEE Trans. Computers 49(5): 398-413 (2000) |
26 | EE | Guy Even,
Peter-Michael Seidel:
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication.
IEEE Trans. Computers 49(7): 638-650 (2000) |
25 | EE | Guy Even,
Silvia M. Müller,
Peter-Michael Seidel:
A dual precision IEEE floating-point multiplier.
Integration 29(2): 167-180 (2000) |
24 | EE | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics.
J. ACM 47(4): 585-616 (2000) |
23 | EE | Guy Even,
Shimon Even:
Embedding interconnection networks in grids via the layered cross product.
Networks 36(2): 91-95 (2000) |
22 | EE | 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) |
21 | EE | Guy Even,
Joseph Naor,
Baruch Schieber,
Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.
SIAM J. Discrete Math. 13(2): 255-267 (2000) |
1999 |
20 | EE | Guy Even,
Peter-Michael Seidel:
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication.
IEEE Symposium on Computer Arithmetic 1999: 225-232 |
19 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms.
SIAM J. Comput. 28(6): 2187-2214 (1999) |
1998 |
18 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Madhu Sudan:
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.
Algorithmica 20(2): 151-174 (1998) |
17 | | Guy Even,
Oded Goldreich,
Michael Luby,
Noam Nisan,
Boban Velickovic:
Efficient approximation of product distributions.
Random Struct. Algorithms 13(1): 1-16 (1998) |
1997 |
16 | | Guy Even,
Shimon Even:
Embedding Interconnection Networks in Grids via the Layered Cross Product.
CIAC 1997: 3-12 |
15 | EE | 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 |
14 | EE | Guy Even,
Wolfgang J. Paul:
On the Design of IEEE Compliant Floating Point Units.
IEEE Symposium on Computer Arithmetic 1997: 54-63 |
13 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms.
PPSC 1997 |
12 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms.
SODA 1997: 639-648 |
11 | EE | Guy Even:
A real-time systolic integer multiplier.
Integration 22(1-2): 23-38 (1997) |
10 | EE | Michael Braun,
Guy Even,
Thomas Walle:
Mirroring: a technique for pipelining semi-systolic and systolic arrays.
Integration 23(2): 115-130 (1997) |
9 | EE | Guy Even,
Ami Litman:
Overcoming chip-to-chip delays and clock skews.
Integration 24(2): 119-133 (1997) |
1996 |
8 | EE | Guy Even,
Ami Litman:
Overcoming chip-to-chip delays and clock skews.
ASAP 1996: 199-208 |
7 | | Guy Even,
Joseph Naor,
Leonid Zosin:
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.
FOCS 1996: 310-319 |
6 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.
ISTCS 1996: 78-88 |
5 | EE | Guy Even,
Ilan Y. Spillinger,
Leon Stok:
Retiming revisited and reversed.
IEEE Trans. on CAD of Integrated Circuits and Systems 15(3): 348-357 (1996) |
1995 |
4 | | Guy Even,
Joseph Naor,
Satish Rao,
Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
FOCS 1995: 62-71 |
3 | | Guy Even,
Joseph Naor,
Baruch Schieber,
Madhu Sudan:
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.
IPCO 1995: 14-28 |
2 | EE | Ran Canetti,
Guy Even,
Oded Goldreich:
Lower Bounds for Sampling Algorithms for Estimating the Average.
Inf. Process. Lett. 53(1): 17-25 (1995) |
1992 |
1 | | Guy Even,
Oded Goldreich,
Michael Luby,
Noam Nisan,
Boban Velickovic:
Approximations of General Independent Distributions
STOC 1992: 10-16 |