Edward M. Reingold

According to our database, Edward M. Reingold authored at least 65 papers between 1970 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2014

Four Apt Elementary Examples of Recursion.

Edward M. Reingold

Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Basic Techniques for Design and Analysis of Algorithms.

Edward M. Reingold

Proceedings of the Computing Handbook, 2014

2013

Analysis of Boyer and Moore's MJRTY algorithm.

Laurent Alonso, Edward M. Reingold

Inf. Process. Lett., 2013

2012

Modulo intervals: a proposed notation.

Nachum Dershowitz, Edward M. Reingold

SIGACT News, 2012

2011

Improved bounds for cops-and-robber pursuit.

Laurent Alonso, Edward M. Reingold

Comput. Geom., 2011

2010

Bounds for cops and robber pursuit.

Laurent Alonso, Edward M. Reingold

Comput. Geom., 2010

2009

Average-case analysis of some plurality algorithms.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2009

2008

Average-case lower bounds for the plurality problem.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2008

Determining plurality.

Laurent Alonso, Edward M. Reingold

ACM Trans. Algorithms, 2008

Calendrical calculations (3. ed.).

Nachum Dershowitz, Edward M. Reingold

Cambridge University Press, ISBN: 978-0-521-88540-9, 2008

2004

The worst-case chip problem.

Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott

Inf. Process. Lett., 2004

Line drawing, leap years, and Euclid.

Mitchell A. Harris, Edward M. Reingold

ACM Comput. Surv., 2004

Quicksort with Unreliable Comparisons: A Probabilistic Analysis.

Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott

Comb. Probab. Comput., 2004

2002

Index assignment for multichannel communication under failure.

Tanya Y. Berger-Wolf, Edward M. Reingold

IEEE Trans. Inf. Theory, 2002

Calendrical Tabulations - 1900 - 2200.

Edward M. Reingold, Nachum Dershowitz

Cambridge University Press, ISBN: 978-0-521-78253-1, 2002

Calendrical calcuations - the millenium edition.

Edward M. Reingold, Nachum Dershowitz

Cambridge University Press, ISBN: 978-0-521-77752-0, 2002

2000

A potential-based amortized analysis of the union-find data structure.

Gregory C. Harfst, Edward M. Reingold

SIGACT News, 2000

1999

Optimal Multichannel Communication Under Failure.

Tanya Y. Berger-Wolf, Edward M. Reingold

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Algorithm Design and Analysis Techniques.

Edward M. Reingold

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1997

The Average-Case Complexity of Determining the Majority.

Laurent Alonso, Edward M. Reingold, René Schott

SIAM J. Comput., 1997

K-M-P String Matching Revisited.

Edward M. Reingold, Kenneth J. Urban, David Gries

Inf. Process. Lett., 1997

Basic Techniques for Design and Analysis of Algorithms.

Edward M. Reingold

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Generalized Kraft's Inequality and Discrete <i>k</i>-Modal Search.

Anmol Mathur, Edward M. Reingold

SIAM J. Comput., 1996

Basic Techniques for Design and Analysis of Algorithms.

Edward M. Reingold

ACM Comput. Surv., 1996

1995

The Complexity of Pursuit on a Graph.

Arthur S. Goldstein, Edward M. Reingold

Theor. Comput. Sci., 1995

Multidimensional Divide-and-Conquer Maximin Recurrences.

Laurent Alonso, Edward M. Reingold, René Schott

SIAM J. Discret. Math., 1995

1994

Efficient Management of Dynamic Tables.

Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena

Inf. Process. Lett., 1994

1993

Calendrical Calculations, II: Three Historical Calendars.

Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen

Softw. Pract. Exp., 1993

A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search.

Arthur S. Goldstein, Edward M. Reingold

SIAM J. Comput., 1993

Determining the Majority.

Laurent Alonso, Edward M. Reingold, René Schott

Inf. Process. Lett., 1993

1992

"Lion and Man": Upper and Lower Bounds.

Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold

INFORMS J. Comput., 1992

Ordinal Arithmetic with List Structures.

Nachum Dershowitz, Edward M. Reingold

