Edward M. Reingold

Nachum Dershowitz, Edward M. Reingold: Modulo intervals: a proposed notation. SIGACT News 43(3): 60-64 (2012)

Laurent Alonso, Edward M. Reingold: Improved bounds for cops-and-robber pursuit. Comput. Geom. 44(8): 365-369 (2011)

Laurent Alonso, Edward M. Reingold: Bounds for cops and robber pursuit. Comput. Geom. 43(9): 749-766 (2010)

Laurent Alonso, Edward M. Reingold: Average-case analysis of some plurality algorithms. ACM Transactions on Algorithms 5(2) (2009)

Nachum Dershowitz, Edward M. Reingold: Calendrical calculations (3. ed.). Cambridge University Press 2008, isbn 978-0-521-88540-9, pp. I-XXIX, 1-479

Laurent Alonso, Edward M. Reingold: Determining plurality. ACM Transactions on Algorithms 4(3) (2008)

Laurent Alonso, Edward M. Reingold: Average-case lower bounds for the plurality problem. ACM Transactions on Algorithms 4(3) (2008)

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)

Mitchell A. Harris, Edward M. Reingold: Line drawing, leap years, and Euclid. ACM Comput. Surv. 36(1): 68-80 (2004)

Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott: The worst-case chip problem. Inf. Process. Lett. 89(6): 303-308 (2004)

Edward M. Reingold, Nachum Dershowitz: Calendrical calcuations - the millenium edition. Cambridge University Press 2002, isbn 978-0-521-77752-0, pp. I-XXXII, 1-422

Tanya Y. Berger-Wolf, Edward M. Reingold: Index assignment for multichannel communication under failure. IEEE Transactions on Information Theory 48(10): 2656-2668 (2002)

Gregory C. Harfst, Edward M. Reingold: A potential-based amortized analysis of the union-find data structure. SIGACT News 31(3): 86-95 (2000)

Tanya Y. Berger-Wolf, Edward M. Reingold: Index Assignment for Multichannel Communication under Failure. CoRR cs.DS/0011045 (2000)

Tanya Y. Berger-Wolf, Edward M. Reingold: Optimal Multichannel Communication Under Failure. SODA 1999: 858-859

Edward M. Reingold, Kenneth J. Urban, David Gries: K-M-P String Matching Revisited. Inf. Process. Lett. 64(5): 217-223 (1997)

Laurent Alonso, Edward M. Reingold, René Schott: The Average-Case Complexity of Determining the Majority. SIAM J. Comput. 26(1): 1-14 (1997)

Edward M. Reingold: Basic Techniques for Design and Analysis of Algorithms. The Computer Science and Engineering Handbook 1997: 64-85

Edward M. Reingold: Basic Techniques for Design and Analysis of Algorithms. ACM Comput. Surv. 28(1): 19-21 (1996)

Anmol Mathur, Edward M. Reingold: Generalized Kraft's Inequality and Discrete k-Modal Search. SIAM J. Comput. 25(2): 420-447 (1996)

Laurent Alonso, Edward M. Reingold, René Schott: Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discrete Math. 8(3): 428-447 (1995)

Arthur S. Goldstein, Edward M. Reingold: The Complexity of Pursuit on a Graph. Theor. Comput. Sci. 143(1): 93-112 (1995)

Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena: Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994)

Laurent Alonso, Edward M. Reingold, René Schott: Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993)

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)

Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen: Calendrical Calculations, II: Three Historical Calendars. Softw., Pract. Exper. 23(4): 383-404 (1993)

Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold: "Lion and Man": Upper and Lower Bounds. INFORMS Journal on Computing 4(4): 447-452 (1992)

Nachum Dershowitz, Edward M. Reingold: Ordinal Arithmetic with List Structures. LFCS 1992: 117-126

D. F. Wong, Edward M. Reingold: Probabilistic Analysis of a Grouping Algorithm. Algorithmica 6(2): 192-206 (1991)

Sanjiv Kapoor, Edward M. Reingold: Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6(2): 278-291 (1991)

Xiaojun Shen, Edward M. Reingold: Scheduling on a Hypercube. Inf. Process. Lett. 40(6): 323-328 (1991)

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)

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)

Thomas M. J. Fruchterman, Edward M. Reingold: Graph Drawing by Force-directed Placement. Softw., Pract. Exper. 21(11): 1129-1164 (1991)

Nachum Dershowitz, Edward M. Reingold: Calendrical Calculations. Softw., Pract. Exper. 20(9): 899-928 (1990)

Sanjiv Kapoor, Edward M. Reingold: Optimum lopsided binary trees. J. ACM 36(3): 573-590 (1989)

Zhiyuan Li, Edward M. Reingold: Solution of a Divide-and-Conquer Maximin Recurrence. SIAM J. Comput. 18(6): 1188-1200 (1989)

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)

Edward M. Reingold, Kenneth J. Supowit: Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13(1): 49-66 (1983)

Kenneth J. Supowit, Edward M. Reingold: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12(1): 118-143 (1983)

Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted: The Travelling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12(1): 144-156 (1983)

Kenneth J. Supowit, Edward M. Reingold: The Complexity of Drawing Trees Nicely. Acta Inf. 18: 377-392 (1982)

Edward M. Reingold: A Comment on the Evaluation of Polish Postfix Expressions. Comput. J. 24(3): 288 (1981)

Edward M. Reingold, Robert Endre Tarjan: On a Greedy Heuristic for Complete Matching. SIAM J. Comput. 10(4): 676-681 (1981)

Edward M. Reingold, John S. Tilford: Tidier Drawings of Trees. IEEE Trans. Software Eng. 7(2): 223-228 (1981)

Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold: Heuristics for Weighted Perfect Matching. STOC 1980: 398-419

Yehoshua Perl, Edward M. Reingold: Understanding the Complexity of Interpolation Search. Inf. Process. Lett. 6(6): 219-222 (1977)

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)

James R. Bitner, Edward M. Reingold: Backtrack Programming Techniques. Commun. ACM 18(11): 651-656 (1975)

Edward M. Reingold: A Nonrecursive List Moving Algorithm. Commun. ACM 16(5): 305-307 (1973)

Jürg Nievergelt, Edward M. Reingold: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2(1): 33-43 (1973)

Edward M. Reingold: On the Optimality of Some Set Algorithms. J. ACM 19(4): 649-659 (1972)

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)

Edward M. Reingold: Infix to Prefix Translation: The Insufficiency of a Pushdown Stack. SIAM J. Comput. 1(4): 350-353 (1972)

Edward M. Reingold, A. Ian Stocks: Simple Proofs of Lower Bounds for Polynomial Evaluation. Complexity of Computer Computations 1972: 21-30

Jürg Nievergelt, Edward M. Reingold: Binary Search Trees of Bounded Balance. STOC 1972: 137-142

Edward M. Reingold: Computing the Maximum and the Median. SWAT (FOCS) 1971: 216-218

Edward M. Reingold: On the Optimality of Some Set and Vector Algorithms. SWAT (FOCS) 1970: 68-71