Edward M. Reingold - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 65 from 65

2014

Basic Techniques for Design and Analysis of AlgorithmsEdward M. Reingold. In Teofilo F. Gonzalez, Jorge Diaz-Herrera, Allen Tucker, editors, Computing Handbook, Third Edition: Computer Science and Software Engineering. CRC Press, 2014.

Four Apt Elementary Examples of RecursionEdward M. Reingold. BIRTHDAY 2014: 213-224 [doi]

2013

Analysis of Boyer and Moore's MJRTY algorithmLaurent Alonso, Edward M. Reingold. ipl, 113(13):495-497, 2013. [doi]

2012

Modulo intervals: a proposed notationNachum Dershowitz, Edward M. Reingold. sigact, 43(3):60-64, 2012. [doi]

2011

Improved bounds for cops-and-robber pursuitLaurent Alonso, Edward M. Reingold. comgeo, 44(8):365-369, 2011. [doi]

2010

Bounds for cops and robber pursuitLaurent Alonso, Edward M. Reingold. comgeo, 43(9):749-766, 2010. [doi]

2009

Average-case analysis of some plurality algorithmsLaurent Alonso, Edward M. Reingold. TALG, 5(2), 2009. [doi]

2008

Determining pluralityLaurent Alonso, Edward M. Reingold. TALG, 4(3), 2008. [doi]

Average-case lower bounds for the plurality problemLaurent Alonso, Edward M. Reingold. TALG, 4(3), 2008. [doi]

Calendrical calculations (3. ed.)Nachum Dershowitz, Edward M. Reingold. Cambridge University Press, 2008.

2004

The worst-case chip problemLaurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott. ipl, 89(6):303-308, 2004. [doi]

Quicksort with Unreliable Comparisons: A Probabilistic AnalysisLaurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott. cpc, 13(4-5):419-449, 2004. [doi]

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

2002

Index assignment for multichannel communication under failureTanya Y. Berger-Wolf, Edward M. Reingold. TIT, 48(10):2656-2668, 2002.

Calendrical Tabulations - 1900 - 2200Edward M. Reingold, Nachum Dershowitz. Cambridge University Press, 2002. [doi]

Calendrical calcuations - the millenium editionEdward M. Reingold, Nachum Dershowitz. Cambridge University Press, 2002.

2000

A potential-based amortized analysis of the union-find data structureGregory C. Harfst, Edward M. Reingold. sigact, 31(3):86-95, 2000. [doi]

1999

Optimal Multichannel Communication Under FailureTanya Y. Berger-Wolf, Edward M. Reingold. soda 1999: 858-859 [doi]

Algorithm Design and Analysis TechniquesEdward M. Reingold. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

1997

The Average-Case Complexity of Determining the MajorityLaurent Alonso, Edward M. Reingold, René Schott. SICOMP, 26(1):1-14, 1997.

Basic Techniques for Design and Analysis of AlgorithmsEdward M. Reingold. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 64-85, CRC Press, 1997.

K-M-P String Matching RevisitedEdward M. Reingold, Kenneth J. Urban, David Gries. ipl, 64(5):217-223, 1997. [doi]

1996

Generalized Kraft s Inequality and Discrete ::::k::::-Modal SearchAnmol Mathur, Edward M. Reingold. SICOMP, 25(2):420-447, 1996.

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

1995

Multidimensional Divide-and-Conquer Maximin RecurrencesLaurent Alonso, Edward M. Reingold, René Schott. siamdm, 8(3):428-447, 1995. [doi]

The Complexity of Pursuit on a GraphArthur S. Goldstein, Edward M. Reingold. TCS, 143(1):93-112, 1995. [doi]

1994

Efficient Management of Dynamic TablesAviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena. ipl, 50(1):25-30, 1994.

1993

Determining the MajorityLaurent Alonso, Edward M. Reingold, René Schott. ipl, 47(5):253-255, 1993.

A Fibonacci Version of Kraft s Inequality Applied to Discrete Unimodal SearchArthur S. Goldstein, Edward M. Reingold. SICOMP, 22(4):751-777, 1993.

Calendrical Calculations, II: Three Historical CalendarsEdward M. Reingold, Nachum Dershowitz, Stewart M. Clamen. SPE, 23(4):383-404, 1993.

1992

"Lion and Man": Upper and Lower BoundsLaurent Alonso, Arthur S. Goldstein, Edward M. Reingold. informs, 4(4):447-452, 1992. [doi]

