Aarhus University logo
Find
For students
For PhDs
For employees
Local study portal
Computer Science
IT Product Development
Local PhD portal
Application Guide
Computer Science
Pages for all PhD students
phd.au.dk
Local staff information
Department of Computer Science
Pages for staff members at AU
medarbejdere.au.dk/en/
Department of
Computer Science
About Us
Strategy
Anniversary
Organisation
Honorary doctor and professors
Vacancies
Code of Conduct
Research
Algorithms, Data Structures and Foundations of Machine Learning
Collaboration and Computer-Human Interaction
Computational Complexity and Game Theory
Data-Intensive Systems
Cryptography and Security
Logic and Semantics
Programming Languages
Ubiquitous Computing and Interaction
Bioinformatics
Use, Design and Innovation
Modelling and Validation of Distributed Systems
Centers
Publications
PhD Studies
Education
Studievalg
Bachelor
Master
PhD
Continuing education
Study environment
ALICE
CS Alumni
Mød vores kandidater
Graduation at Department of Computer Science
ChomskyLab
Collaboration
Research Collaboration
Student Collaboration
CS Business Club
Business Committee
News & Events
News
Events
CS Colloquium
Camps and Competitions
Contact
Management and Heads of Research
Researchers
All employees
For the press
Gymnasiesamarbejde
Department of Computer Science
Research
Algorithms, Data Structures and Foundations of Machine Learning
Publications
Research
Algorithms, Data Structures and Foundations of Machine Learning
People
Projects
Publications
Collaboration and Computer-Human Interaction
Computational Complexity and Game Theory
Data-Intensive Systems
Cryptography and Security
Logic and Semantics
Programming Languages
Ubiquitous Computing and Interaction
Bioinformatics
Use, Design and Innovation
Modelling and Validation of Distributed Systems
Centers
Publications
PhD Studies
Publications
Sort by
: Date
Sort by
Author
Date
Title
Type
Type and 1st author
Year
Year and 1st author
Year, type and 1st author
Sort in
Ascending order
Descending order
Brodal, G. S.
, Träff, J. L. & Zaroliagis, C. D. (1998).
A Parallel Priority Queue with Constant Time Operations
.
Journal of Parallel and Distributed Computing
,
49
(1), 4-21.
https://doi.org/10.1006/jpdc.1998.1425
Brodal, G. S.
& Pinotti, M. C. (1998).
Comparator networks for binary heap construction
. In S. Arnborg & L. Ivansson (Eds.),
Algorithm Theory — SWAT'98: 6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings
(pp. 158-168). Springer.
https://doi.org/10.1007/BFb0054364
Brodal, G. S.
(1998).
Finger search trees with constant insertion time
. In
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
(pp. 540-549). Society for Industrial and Applied Mathematics.
Brodal, G. S.
& Katajainen, J. (1998).
Worst-case efficient external-memory priority queues
. In S. Arnborg & L. Ivansson (Eds.),
Algorithm Theory — SWAT'98: 6th Scandinavian Workshop on Algorithm Theory Stockholm, Sweden, July 8–10, 1998 Proceedings
(pp. 107-118). Springer.
https://doi.org/10.1007/BFb0054359
Brodal, G. S.
(1997).
Predecessor queries in dynamic integer sets
. In R. Reischuk & M. Morwan (Eds.),
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings
(pp. 21-32). Springer.
https://doi.org/10.1007/BFb0023445
Brodal, G. S.
(1997).
Worst Case Efficient Data Structures
. Department of Computer Science, Aarhus University. BRICS-DS No. 97-1
http://www.brics.dk/DS/97/1/BRICS-DS-97-1.pdf
Brodal, G. S.
& Husfeldt, T. (1996).
A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth
. Department of Computer Science, Aarhus University. BRICS-RS No. 96-1
http://www.brics.dk/RS/96/1/BRICS-RS-96-1.pdf
Brodal, G. S.
& Gasieniec, L. (1996).
Approximate dictionary queries
. In D. Hirschberg & G. Myers (Eds.),
Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings
(pp. 65-74). Springer.
https://doi.org/10.1007/3-540-61258-0_6
Brodal, G. S.
& Okasaki, C. (1996).
Optimal purely functional priority queues
.
Journal of Functional Programming
,
6
(6), 839-858.
https://doi.org/10.1017/S095679680000201X
Brodal, G. S.
(1996).
Partially persistent data structures of bounded degree with constant update time
.
Nordic Journal of Computing
,
3
(3), 238-255.
Brodal, G. S.
& Skyum, S.
(1996).
The Complexity of Computing the -ary Composition of a Binary Associative Operator
. Department of Computer Science, Aarhus University. BRICS-RS No. 96-42
http://www.brics.dk/RS/96/42/BRICS-RS-96-42.pdf
Brodal, G. S.
, Chaudhuri, S. & Radhakrishnan, J. (1996).
The randomized complexity of maintaining the minimum
.
Nordic Journal of Computing
,
3
(4), 337-351.
Brodal, G. S.
(1996).
Worst-case efficient priority queues
. In
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
(pp. 52-58). Society for Industrial and Applied Mathematics.
Brodal, G. S.
(1995).
Fast meldable priority queues
. In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.),
Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16–18, 1995 Proceedings
(pp. 282-290). Springer.
https://doi.org/10.1007/3-540-60220-8_70
Displaying results
351 to 364
out of
364
Previous
1
2
3
4
5
6
7
8
Head of research
Kasper Green
Larsen
Professor
M
larsen@cs.au.dk
Faculty
Peyman
Afshani
Associate Professor
M
peyman@cs.au.dk
H
3553, 323
P
+4587156202
Gerth Stølting
Brodal
Professor
M
gerth@cs.au.dk
H
5335, 321
P
+4550595432
P
+4550595432
Chris
Schwiegelshohn
Associate Professor
M
schwiegelshohn@cs.au.dk
Revised 04.10.2023