Robert Sedgewick

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
1977 …2016

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 1981

    Lower bounds for VLSI

    Lipton, R. J. & Sedgewick, R., May 11 1981, Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981. Association for Computing Machinery, p. 300-307 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    88 Scopus citations
  • 1982

    Notes on merging networks

    Hong, Z. & Sedgewick, R., May 5 1982, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, p. 296-302 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Programming aspects of VLSI

    Lipton, R. J., Sedgewick, R. & Valdes, J., Jan 25 1982, Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1982. Association for Computing Machinery, p. 57-65 9 p. (Conference Record of the Annual ACM Symposium on Principles of Programming Languages).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • 1983

    IMPROVED UPPER BOUNDS ON SHELLSORT.

    Incerpi, J. & Sedgewick, R., 1983, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 48-55 8 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 1984

    Shortest paths in euclidean graphs

    Sedgewick, R. & Vitter, J. S., 1984, 25th Annual Symposium on Foundations of Computer Science, FOCS 1984. IEEE Computer Society, p. 417-424 8 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1984-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • SHORTEST PATHS IN EUCLIDEAN GRAPHS.

    Sedgewick, R. & Vitter, J. S., Dec 1 1984, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 417-424 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 1988

    Analysis of a simple yet efficient convex hull algorithm

    Golin, M. & Sedgewick, R., Jan 6 1988, Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, p. 153-163 11 p. (Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Tight lower bounds for Shellsort

    Weiss, M. A. & Sedgewick, R., Jan 1 1988, SWAT 88 - 1st Scandinavian Workshop on Algorithm Theory, Proceedings. Karlsson, R. & Lingas, A. (eds.). Springer Verlag, p. 255-262 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 318 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1992

    Deterministic skip lists

    Munrot, J. I., Papadakis, T. & Sedgewick, R., Sep 1 1992, Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992. Association for Computing Machinery, p. 367-375 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129721).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    58 Scopus citations
  • 1993

    Towards uncheatable benchmarks

    Cai, J. Y., Lipton, R. J., Sedgewick, R. & Yao, A. C. C., 1993, Proceedings of the Eighth Annual Structure in Complexity Theory Conference. Anon (ed.). Publ by IEEE, p. 2-11 10 p. (Proceedings of the Eighth Annual Structure in Complexity Theory Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    28 Scopus citations
  • 1996

    Analysis of shellsort and related algorithms

    Sedgewick, R., 1996, Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings. Diaz, J. & Serna, M. (eds.). Springer Verlag, p. 1-11 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1136).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    24 Scopus citations
  • 1999

    Resizable arrays in optimal time and space

    Brodnik, A., Carlsson, S., Demaine, E. D., Munro, J. I. & Sedgewick, R., 1999, Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Dehne, F., Sack, J-R., Gupta, A. & Tamassia, R. (eds.). Springer Verlag, p. 37-48 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1663).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    35 Scopus citations