Ordinal Arithmetic with List StructuresNachum Dershowitz, Edward M. Reingold. lfcs 1992: 117-126

1991

Graph Drawing by Force-directed PlacementThomas M. J. Fruchterman, Edward M. Reingold. SPE, 21(11):1129-1164, 1991.

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

More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite CaseEdward M. Reingold, Xiaojun Shen. SICOMP, 20(1):156-183, 1991.

More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite CaseEdward M. Reingold, Xiaojun Shen. SICOMP, 20(1):184-208, 1991.

Scheduling on a HypercubeXiaojun Shen, Edward M. Reingold. ipl, 40(6):323-328, 1991.

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

1990

Calendrical CalculationsNachum Dershowitz, Edward M. Reingold. SPE, 20(9):899-928, 1990.

1989

Optimum lopsided binary treesSanjiv Kapoor, Edward M. Reingold. JACM, 36(3):573-590, 1989. [doi]

Solution of a Divide-and-Conquer Maximin RecurrenceZhiyuan Li, Edward M. Reingold. SICOMP, 18(6):1188-1200, 1989.

1984

A Hierarchy-Driven Amalgamation of Standard and Macro CellsEdward M. Reingold, Kenneth J. Supowit. tcad, 3(1):3-11, 1984. [doi]

1983

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matchingEdward M. Reingold, Kenneth J. Supowit. networks, 13(1):49-66, 1983. [doi]

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

The Traveling Salesman Problem and Minimum Matching in the Unit SquareKenneth J. Supowit, Edward M. Reingold, David A. Plaisted. SICOMP, 12(1):144-156, 1983.

1982

Aspects of insertion in random treesA. Bagchi, Edward M. Reingold. computing, 29(1):11-29, 1982. [doi]

The Complexity of Drawing Trees NicelyKenneth J. Supowit, Edward M. Reingold. ACTA, 18:377-392, 1982.

1981

On a Greedy Heuristic for Complete MatchingEdward M. Reingold, Robert Endre Tarjan. SICOMP, 10(4):676-681, 1981.

A Comment on the Evaluation of Polish Postfix ExpressionsEdward M. Reingold. cj, 24(3):288, 1981.

Tidier Drawings of TreesEdward M. Reingold, John S. Tilford. TSE, 7(2):223-228, 1981.

1980

Heuristics for Weighted Perfect MatchingKenneth J. Supowit, David A. Plaisted, Edward M. Reingold. stoc 1980: 398-419

1977

Understanding the Complexity of Interpolation SearchYehoshua Perl, Edward M. Reingold. ipl, 6(6):219-222, 1977.

1976

Efficient Generation of the Binary Reflected Gray Code and Its ApplicationsJames R. Bitner, Gideon Ehrlich, Edward M. Reingold. CACM, 19(9):517-521, 1976.

1975

Backtrack Programming TechniquesJames R. Bitner, Edward M. Reingold. CACM, 18(11):651-656, 1975.

1973

Binary Search Trees of Bounded BalanceJürg Nievergelt, Edward M. Reingold. SICOMP, 2(1):33-43, 1973.

Automating introductory computer science coursesJürg Nievergelt, Edward M. Reingold. sigcse 1973: 24-25 [doi]

A Nonrecursive List Moving AlgorithmEdward M. Reingold. CACM, 16(5):305-307, 1973.

1972

On the Time Required to Detect Cycles and Connectivity in GraphsRichard C. Holt, Edward M. Reingold. mst, 6(2):103-106, 1972.

Binary Search Trees of Bounded BalanceJürg Nievergelt, Edward M. Reingold. stoc 1972: 137-142

Infix to Prefix Translation: The Insufficiency of a Pushdown StackEdward M. Reingold. SICOMP, 1(4):350-353, 1972.

On the Optimality of Some Set AlgorithmsEdward M. Reingold. JACM, 19(4):649-659, 1972. [doi]

Simple Proofs of Lower Bounds for Polynomial EvaluationEdward M. Reingold, A. Ian Stocks. coco 1972: 21-30

1971

Computing the Maximum and the MedianEdward M. Reingold. focs 1971: 216-218

On Some Optimal AlgorithmsEdward M. Reingold. PhD thesis, Cornell University, USA, 1971.

1970

On the Optimality of Some Set and Vector AlgorithmsEdward M. Reingold. focs 1970: 68-71

Sign in or sign up to see more results.

runs on WebDSL