Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(3)
Rolf Klein
1
Thomas Ottmann
1
Christian Icking
1
Journals
(1)
ACTA
1
Keywords
(2)
Embed
Subscribe
Academic
Authors
Arne Andersson I
Arne Andersson I,Algorithms & Theory
Edit
Arne Andersson I
Publications:
1
|
Citations:
18
Fields:
Algorithms & Theory
View FAQ about top research areas and Fields of study
Collaborated with
3 co-authors
in 1990
|
Cited by
10 authors
Cumulative
Annual
Sort by:
Publications
(1)
BibTeX
|
RIS
|
RefWorks
Download
Binary Search Trees of Almost Optimal Height
(
Citations: 18
)
Arne Andersson I
,
Christian Icking
,
Rolf Klein
,
Thomas Ottmann
Journal:
Acta Informatica - ACTA
, vol. 28, no. 2, pp. 165-178, 1990
Sort by:
Citations
(18 times by 18 publications)
Combinatorial Auctions, an Example of Algorithm Theory in Real Life
Arne Andersson
Conference:
Birthday ...
, pp. 13-21, 2003
General Balanced Trees
(
Citations: 28
)
Arne Andersson
Journal:
Journal of Algorithms - JAL
, vol. 30, no. 1, pp. 1-18, 1999
Optimal Binary Search Trees
(
Citations: 8
)
S. V. Nagaraj
Journal:
Theoretical Computer Science - TCS
, vol. 188, no. 1-2, pp. 1-44, 1997
Binary Search Trees: How Low Can You Go?
(
Citations: 5
)
Rolf Fagerberg
Conference:
Scandinavian Workshop on Algorithm Theory - SWAT
, pp. 428-439, 1996
Confluently Persistent Deques via Data-Structural Bootstrapping
(
Citations: 23
)
Adam L. Buchsbaum
,
Robert Endre Tarjan
Journal:
Journal of Algorithms - JAL
, vol. 18, no. 3, pp. 513-547, 1995
Comments