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: Series=Leibniz International Proceedings in Informatics (LIPIcs) AND Volume=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Forms of determinism for automata
Thomas Colcombet
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 1-23
Iterative methods in combinatorial optimization
R. Ravi
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 24-24
On randomness in hash functions
Martin Dietzfelbinger
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 25-28
Pseudo-deterministic algorithms
Shafi Goldwasser
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 29-29
\frac{13}{9}
-approximation for graphic TSP
Marcin Mucha
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 30-41
A
(k+3)/2
-approximation algorithm for monotone submodular
k
-set packing and general
k
-exchange systems
Justin Ward
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 42-53
A pumping lemma for pushdown graphs of any level
Paweƚ Parys
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 54-65
Algorithmic meta theorems for circuit classes of constant and logarithmic depth
Michael Elberfeld
,
Andreas Jakoby
,
Till Tantau
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 66-77
An approximation algorithm for \#
k
-SAT
Marc Thurley
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 78-87
Asymptotic enumeration of minimal automata
Frédérique Bassino
,
Julien David
,
Andrea Sportiello
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 88-99
Balanced partitions of trees and applications
Andreas Emil Feldmann
,
Luca Foschini
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 100-111
Cache-oblivious implicit predecessor dictionaries with the working-set property
Gerth Stlting Brodal
,
Casper Kejlberg-Rasmussen
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 112-123
Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified
Kai-Min Chung
,
Henry Lam
,
Zhenming Liu
,
Michael Mitzenmacher
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 124-135
Compressed membership for NFA (DFA) with compressed labels is in NP (P)
Artur Jeż
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 136-147
Concurrency makes simple theories hard
Stefan Göller
,
Anthony Widjaja Lin
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 148-159
Conflict-free chromatic art gallery coverage
Andreas Bärtschi
,
Subhash Suri
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 160-171
Constant compression and random weights
Wolfgang Merkle
,
Jason Teutsch
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 172-181
Contraction checking in graphs on surfaces
Marcin Kamiński
,
Dimitrios M. Thilikos
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 182-193
Distribution of the number of accessible states in a random deterministic automaton
Arnaud Carayol
,
Cyril Nicaud
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 194-205
Edge-disjoint odd cycles in 4-edge-connected graphs
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 206-217
Efficient algorithms for highly compressed data: The word problem in Higman's group is in P
Volker Diekert
,
Jürn Laun
,
Alexander Ushakov
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 218-229
Efficiently decodable compressed sensing by list-recoverable codes and recursion
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 230-241
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
Antoine Durand-Gasselin
,
Peter Habermehl
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 242-253
Improved bounds for bipartite matching on surfaces
Samir Datta
,
Arjun Gopalan
,
Raghav Kulkarni
,
Raghunath Tewari
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 254-265
Improved spectral sparsification and numerical algorithms for SDD matrices
Ioannis Koutis
,
Alex Levin
,
Richard Peng
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 266-277
Seiten 1
2
3
>