Edward M. Reingold

Publication Activity (10 Years)

Years Active: 1970-2014
Publications (10 Years): 0

Top Topics

Recognition Algorithm

Experimental Study

Visual Languages

Top Venues

Inf. Process. Lett.

Language, Culture, Computation (1)

Publications

Edward M. Reingold
Four Apt Elementary Examples of Recursion. Language, Culture, Computation (1) (2014)
Laurent Alonso, Edward M. Reingold
Analysis of Boyer and Moore's MJRTY algorithm. Inf. Process. Lett. 113 (13) (2013)
Nachum Dershowitz, Edward M. Reingold
Modulo intervals: a proposed notation. SIGACT News 43 (3) (2012)
Laurent Alonso, Edward M. Reingold
Improved bounds for cops-and-robber pursuit. Comput. Geom. 44 (8) (2011)
Laurent Alonso, Edward M. Reingold
Bounds for cops and robber pursuit. Comput. Geom. 43 (9) (2010)
Laurent Alonso, Edward M. Reingold
Average-case analysis of some plurality algorithms. ACM Trans. Algorithms 5 (2) (2009)
Laurent Alonso, Edward M. Reingold
Determining plurality. ACM Trans. Algorithms 4 (3) (2008)
Laurent Alonso, Edward M. Reingold
Average-case lower bounds for the plurality problem. ACM Trans. Algorithms 4 (3) (2008)
Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
The worst-case chip problem. Inf. Process. Lett. 89 (6) (2004)
Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13 (4-5) (2004)
Mitchell A. Harris, Edward M. Reingold
Line drawing, leap years, and Euclid. ACM Comput. Surv. 36 (1) (2004)
Tanya Y. Berger-Wolf, Edward M. Reingold
Index assignment for multichannel communication under failure. IEEE Trans. Inf. Theory 48 (10) (2002)
Tanya Y. Berger-Wolf, Edward M. Reingold
Index Assignment for Multichannel Communication under Failure CoRR (2000)
Gregory C. Harfst, Edward M. Reingold
A potential-based amortized analysis of the union-find data structure. SIGACT News 31 (3) (2000)
Tanya Y. Berger-Wolf, Edward M. Reingold
Optimal Multichannel Communication Under Failure. SODA (1999)
Edward M. Reingold, Kenneth J. Urban, David Gries
K-M-P String Matching Revisited. Inf. Process. Lett. 64 (5) (1997)
Laurent Alonso, Edward M. Reingold, René Schott
The Average-Case Complexity of Determining the Majority. SIAM J. Comput. 26 (1) (1997)
Edward M. Reingold
Basic Techniques for Design and Analysis of Algorithms. ACM Comput. Surv. 28 (1) (1996)
Anmol Mathur, Edward M. Reingold
-Modal Search. SIAM J. Comput. 25 (2) (1996)
Arthur S. Goldstein, Edward M. Reingold
The Complexity of Pursuit on a Graph. Theor. Comput. Sci. 143 (1) (1995)
Laurent Alonso, Edward M. Reingold, René Schott
Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discret. Math. 8 (3) (1995)
Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena
Efficient Management of Dynamic Tables. Inf. Process. Lett. 50 (1) (1994)
Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen
Calendrical Calculations, II: Three Historical Calendars. Softw. Pract. Exp. 23 (4) (1993)
Arthur S. Goldstein, Edward M. Reingold
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search. SIAM J. Comput. 22 (4) (1993)
Laurent Alonso, Edward M. Reingold, René Schott
Determining the Majority. Inf. Process. Lett. 47 (5) (1993)
Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold
"Lion and Man": Upper and Lower Bounds. INFORMS J. Comput. 4 (4) (1992)
Nachum Dershowitz, Edward M. Reingold
Ordinal Arithmetic with List Structures. LFCS (1992)
Sanjiv Kapoor, Edward M. Reingold
Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6 (2) (1991)
Edward M. Reingold, Xiaojun Shen
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case. SIAM J. Comput. 20 (1) (1991)
D. F. Wong, Edward M. Reingold
Probabilistic Analysis of a Grouping Algorithm. Algorithmica 6 (2) (1991)
Xiaojun Shen, Edward M. Reingold
Scheduling on a Hypercube. Inf. Process. Lett. 40 (6) (1991)
Edward M. Reingold, Xiaojun Shen
More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case. SIAM J. Comput. 20 (1) (1991)
Thomas M. J. Fruchterman, Edward M. Reingold
Graph Drawing by Force-directed Placement. Softw. Pract. Exp. 21 (11) (1991)
Nachum Dershowitz, Edward M. Reingold
Calendrical Calculations. Softw. Pract. Exp. 20 (9) (1990)
Zhiyuan Li, Edward M. Reingold
Solution of a Divide-and-Conquer Maximin Recurrence. SIAM J. Comput. 18 (6) (1989)
Sanjiv Kapoor, Edward M. Reingold
Optimum lopsided binary trees. J. ACM 36 (3) (1989)
Edward M. Reingold, Kenneth J. Supowit
A Hierarchy-Driven Amalgamation of Standard and Macro Cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3 (1) (1984)
Kenneth J. Supowit, Edward M. Reingold
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12 (1) (1983)
Edward M. Reingold, Kenneth J. Supowit
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13 (1) (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) (1983)
Kenneth J. Supowit, Edward M. Reingold
The Complexity of Drawing Trees Nicely. Acta Informatica 18 (1982)
A. Bagchi, Edward M. Reingold
Aspects of insertion in random trees. Computing 29 (1) (1982)
Edward M. Reingold, Robert Endre Tarjan
On a Greedy Heuristic for Complete Matching. SIAM J. Comput. 10 (4) (1981)
Edward M. Reingold
A Comment on the Evaluation of Polish Postfix Expressions. Comput. J. 24 (3) (1981)
Edward M. Reingold, John S. Tilford
Tidier Drawings of Trees. IEEE Trans. Software Eng. 7 (2) (1981)
Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold
Heuristics for Weighted Perfect Matching STOC (1980)
Yehoshua Perl, Edward M. Reingold
Understanding the Complexity of Interpolation Search. Inf. Process. Lett. 6 (6) (1977)
James R. Bitner, Gideon Ehrlich, Edward M. Reingold
Efficient Generation of the Binary Reflected Gray Code and Its Applications. Commun. ACM 19 (9) (1976)
James R. Bitner, Edward M. Reingold
Backtrack Programming Techniques. Commun. ACM 18 (11) (1975)
Jürg Nievergelt, Edward M. Reingold
Automating introductory computer science courses. SIGCSE (1973)
Jürg Nievergelt, Edward M. Reingold
Binary Search Trees of Bounded Balance. SIAM J. Comput. 2 (1) (1973)
Edward M. Reingold
A Nonrecursive List Moving Algorithm. Commun. ACM 16 (5) (1973)
Jürg Nievergelt, Edward M. Reingold
Binary Search Trees of Bounded Balance STOC (1972)
Edward M. Reingold, A. Ian Stocks
Simple Proofs of Lower Bounds for Polynomial Evaluation. Complexity of Computer Computations (1972)
Richard C. Holt, Edward M. Reingold
On the Time Required to Detect Cycles and Connectivity in Graphs. Math. Syst. Theory 6 (2) (1972)
Edward M. Reingold
Establishing lower bounds on algorithms: a survey. AFIPS Spring Joint Computing Conference (1972)
Edward M. Reingold
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack. SIAM J. Comput. 1 (4) (1972)
Edward M. Reingold
On the Optimality of Some Set Algorithms. J. ACM 19 (4) (1972)
Edward M. Reingold
Computing the Maximum and the Median SWAT (1971)
Edward M. Reingold
On the Optimality of Some Set and Vector Algorithms SWAT (1970)