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.
FO^2
with one transitive relation is decidable
Wieslaw Szwast
,
Lidia Tendera
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 317-328
Two-variable first order logic with modular predicates over words
Luc Dartois
,
Charles Paperman
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 329-340
Abusing the Tutte matrix: An algebraic instance compression for the
K
-set-cycle problem
Magnus Wahlström
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 341-352
Subexponential-time parameterized algorithm for Steiner tree on planar graphs
Marcin Pilipczuk
,
Michal Pilipczuk
,
Piotr Sankowski
,
Erik Jan van Leeuwen
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 353-364
The arithmetic complexity of tensor contractions
Florent Capelli
,
Arnaud Durand
,
Stefan Mengel
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 365-376
Search versus decision for election manipulation problems
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Curtis Menton
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 377-388
Improved bounds for online preemptive matching
Leah Epstein
,
Asaf Levin
,
Danny Segev
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 389-399
Parameterized matching in the streaming model
Markus Jalsenius
,
Benny Porat
,
Benjamin Sach
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 400-411
Popular matchings: Structure and cheating strategies
Meghana Nasre
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 412-423
Fooling one-sided quantum protocols
Hartmut Klauck
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 424-433
Explicit relation between all lower bound techniques for quantum query complexity
Loïck Magnin
,
Jérémie Roland
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 434-445
Optimal quantum query bounds for almost all Boolean functions
Andris Ambainis
,
Arturs Backurs
,
Juris Smotrovs
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 446-453
Streaming complexity of checking priority queues
Nathanael Francois
,
Frédéric Magniez
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 454-465
Deterministic algorithms for skewed matrix products
Konstantin Kutzkov
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 466-477
The simulated greedy algorithm for several submodular matroid secretary problems
Tengyu Ma
,
Bo Tang
,
Yajun Wang
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 478-489
Hardness of conjugacy, embedding and factorization of multidimensional subshifts of finite type
Emmanuel Jeandel
,
Pascal Vanier
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 490-501
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
Ines Klimann
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 502-513
Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
Amir M. Ben-Amram
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 514-525
On the practically interesting instances of MAXCUT
Yonatan Bilu
,
Amit Daniely
,
Nati Linial
,
Michael Saks
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 526-537
First fit bin packing: A tight analysis
György Dósa
,
Jiri Sgall
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 538-549
Constrained binary identification problem
Amin Karbasi
,
Morteza Zadimoghaddam
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 550-561
Regular languages of thin trees
Mikolaj Bojanczyk
,
Tomasz Idziaszek
,
Michal Skrzypczak
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 562-573
Approximate comparison of distance automata
Thomas Colcombet
,
Laure Daviaud
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 574-585
The rank of tree-automatic linear orderings
Martin Huschenbett
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 586-597
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
Julien Clément
,
Thu Hien Nguyen Thi
,
Brigitte Vallée
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 598-609
Seiten
<
1
2
3
4
5
>