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 YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polar codes: Reliable communication with complexity polynomial in the gap to Shannon capacity
Venkatesan Guruswami
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 1-1
Computing with a fixed number of pointers
Martin Hofmann
,
Ramyaa Ramyaa
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 3-18
On approximation resistance of predicates
Subhash Khot
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 19-19
Characterisations of nowhere dense graphs
Martin Grohe
,
Stephan Kreutzer
,
Sebastian Siebertz
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 21-40
Intersection types for normalization and verification
Kazushige Terui
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 41-42
Polynomial kernels for
\lambda
-extendible properties parameterized above the Poljak-Turzíik bound
Robert Crowston
,
Mark Jones
,
Gabriele Muciaccia
,
Geevarghese Philip
,
Ashutosh Rai
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 43-54
On the parameterised complexity of string morphism problems
Henning Fernau
,
Markus L. Schmid
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 55-66
Partially polynomial kernels for
Set Cover
and
Test Cover
Manu Basavaraju
,
Mathew C. Francis
,
M.S. Ramanujan
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 67-78
Parameterized complexity of the anchored
k
-core problem for directed graphs
Rajesh Chitnis
,
Fedor V. Fomin
,
Petr A. Golovach
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 79-90
Böhm trees as higher-order recursive schemes
Pierre Clairambault
,
Andrzej S. Murawski
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 91-102
Evaluation is MSOL-compatible
Sylvain Salvati
,
Igor Walukiewicz
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 103-114
Model checking and functional program transformations
Axel Haddad
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 115-126
A theory of partitioned global address spaces
Georgel Calin
,
Egor Derevenetc
,
Rupak Majumdar
,
Roland Meyer
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 127-139
A strong direct product theorem for the tribes function via the smooth-rectangle bound
Prahladh Harsha
,
Rahul Jain
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 141-152
Inapproximability of rainbow colouring
L. Sunil Chandran
,
Deepak Rajendraprasad
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 153-162
Primal Infon Logic: Derivability in polynomial time
Anguraj Baskar
,
Prasad Naldurg
,
K.R. Raghavendra
,
S.P. Suresh
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 163-174
Composition problems for braids
Igor Potapov
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 175-187
DLOGTIME proof systems
Andreas Krebs
,
Nutan Limaye
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 189-200
On improved degree lower bounds for polynomial approximation
Srikanth Srinivasan
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 201-212
Implementing realistic asynchronous automata
S. Akshay
,
Ionut Dinca
,
Blaise Genest
,
Alin Stefanescu
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 213-224
Computation of summaries using net unfoldings
Javier Esparza
,
Loïg Jezequel
,
Stefan Schwoon
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 225-236
Faster deterministic algorithms for
r
-dimensional matching using representative sets
Prachi Goyal
,
Neeldhara Misra
,
Fahad Panolan
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 237-248
Distributed and parallel algorithms for set cover problems with small neighborhood covers
Archita Agarwal
,
Venkatesan T. Chakaravarthy
,
Anamitra R. Choudhury
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 249-261
Replica placement via capacitated vertex cover
Sonika Arora
,
Venkatesan T. Chakaravarthy
,
Neelima Gupta
,
Koyel Mukherjee
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 263-274
Knapsack cover subject to a matroid constraint
Venkatesan T. Chakaravarthy
,
Anamitra Roy Choudhury
,
Sivaramakrishnan R. Natarajan
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 275-286
Seiten 1
2
3
4
5
>