Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Carlsson, Svante"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online routing in convex subdivisions
Prosenjit Bose
,
Andrej Brodnik
,
Svante Carlsson
,
Erik D. Demaine
,
Rudolf Fleischer
,
Alejandro López-Ortiz
,
Pat Morin
,
J. Ian Munro
Lecture Notes in Computer Science
1969
, 2000, pp. 47-59
Resizable arrays in optimal time and space
Andrej Brodnik
,
Svante Carlsson
,
Erik D. Demaine
,
J. Ian Munro
,
Robert Sedgewick
Lecture Notes in Computer Science
1663
, 1999, pp. 37-48
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Theoretical Computer Science
164
(1-2), 1996, pp. 1-12
Searching rigid data structures
Svante Carlsson
,
Jingsen Chen
Lecture Notes in Computer Science
959
, 1995, pp. 446-451
Heap construction: Optimal in both worst and average cases?
Svante Carlsson
,
Jingsen Chen
Lecture Notes in Computer Science
1004
, 1995, pp. 254-263
Computing a shortest watchman path in a simple polygon in polynomial-time
Svante Carlsson
,
Håkan Jonsson
Lecture Notes in Computer Science
955
, 1995, pp. 122-134
Linear-time in-place selection in less than
3n
comparisons
Svante Carlsson
,
Mikael Sundström
Lecture Notes in Computer Science
1004
, 1995, pp. 244-253
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Lecture Notes in Computer Science
834
, 1994, pp. 288-296
Some lower bounds for comparison-based algorithms
Svante Carlsson
,
Jingsen Chen
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 106-117
Computing on structures
Serge Abiteboul
,
Victor Vianu
Lecture Notes in Computer Science
700
, 1993, pp. 606-620
Lower bounds for one-way probabilistic communication complexity
Farid Ablayev
Lecture Notes in Computer Science
700
, 1993, pp. 241-252
Dynamic interpolation search in
o(\log\log n)
time
Arne Andersson
,
Christer Mattsson
Lecture Notes in Computer Science
700
, 1993, pp. 15-27
Learnability: Admissible, co-finite and hypersimple languages
Ganesh Baliga
,
John Case
Lecture Notes in Computer Science
700
, 1993, pp. 289-300
Modularity of termination and confluence in combinations of rewrite systems with
\lambda_{\omega}
Franco Barbanera
,
Maribel Fernández
Lecture Notes in Computer Science
700
, 1993, pp. 657-668
Program result checking: A new approach to making programs more reliable
Manuel Blum
Lecture Notes in Computer Science
700
, 1993, pp. 1-14
Treewidth and pathwidth of permutation graphs
Hans Bodlaender
,
Ton Kloks
,
Dieter Kratsch
Lecture Notes in Computer Science
700
, 1993, pp. 114-125
From domains to automata with concurrency
Felipe Bracho
,
Manfred Droste
Lecture Notes in Computer Science
700
, 1993, pp. 669-681
Temporal logic and categories of Petri nets
Carolyn Brown
,
Doug Gurr
Lecture Notes in Computer Science
700
, 1993, pp. 570-581
Finding the shortest watchman route in a simple polygon
Svante Carlsson
,
Håkan Jonsson
,
Bengt J. Nilsson
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 58-67
Sublinear merging and natural mergesort
Svante Carlsson
,
Christos Levcopoulos
,
Ola Petersson
Algorithmica
9
, 1993, pp. 629-648
Sparse networks supporting efficient reliable broadcasting
Bogdan S. Chlebus
,
Krzysztof Diks
,
Andrzej Pelc
Lecture Notes in Computer Science
700
, 1993, pp. 388-397
Efficient analysis of concurrent constraint logic programs
Michael Codish
,
Moreno Falaschi
,
Kim Marriott
,
William Winsborough
Lecture Notes in Computer Science
700
, 1993, pp. 633-644
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Lecture Notes in Computer Science
700
, 1993, pp. 469-477
A partial solution for
D
-unification based on a reduction to
AC1
-unification
Evelyne Contejean
Lecture Notes in Computer Science
700
, 1993, pp. 621-632
Problems on pairs of trees and the four colour problem of planar graphs
Artur Czumaj
,
Alan Gibbons
Lecture Notes in Computer Science
700
, 1993, pp. 88-101
Seiten 1
2
3
4
>