2009 |
49 | EE | Laurent Alonso,
Edward M. Reingold:
Average-case analysis of some plurality algorithms.
ACM Transactions on Algorithms 5(2): (2009) |
2008 |
48 | EE | Laurent Alonso,
Edward M. Reingold:
Average-case lower bounds for the plurality problem.
ACM Transactions on Algorithms 4(3): (2008) |
47 | EE | Laurent Alonso,
Edward M. Reingold:
Determining plurality.
ACM Transactions on Algorithms 4(3): (2008) |
2004 |
46 | EE | Mitchell A. Harris,
Edward M. Reingold:
Line drawing, leap years, and Euclid.
ACM Comput. Surv. 36(1): 68-80 (2004) |
45 | EE | Laurent Alonso,
Philippe Chassaing,
Florent Gillet,
Svante Janson,
Edward M. Reingold,
René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing 13(4-5): 419-449 (2004) |
44 | EE | Laurent Alonso,
Philippe Chassaing,
Edward M. Reingold,
René Schott:
The worst-case chip problem.
Inf. Process. Lett. 89(6): 303-308 (2004) |
2002 |
43 | | Tanya Y. Berger-Wolf,
Edward M. Reingold:
Index assignment for multichannel communication under failure.
IEEE Transactions on Information Theory 48(10): 2656-2668 (2002) |
2000 |
42 | EE | Tanya Y. Berger-Wolf,
Edward M. Reingold:
Index Assignment for Multichannel Communication under Failure
CoRR cs.DS/0011045: (2000) |
1999 |
41 | EE | Tanya Y. Berger-Wolf,
Edward M. Reingold:
Optimal Multichannel Communication Under Failure.
SODA 1999: 858-859 |
1997 |
40 | | Edward M. Reingold:
Basic Techniques for Design and Analysis of Algorithms.
The Computer Science and Engineering Handbook 1997: 64-85 |
39 | EE | Edward M. Reingold,
Kenneth J. Urban,
David Gries:
K-M-P String Matching Revisited.
Inf. Process. Lett. 64(5): 217-223 (1997) |
38 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput. 26(1): 1-14 (1997) |
1996 |
37 | | Edward M. Reingold:
Basic Techniques for Design and Analysis of Algorithms.
ACM Comput. Surv. 28(1): 19-21 (1996) |
36 | | Anmol Mathur,
Edward M. Reingold:
Generalized Kraft's Inequality and Discrete k-Modal Search.
SIAM J. Comput. 25(2): 420-447 (1996) |
1995 |
35 | EE | Laurent Alonso,
Edward M. Reingold,
René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math. 8(3): 428-447 (1995) |
34 | EE | Arthur S. Goldstein,
Edward M. Reingold:
The Complexity of Pursuit on a Graph.
Theor. Comput. Sci. 143(1): 93-112 (1995) |
1994 |
33 | | Aviezri S. Fraenkel,
Edward M. Reingold,
Prashant Saxena:
Efficient Management of Dynamic Tables.
Inf. Process. Lett. 50(1): 25-30 (1994) |
1993 |
32 | | Laurent Alonso,
Edward M. Reingold,
René Schott:
Determining the Majority.
Inf. Process. Lett. 47(5): 253-255 (1993) |
31 | | Arthur S. Goldstein,
Edward M. Reingold:
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search.
SIAM J. Comput. 22(4): 751-777 (1993) |
30 | | Edward M. Reingold,
Nachum Dershowitz,
Stewart M. Clamen:
Calendrical Calculations, II: Three Historical Calendars.
Softw., Pract. Exper. 23(4): 383-404 (1993) |
1992 |
29 | | Nachum Dershowitz,
Edward M. Reingold:
Ordinal Arithmetic with List Structures.
LFCS 1992: 117-126 |
1991 |
28 | | D. F. Wong,
Edward M. Reingold:
Probabilistic Analysis of a Grouping Algorithm.
Algorithmica 6(2): 192-206 (1991) |
27 | | Sanjiv Kapoor,
Edward M. Reingold:
Stochastic Rearrangement Rules for Self-Organizing Data Structures.
Algorithmica 6(2): 278-291 (1991) |
26 | | Xiaojun Shen,
Edward M. Reingold:
Scheduling on a Hypercube.
Inf. Process. Lett. 40(6): 323-328 (1991) |
25 | | Edward M. Reingold,
Xiaojun Shen:
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case.
SIAM J. Comput. 20(1): 156-183 (1991) |
24 | | Edward M. Reingold,
Xiaojun Shen:
More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.
SIAM J. Comput. 20(1): 184-208 (1991) |
23 | | Thomas M. J. Fruchterman,
Edward M. Reingold:
Graph Drawing by Force-directed Placement.
Softw., Pract. Exper. 21(11): 1129-1164 (1991) |
1990 |
22 | | Nachum Dershowitz,
Edward M. Reingold:
Calendrical Calculations.
Softw., Pract. Exper. 20(9): 899-928 (1990) |
1989 |
21 | EE | Sanjiv Kapoor,
Edward M. Reingold:
Optimum lopsided binary trees.
J. ACM 36(3): 573-590 (1989) |
20 | | Zhiyuan Li,
Edward M. Reingold:
Solution of a Divide-and-Conquer Maximin Recurrence.
SIAM J. Comput. 18(6): 1188-1200 (1989) |
1984 |
19 | EE | Edward M. Reingold,
Kenneth J. Supowit:
A Hierarchy-Driven Amalgamation of Standard and Macro Cells.
IEEE Trans. on CAD of Integrated Circuits and Systems 3(1): 3-11 (1984) |
1983 |
18 | | Kenneth J. Supowit,
Edward M. Reingold:
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.
SIAM J. Comput. 12(1): 118-143 (1983) |
17 | | Kenneth J. Supowit,
Edward M. Reingold,
David A. Plaisted:
The Traveling Salesman Problem and Minimum Matching in the Unit Square.
SIAM J. Comput. 12(1): 144-156 (1983) |
1982 |
16 | | Kenneth J. Supowit,
Edward M. Reingold:
The Complexity of Drawing Trees Nicely.
Acta Inf. 18: 377-392 (1982) |
1981 |
15 | | Edward M. Reingold:
A Comment on the Evaluation of Polish Postfix Expressions.
Comput. J. 24(3): 288 (1981) |
14 | | Edward M. Reingold,
John S. Tilford:
Tidier Drawings of Trees.
IEEE Trans. Software Eng. 7(2): 223-228 (1981) |
13 | | Edward M. Reingold,
Robert Endre Tarjan:
On a Greedy Heuristic for Complete Matching.
SIAM J. Comput. 10(4): 676-681 (1981) |
1980 |
12 | | Kenneth J. Supowit,
David A. Plaisted,
Edward M. Reingold:
Heuristics for Weighted Perfect Matching
STOC 1980: 398-419 |
1977 |
11 | | Yehoshua Perl,
Edward M. Reingold:
Understanding the Complexity of Interpolation Search.
Inf. Process. Lett. 6(6): 219-222 (1977) |
1976 |
10 | | James R. Bitner,
Gideon Ehrlich,
Edward M. Reingold:
Efficient Generation of the Binary Reflected Gray Code and Its Applications.
Commun. ACM 19(9): 517-521 (1976) |
1975 |
9 | | James R. Bitner,
Edward M. Reingold:
Backtrack Programming Techniques.
Commun. ACM 18(11): 651-656 (1975) |
1973 |
8 | | Edward M. Reingold:
A Nonrecursive List Moving Algorithm.
Commun. ACM 16(5): 305-307 (1973) |
7 | | Jürg Nievergelt,
Edward M. Reingold:
Binary Search Trees of Bounded Balance.
SIAM J. Comput. 2(1): 33-43 (1973) |
1972 |
6 | | Jürg Nievergelt,
Edward M. Reingold:
Binary Search Trees of Bounded Balance
STOC 1972: 137-142 |
5 | EE | Edward M. Reingold:
On the Optimality of Some Set Algorithms.
J. ACM 19(4): 649-659 (1972) |
4 | | Richard C. Holt,
Edward M. Reingold:
On the Time Required to Detect Cycles and Connectivity in Graphs.
Mathematical Systems Theory 6(2): 103-106 (1972) |
3 | | Edward M. Reingold:
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack.
SIAM J. Comput. 1(4): 350-353 (1972) |
1971 |
2 | | Edward M. Reingold:
Computing the Maximum and the Median
FOCS 1971: 216-218 |
1970 |
1 | | Edward M. Reingold:
On the Optimality of Some Set and Vector Algorithms
FOCS 1970: 68-71 |