Torben Hagerup

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 Arne Andersson

> Home > Persons > Torben Hagerup

Publications

2000
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/AnderssonHHP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/AnderssonHHP00
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. 30(5): 1552-1578 (2000)
1998
[j30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/AnderssonHNR98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AnderssonHNR98
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998)
1995
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/AnderssonHNR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AnderssonHNR95
Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in linear time? STOC 1995: 427-436
1994
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/AnderssonHHP94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AnderssonHHP94
Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
The complexity of searching a sorted array of strings. STOC 1994: 317-325

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.