David P. Dobkin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with J. Ian Munro

> Home > Persons > David P. Dobkin

Publications

1985
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/jal/DobkinM85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/DobkinM85
David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. J. Algorithms 6(4): 455-465 (1985)
1981
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/DobkinM81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/DobkinM81
David P. Dobkin, J. Ian Munro:
Optimal Time Minimal Space Selection Algorithms. J. ACM 28(3): 454-461 (1981)
1980
[j13]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DobkinM80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DobkinM80
David P. Dobkin, J. Ian Munro:
Determining the Mode. Theor. Comput. Sci. 12: 255-263 (1980)
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/DobkinM80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/DobkinM80
David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. FOCS 1980: 200-206
1978
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/DobkinM78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/DobkinM78
David P. Dobkin, J. Ian Munro:
Time and Space Bounds for Selection Problems. ICALP 1978: 192-204

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.