Proceedings of the Logical Foundations of Computer Science, 1992

1991

Graph Drawing by Force-directed Placement.

Thomas M. J. Fruchterman, Edward M. Reingold

Softw. Pract. Exp., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.

Edward M. Reingold, Xiaojun Shen

SIAM J. Comput., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case.

Edward M. Reingold, Xiaojun Shen

SIAM J. Comput., 1991

Scheduling on a Hypercube.

Xiaojun Shen, Edward M. Reingold

Inf. Process. Lett., 1991

Probabilistic Analysis of a Grouping Algorithm.

D. F. Wong, Edward M. Reingold

Algorithmica, 1991

Stochastic Rearrangement Rules for Self-Organizing Data Structures.

Sanjiv Kapoor, Edward M. Reingold

Algorithmica, 1991

1990

Calendrical Calculations.

Nachum Dershowitz, Edward M. Reingold

Softw. Pract. Exp., 1990

1989

Solution of a Divide-and-Conquer Maximin Recurrence.

Zhiyuan Li, Edward M. Reingold

SIAM J. Comput., 1989

Optimum lopsided binary trees.

Sanjiv Kapoor, Edward M. Reingold

J. ACM, 1989

1984

A Hierarchy-Driven Amalgamation of Standard and Macro Cells.

Edward M. Reingold, Kenneth J. Supowit

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1984

1983

The Travelling Salesman Problem and Minimum Matching in the Unit Square.

Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted

SIAM J. Comput., 1983

Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.

Kenneth J. Supowit, Edward M. Reingold

SIAM J. Comput., 1983

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching.

Edward M. Reingold, Kenneth J. Supowit

Networks, 1983

1982

Aspects of insertion in random trees.

A. Bagchi, Edward M. Reingold

Computing, 1982

The Complexity of Drawing Trees Nicely.

Kenneth J. Supowit, Edward M. Reingold

Acta Informatica, 1982

1981

Tidier Drawings of Trees.

Edward M. Reingold, John S. Tilford

IEEE Trans. Software Eng., 1981

On a Greedy Heuristic for Complete Matching.

Edward M. Reingold, Robert Endre Tarjan

SIAM J. Comput., 1981

A Comment on the Evaluation of Polish Postfix Expressions.

Edward M. Reingold

Comput. J., 1981

1980

Heuristics for Weighted Perfect Matching

Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1977

Understanding the Complexity of Interpolation Search.

Yehoshua Perl, Edward M. Reingold

Inf. Process. Lett., 1977

1976

Efficient Generation of the Binary Reflected Gray Code and Its Applications.

James R. Bitner, Gideon Ehrlich, Edward M. Reingold

Commun. ACM, 1976

1975

Backtrack Programming Techniques.

James R. Bitner, Edward M. Reingold

Commun. ACM, 1975

1973

Binary Search Trees of Bounded Balance.

Jürg Nievergelt, Edward M. Reingold

SIAM J. Comput., 1973

A Nonrecursive List Moving Algorithm.

Edward M. Reingold

Commun. ACM, 1973

Automating introductory computer science courses.

Jürg Nievergelt, Edward M. Reingold

Proceedings of the 3rd SIGCSE Technical Symposium on Computer Science Education, 1973

1972

Infix to Prefix Translation: The Insufficiency of a Pushdown Stack.

Edward M. Reingold

SIAM J. Comput., 1972

On the Time Required to Detect Cycles and Connectivity in Graphs.

Richard C. Holt, Edward M. Reingold

Math. Syst. Theory, 1972

On the Optimality of Some Set Algorithms.

Edward M. Reingold

J. ACM, 1972

Simple Proofs of Lower Bounds for Polynomial Evaluation.

Edward M. Reingold, A. Ian Stocks

Proceedings of a symposium on the Complexity of Computer Computations, 1972

Establishing lower bounds on algorithms: a survey.

Edward M. Reingold

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

1971

On Some Optimal Algorithms.

Edward M. Reingold

PhD thesis, 1971

Computing the Maximum and the Median

Edward M. Reingold

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

On the Optimality of Some Set and Vector Algorithms

Edward M. Reingold

Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970