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="Sgall, Ji{\v{r}}{\'{i}}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal analysis of best fit bin packing
György Dósa
,
Jiȓí Sgall
Lecture Notes in Computer Science
8572
, 2014, pp. 429-441
Graph balancing: A special case of scheduling unrelated parallel machines
Tomás̑ Ebenlendr
,
Marek Krc̑ál
,
Jiȓí Sgall
Algorithmica
68
(1), 2014, pp. 62-80
Online control message aggregation in chain networks
Marcin Bienkowski
,
Jaroslaw Byrka
,
Marek Chrobak
,
Łukasz Jeż
,
Jiȓí Sgall
,
Grzegorz Stachowiak
Lecture Notes in Computer Science
8037
, 2013, pp. 133-145
Better bounds for incremental frequency allocation in bipartite graphs
Marek Chrobak
,
Łukasz Jeż
,
Jiȓí Sgall
Theoretical Computer Science
514
, 2013, pp. 75-83
Open problems in throughput scheduling
Jiȓí Sgall
Lecture Notes in Computer Science
7501
, 2012, pp. 2-11
Advice coins for classical and quantum computation
Scott Aaronson
,
Andrew Drucker
Lecture Notes in Computer Science
6755
, 2011, pp. 61-72
VC-dimension and shortest path algorithms
Ittai Abraham
,
Daniel Delling
,
Amos Fiat
,
Andrew V. Goldberg
,
Renato F. Werneck
Lecture Notes in Computer Science
6755
, 2011, pp. 690-699
Approximation schemes for capacitated geometric network design
Anna Adamaszek
,
Artur Czumaj
,
Andrzej Lingas
,
Jakub Onufry Wojtaszczyk
Lecture Notes in Computer Science
6755
, 2011, pp. 25-36
Tight bounds for linkages in planar graphs
Isolde Adler
,
Stavros G. Kolliopoulos
,
Philipp Klaus Krause
,
Daniel Lokshtanov
,
Saket Saurabh
,
Dimitrios Thilikkos
Lecture Notes in Computer Science
6755
, 2011, pp. 110-121
Linear programming in the semi-streaming model with application to the maximum matching problem
Kook Jin Ahn
,
Sudipto Guha
Lecture Notes in Computer Science
6756
, 2011, pp. 526-538
Limits on the computational power of random strings
Eric Allender
,
Luke Friedman
,
William Gasarch
Lecture Notes in Computer Science
6755
, 2011, pp. 293-304
On the power of algebraic branching programs of width two
Eric Allender
,
Fengming Wang
Lecture Notes in Computer Science
6755
, 2011, pp. 736-747
Nondeterministic streaming string transducers
Rajeev Alur
,
Jyotirmoy V. Deshmukh
Lecture Notes in Computer Science
6756
, 2011, pp. 1-20
On the relation between differential privacy and quantitative information flow
Mário S. Alvim
,
Miguel E. Andrés
,
Konstantinos Chatzikokolakis
,
Catuscia Palamidessi
Lecture Notes in Computer Science
6756
, 2011, pp. 60-76
Meeting deadlines: How much speed suffices?
S. Anand
,
Naveen Garg
,
Nicole Megow
Lecture Notes in Computer Science
6755
, 2011, pp. 232-243
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
Matthew Anderson
,
Dieter van Melkebeek
,
Nicole Schweikardt
,
Luc Segoufin
Lecture Notes in Computer Science
6756
, 2011, pp. 368-379
New algorithms for learning in presence of errors
Sanjeev Arora
,
Rong Ge
Lecture Notes in Computer Science
6755
, 2011, pp. 403-415
A simple deterministic reduction for the gap minimum distance of code problem
Per Austrin
,
Subhash Khot
Lecture Notes in Computer Science
6755
, 2011, pp. 474-485
Guarded negation
Vince Bárány
,
Balder ten Cate
,
Luc Segoufin
Lecture Notes in Computer Science
6756
, 2011, pp. 356-367
Algebraic independence and blackbox identity testing
Malte Beecken
,
Johannes Mittmann
,
Nitin Saxena
Lecture Notes in Computer Science
6756
, 2011, pp. 137-148
The cost of traveling between languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Lecture Notes in Computer Science
6756
, 2011, pp. 234-245
Steiner transitive-closure spanners of low-dimensional posets
Piotr Berman
,
Arnab Bhattacharyya
,
Elena Grigorescu
,
Sofya Raskhodnikova
,
David P. Woodruff
,
Grigory Yaroslavtsev
Lecture Notes in Computer Science
6755
, 2011, pp. 760-772
Improved approximation for the directed spanner problem
Piotr Berman
,
Arnab Bhattacharyya
,
Konstantin Makarychev
,
Sofya Raskhodnikova
,
Grigory Yaroslavtsev
Lecture Notes in Computer Science
6755
, 2011, pp. 1-12
Emptiness and universality problems in timed automata with positive frequency
Nathalie Bertrand
,
Patricia Bouyer
,
Thomas Brihaye
,
Amélie Stainer
Lecture Notes in Computer Science
6756
, 2011, pp. 246-257
Parameterized bounded-depth Frege is not optimal
Olaf Beyersdorff
,
Nicola Galesi
,
Massimo Lauria
,
Alexander Razborov
Lecture Notes in Computer Science
6755
, 2011, pp. 630-641
Seiten 1
2
3
4
5
6
7
8
9
>