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
[1]
Hilfe
Suche: Author="Eidenbenz, Stephan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partial Digest is hard to solve for erroneous input data
Mark Cieliebak
,
Stephan Eidenbenz
,
Paolo Penna
Theoretical Computer Science
349
(3), 2005, pp. 361-381
Double digest revisited: Complexity and approximability in the presence of noisy data
Mark Cieliebak
,
Stephan Eidenbenz
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
2697
, 2003, pp. 519-527
Flexible train rostering
Stephan Eidenbenz
,
Aris Pagourtzis
,
Peter Widmayer
Lecture Notes in Computer Science
2906
, 2003, pp. 615-624
An approximation algorithm for minimum convex cover with logarithmic performance guarantee
Stephan J. Eidenbenz
,
Peter Widmayer
SIAM Journal on Computing
32
(3), 2003, pp. 654-670
Quantum and stochastic branching programs of bounded width
Farid Ablayev
,
Cristopher Moore
,
Christopher Pollett
Lecture Notes in Computer Science
2380
, 2002, pp. 343-354
Call control in rings
Udo Adamy
,
Christoph Ambuehl
,
R. Sai Anand
,
Thomas Erlebach
Lecture Notes in Computer Science
2380
, 2002, pp. 788-799
Randomized pursuit-evasion in graphs
Micah Adler
,
Harald Räcke
,
Naveen Sivadasan Christian Sohler
,
Berthold Vöcking
Lecture Notes in Computer Science
2380
, 2002, pp. 901-912
Complete and tractable local linear time temporal logics over traces
Bharat Adsul
,
Milind Sohoni
Lecture Notes in Computer Science
2380
, 2002, pp. 926-937
Fast universalization of investment strategies with provably good relative returns
Karhan Akcoglu
,
Petros Drineas
,
Ming-Yang Kao
Lecture Notes in Computer Science
2380
, 2002, pp. 888-900
Intersection of regular languages and star hierarchy
Sebastian Bala
Lecture Notes in Computer Science
2380
, 2002, pp. 159-169
Comparing functional paradigms for exact real-number computation
Andrej Bauer
,
Martín Hötzel Escardó
,
Alex Simpson
Lecture Notes in Computer Science
2380
, 2002, pp. 488-500
Energy optimal routing in radio networks using geometric data structures
René Beier
,
Peter Sanders
,
Naveen Sivadasan
Lecture Notes in Computer Science
2380
, 2002, pp. 366-376
Exponential structures for efficient cache-oblivious algorithms
Michael A. Bender
,
Richard Cole
,
Rajeev Raman
Lecture Notes in Computer Science
2380
, 2002, pp. 195-207
Approximating Huffman codes in parallel
Piotr Berman
,
Marek Karpinski
,
Yakov Nekrich
Lecture Notes in Computer Science
2380
, 2002, pp. 845-855
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION
Piotr Berman
,
Marek Karpinski
Lecture Notes in Computer Science
2380
, 2002, pp. 623-632
Navigating with a browser
Michaƚ Bielecki
,
Jan Hidders
,
Jan Paredaens
,
Jerzy Tyszkiewicz
,
Jan Van den Bussche
Lecture Notes in Computer Science
2380
, 2002, pp. 764-775
Finding a path of superlogarithmic length
Andreas Björklund
,
Thore Husfeldt
Lecture Notes in Computer Science
2380
, 2002, pp. 985-992
Two-way alternating automata and finite models
Mikoƚaj Bojanćzyk
Lecture Notes in Computer Science
2380
, 2002, pp. 833-844
Wagner's theorem on realizers
Nicolas Bonichon
,
Bertrand Le Saëc
,
Mohamed Mosbah
Lecture Notes in Computer Science
2380
, 2002, pp. 1043-1053
Random numbers and an incomplete immune recursive set
Vasco Brattka
Lecture Notes in Computer Science
2380
, 2002, pp. 950-961
Cache oblivious distribution sweeping
Gerth Stlting Brodal
,
Rolf Fagerberg
Lecture Notes in Computer Science
2380
, 2002, pp. 426-438
Solving the string statistics problem in time
O(n \log n)
Gerth Stlting Brodal
,
Rune B. Lyngs
,
Anna Östlin
,
Christian N.S. Pedersen
Lecture Notes in Computer Science
2380
, 2002, pp. 728-739
Symbolic strategy synthesis for games on pushdown graphs
Thierry Cachat
Lecture Notes in Computer Science
2380
, 2002, pp. 704-715
A spatial logic for querying graphs
Luca Cardelli
,
Philippa Gardner
,
Giorgio Ghelli
Lecture Notes in Computer Science
2380
, 2002, pp. 597-610
Finding frequent items in data streams
Moses Charikar
,
Kevin Chen
,
Martin Farach-Colton
Lecture Notes in Computer Science
2380
, 2002, pp. 693-703
Seiten 1
2
3
4
5
6
>