Robert Sedgewick

According to our database1, Robert Sedgewick
  • authored at least 84 papers between 1970 and 2017.
  • has a "Dijkstra number"2 of three.


ACM Fellow

ACM Fellow 1997, "For seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.".



In proceedings 
PhD thesis 





Computer Science - An Interdisciplinary Approach.
Pearson / Addison Wesley, ISBN: 978-0-1340-7642-3, 2017

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101).
Dagstuhl Reports, 2016

Introduction for S.I. AofA14.
Algorithmica, 2016

Algorithms (Fourth edition deluxe).
Addison-Wesley, ISBN: 978-0-1343-8468-9, 2016

Introduction to Programming in Python - An Interdisciplinary Approach.
Addison-Wesley, ISBN: 978-0-1340-7643-0, 2015

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091).
Dagstuhl Reports, 2014

In Memory of Philippe Flajolet.
Combinatorics, Probability & Computing, 2014

Algorithmen - Algorithmen und Datenstrukturen (4. aktualisierte Auflage).
Pearson Studium, ISBN: 978-3-8689-4184-5, 2014

Introduction to Programming in Java - An Interdisciplinary Approach (Pearson New International Edition).
Pearson / Addison Wesley, ISBN: 978-1-29202-556-8, 2014

Guest Editorial.
Algorithmica, 2013

Philippe Flajolet, the Father of Analytic Combinatorics.
Algorithmica, 2012

Philippe Flajolet, the Father of Analytic Combinatorics.
Theor. Comput. Sci., 2011

Philippe flajolet, the father of analytic combinatorics.
ACM Trans. Algorithms, 2011

Obituary. Philippe Flajolet.
J. Symb. Comput., 2011

In memoriam: Philippe Flajolet, the father of analytic combinatorics.
RAIRO - Theor. Inf. and Applic., 2011

Philippe Flajolet (1948-2011).
Bulletin of the EATCS, 2011

Philippe Flajolet 1 December 1948 - 22 March 2011.
Combinatorics, Probability & Computing, 2011

Philippe Flajolet: the father of analytic combinatorics.
ACM Comm. Computer Algebra, 2011

Algorithms for the Masses.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

Einführung in die Programmierung mit Java.
Pearson, ISBN: 978-3-86894-076-3, 2011

Algorithms, 4th Edition.
Addison-Wesley, ISBN: 978-0-321-57351-3, 2011

Analytic Combinatorics.
Cambridge University Press, ISBN: 978-0-521-89806-5, 2009

CS-1 for scientists.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

08081 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 17.02. - 22.02.2008, 2008

Introduction to programming in Java - an interdisciplinary approach.
Pearson / Addison Wesley, ISBN: 978-0-321-49805-2, 2008

06091 Abstracts Collection -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

06091 Executive Summary -- Data Structures.
Proceedings of the Data Structures, 26.02. - 03.03.2006, 2006

Algorithmen in C.
Pearson Studium, ISBN: 978-3-8273-7182-9, 2005

04091 Abstracts Collection - Data Structures.
Proceedings of the Data Structures, 22.-27. February 2004, 2004

Algorithmen in C++ - Teile 1 - 4, Grundlagen, Datenstrukturen, Sortieren, Suchen (3. Aufl.).
Pearson Studium, ISBN: 978-3-8273-7026-6, 2002

Algorithmen (2. Aufl.).
Pearson Studium, ISBN: 978-3-8273-7032-7, 2002

Algorithms in C++ - part 5: graph algorithms (3. ed.).
Addison-Wesley-Longman, ISBN: 978-0-201-36118-6, 2002

Algorithms in C - part 5: graph algorithms (3 .ed.).
Addison-Wesley-Longman, ISBN: 978-0-201-31663-6, 2002

Resizable Arrays in Optimal Time and Space.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Algorithms in C - parts 1-4: fundamentals, data structures, sorting, searching (3. ed.).
Addison-Wesley-Longman, ISBN: 978-0-201-31452-6, 1998

