Filter
Conference contribution

Search results

  • 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

    1 Scopus citations
  • SHORTEST PATHS IN EUCLIDEAN GRAPHS.

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

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

    4 Scopus citations
  • Space search inc for intersecting objects

    Dobkin, D. P. & Edelsbrunner, H., 1984, 25th Annual Symposium on Foundations of Computer Science, FOCS 1984. IEEE Computer Society, p. 387-392 6 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1984-October).

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

  • SPACE SEARCHING FOR INTERSECTING OBJECTS.

    Dobkin, D. P. & Edelsbrunner, H., 1984, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 387-392 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    9 Scopus citations
  • 1983

    FILTERING SEARCH: A NEW APPROACH TO QUERY-ANSWERING.

    Chazelle, B., 1983, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 122-132 11 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    37 Scopus citations
  • 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

    Open Access
    2 Scopus citations
  • LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION.

    Gabow, H. N. & Tarjan, R. E., 1983, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508830), p. 246-251 6 p. (Conference Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    133 Scopus citations
  • ON MINIMIZING CHANNEL DENSITY BY LATERAL SHIFTING.

    LaPaugh, A. S. & Pinter, R. Y., 1983, Unknown Host Publication Title. IEEE, p. 121-122 2 p.

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

    8 Scopus citations
  • PLACEMENT PROCEDURE FOR POLYCELL VLSI CIRCUITS.

    Dunlop, A. E. & Kernighan, B. W., 1983, Unknown Host Publication Title. IEEE, p. 51-52 2 p.

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

    2 Scopus citations
  • POWER OF GEOMETRIC DUALITY.

    Chazelle, B., Guibas, L. J. & Lee, D. T., 1983, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 217-225 9 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

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

    45 Scopus citations
  • SCHEDULING FILE TRANSFERS IN A DISTRIBUTED NETWORK.

    Coffman, E. G., Garey, M. R., Johnson, D. S. & LaPaugh, A. S., 1983, Unknown Host Publication Title. ACM, p. 254-266 13 p.

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

    Open Access
    19 Scopus citations
  • SELF-ADJUSTING BINARY TREES.

    Sleator, D. D. & Tarjan, R. E., 1983, Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508830), p. 235-245 11 p. (Conference Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
    57 Scopus citations
  • TOTAL FAULT TESTING USING THE BIPARTITE TRANSFORMATION.

    LaPaugh, A. S. & Lipton, R. J., 1983, Digest of Papers - International Test Conference. IEEE, p. 428-434 7 p. (Digest of Papers - International Test Conference).

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

  • TOTAL STUCK-AT-FAULT TESTING BY CIRCUIT TRANSFORMATION.

    LaPaugh, A. S. & Lipton, R. J., 1983, Proceedings - Design Automation Conference. IEEE, USA. Available form IEEE Service Cent, p. 713-716 4 p. (Proceedings - Design Automation Conference).

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

  • 1982

    Distributed allocation with pools of servers

    Andrews, G. R., Dobkin, D. P. & Downey, P. J., Aug 18 1982, Proceedings of the 1st ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 1982. Association for Computing Machinery, p. 73-83 11 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    3 Scopus citations
  • DISTRIBUTED ALLOCATION WITH POOLS OF SERVERS.

    Andrews, G. R., Dobkin, D. P. & Downey, P. J., 1982, Unknown Host Publication Title. ACM, p. 73-83 11 p.

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

    17 Scopus citations
  • Fast detection of polyhedral intersections

    Dobkin, D. P. & Kirkpatrick, D. G., 1982, Automata, Languages and Programming - 9th Colloquium. Nielsen, M. & Schmidt, E. M. (eds.). Springer Verlag, p. 154-165 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 140 LNCS).

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

    24 Scopus citations
  • Finding extremal polygons

    Boyce, J. E., Dobkin, D. P., Drysdale, R. L. & Guibas, L. J., May 5 1982, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, p. 282-289 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    Open Access
    21 Scopus citations
  • 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

    Open Access
    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
  • 1981

    Active data structures

    Andrews, G. R. & Dobkin, D. P., Mar 9 1981, Proceedings of the 5th International Conference on Software Engineering, ICSE 1981. IEEE Computer Society, p. 354-362 9 p. (Proceedings - International Conference on Software Engineering).

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

    3 Scopus citations
  • 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

    94 Scopus citations
  • 1980

    Detection is easier than computation

    Chazelle, B. & Dobkin, D. P., Apr 28 1980, Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC 1980. Association for Computing Machinery, p. 146-153 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 1980-April).

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

    43 Scopus citations
  • 1978

    Time and space bounds for selection problems

    Dobkin, D. & Munro, J. I., 1978, Automata, Languages and Programming - 5th Colloquium. Bohm, C. & Ausiello, G. (eds.). Springer Verlag, p. 192-204 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 62 LNCS).

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

    2 Scopus citations
  • 1976

    A lower bound of 1/2n2 on linear search programs for the knapsack problem

    Dobkin, D. & Lipton, R. J., 1976, Mathematical Foundations of Computer Science 1976 - Proceedings, 5th Symposium. Mazurkiewicz, A. (ed.). Springer Verlag, p. 265-269 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 45 LNCS).

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

    2 Scopus citations
  • 1975

    On the complexity of computations under varying sets of primitives

    Dobkin, D. P. & Lipton, R. J., 1975, Automata Theory and Formal Languages - 2nd GI Conference. Brakhag, H. (ed.). Springer Verlag, p. 110-117 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 33 LNCS).

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

    Open Access
    14 Scopus citations