BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Sweden
2 × USA
Collaborated with:
J.Håstad O.Petersson M.Thorup T.Hagerup C.Mattsson S.Nilsson R.Raman
Talks about:
search (4) sort (3) tight (2) dynam (2) bound (2) array (2) time (2) log (2) prioriti (1) interpol (1)

Person: Arne Andersson

DBLP DBLP: Andersson:Arne

Contributed to:

STOC 20002000
STOC 19951995
STOC 19941994
ICALP 19931993

Wrote 5 papers:

STOC-2000-AnderssonT #bound #worst-case
Tight(er) worst-case bounds on dynamic searching and priority queues (AA, MT), pp. 335–342.
STOC-1995-AnderssonHNR #linear #question #sorting
Sorting in linear time? (AA, TH, SN, RR), pp. 427–436.
STOC-1995-AnderssonHP #array #bound
A tight lower bound for searching a sorted array (AA, JH, OP), pp. 417–426.
STOC-1994-AnderssonHHP #array #complexity #string
The complexity of searching a sorted array of strings (AA, TH, JH, OP), pp. 317–325.
ICALP-1993-AnderssonM
Dynamic Interpolation Search in o(log log n) Time (AA, CM), pp. 15–27.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.