Algorithms in C++ - Parts 1-4: Fundamentals, Data Structures, Sorting, Searching.
Addison-Wesley-Longman, ISBN: 978-0-201-35088-3, 1998

Fast Algorithms for Sorting and Searching Strings.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Analysis of Shellsort and Related Algorithms.
Proceedings of the Algorithms, 1996

An introduction to the analysis of algorithms.
Addison-Wesley-Longman, ISBN: 978-0-201-40009-0, 1996

Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals.
Theor. Comput. Sci., 1995

The Analysis of Heapsort.
J. Algorithms, 1993

Inf. Process. Lett., 1993

Towards Uncheatable benchmarks.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

Deterministic Skip Lists.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Algorithms in C++.
Addison-Wesley, ISBN: 978-0-201-51059-1, 1992

Algorithmen in C++.
Addison-Wesley, ISBN: 978-3-89319-462-9, 1992

Algorithmen in C.
Addison-Wesley, ISBN: 978-3-89319-376-9, 1992

Addison-Wesley, ISBN: 978-3-89319-301-1, 1991

Tight Lower Bounds for Shellsort.
J. Algorithms, 1990

More on Shellsort Increment Sequences.
Inf. Process. Lett., 1990

Algorithms in C.
Addison-Wesley, ISBN: 978-0-201-51425-4, 1990

Bad Cases for Shaker-Sort.
Inf. Process. Lett., 1988

Tight Lower Bounds for Shellsort.
Proceedings of the SWAT 88, 1988

Analysis of a Simple Yet Efficient Convex Hull Algorithm.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Algorithms, 2nd Edition
Addison-Wesley, ISBN: 0-201-06673-4, 1988

Practical Variations of Shellsort.
Inf. Process. Lett., 1987

Digital Search Trees Revisited.
SIAM J. Comput., 1986

A New Upper Bound for Shellsort.
J. Algorithms, 1986

Shortest Paths in Euclidean Graphs.
Algorithmica, 1986

The Pairing Heap: A New Form of Self-Adjusting Heap.
Algorithmica, 1986

Techniques for Algorithm Animation.
IEEE Software, 1985

Improved Upper Bounds on Shellsort.
J. Comput. Syst. Sci., 1985

A system for algorithm animation.
Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques, 1984

Shortest Paths in Euclidean Graphs (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

VLSI Layout as Programming.
ACM Trans. Program. Lang. Syst., 1983

Improved Upper Bounds on Shellsort
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Addison-Wesley, ISBN: 0-201-06672-6, 1983

The Complexity of Finding Cycles in Periodic Functions.
SIAM J. Comput., 1982

Notes on Merging Networks (Preliminary Version)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Programming Aspects of VLSI.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

ALI: A procedural language to describe VLSI layouts.
Proceedings of the 19th Design Automation Conference, 1982

Lower Bounds for VLSI
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

The Complexity of Finding Periods
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Data Movement in Odd-Even Merging.
SIAM J. Comput., 1978

Implementing Quicksort Programs.
Commun. ACM, 1978

A Dichromatic Framework for Balanced Trees
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

Quicksort with Equal Keys.
SIAM J. Comput., 1977

Corrigenda: "Permutation Generation Methods".
ACM Comput. Surv., 1977

Permutation Generation Methods.
ACM Comput. Surv., 1977

The Analysis of Quicksort Programs.
Acta Inf., 1977

Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York, ISBN: 0-8240-4417-7, 1975

B74-38 Operating Systems Theory.
IEEE Trans. Computers, 1974

Computer graphics for drafting.
Computer Graphics and Image Processing, 1974

SPY: a program to monitor OS/360.
Proceedings of the American Federation of Information Processing Societies: Proceedings of the AFIPS '70 Fall Joint Computer Conference, 1970