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=LNCS AND Volume=8087
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polychromatic Ramsey theory for ordinals
Martin Huschenbett
,
Jiamou Liu
Lecture Notes in Computer Science
8087
, 2013, pp. 559-570
Detecting regularities on grammar-compressed strings
Tomohiro I
,
Wataru Matsubara
,
Kouji Shimohira
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
,
Kazuyuki Narisawa
,
Ayumi Shinohara
Lecture Notes in Computer Science
8087
, 2013, pp. 571-582
Small depth proof systems
Andreas Krebs
,
Nutan Limaye
,
Meena Mahajan
,
Karteek Sreenivasaiah
Lecture Notes in Computer Science
8087
, 2013, pp. 583-594
Reversibility of computations in graph-walking automata
Michal Kunc
,
Alexander Okhotin
Lecture Notes in Computer Science
8087
, 2013, pp. 595-606
Prime languages
Orna Kupferman
,
Jonathan Mosheiff
Lecture Notes in Computer Science
8087
, 2013, pp. 607-618
Logical aspects of the lexicographic order on 1-counter languages
Dietrich Kuske
Lecture Notes in Computer Science
8087
, 2013, pp. 619-630
Helly circular-arc graph isomorphism is in logspace
Johannes Köbler
,
Sebastian Kuhnert
,
Oleg Verbitsky
Lecture Notes in Computer Science
8087
, 2013, pp. 631-642
Zeno, Hercules and the Hydra: Downward rational termination is Ackermannian
Ranko Lazić
,
Joël Ouaknine
,
James Worrell
Lecture Notes in Computer Science
8087
, 2013, pp. 643-654
Strong completeness for Markovian logics
Dexter Kozen
,
Radu Mardare
,
Prakash Panangaden
Lecture Notes in Computer Science
8087
, 2013, pp. 655-666
Arithmetic branching programs with memory
Stefan Mengel
Lecture Notes in Computer Science
8087
, 2013, pp. 667-678
Subexponential algorithm for
d
-cluster edge deletion: Exception or rule?
Neeldhara Misra
,
Fahad Panolan
,
Saket Saurabh
Lecture Notes in Computer Science
8087
, 2013, pp. 679-690
Unlimited decidability of distributed synthesis with limited missing knowledge
Anca Muscholl
,
Sven Schewe
Lecture Notes in Computer Science
8087
, 2013, pp. 691-703
Revisiting space in proof complexity: Treewidth and pathwidth
Moritz Müller
,
Stefan Szeider
Lecture Notes in Computer Science
8087
, 2013, pp. 704-716
Space-efficient parallel algorithms for combinatorial search problems
Andrea Pietracaprina
,
Geppino Pucci
,
Francesco Silvestri
,
Fabio Vandin
Lecture Notes in Computer Science
8087
, 2013, pp. 717-728
Separating regular languages by piecewise testable and unambiguous languages
Thomas Place
,
Lorijn van Rooijen
,
Marc Zeitoun
Lecture Notes in Computer Science
8087
, 2013, pp. 729-740
An unusual temporal logic
Alexander Rabinovich
Lecture Notes in Computer Science
8087
, 2013, pp. 741-752
A more efficient simulation algorithm on Kripke structures
Francesco Ranzato
Lecture Notes in Computer Science
8087
, 2013, pp. 753-764
A planarity test via construction sequences
Jens M. Schmidt
Lecture Notes in Computer Science
8087
, 2013, pp. 765-776
Feasible combinatorial matrix theory
Ariel Germán Fernández
,
Michael Soltys
Lecture Notes in Computer Science
8087
, 2013, pp. 777-788
Approximation algorithms for generalized plant location
Alexander Souza
Lecture Notes in Computer Science
8087
, 2013, pp. 789-800
Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates
Yasuhiro Takahashi
,
Takeshi Yamazaki
,
Kazuyuki Tanaka
Lecture Notes in Computer Science
8087
, 2013, pp. 801-812
Improved bounds for reduction to depth 4 and depth 3
Sébastien Tavenas
Lecture Notes in Computer Science
8087
, 2013, pp. 813-824
Parameterized algorithms for module motif
Meirav Zehavi
Lecture Notes in Computer Science
8087
, 2013, pp. 825-836
On the quantifier-free dynamic complexity of reachability
Thomas Zeume
,
Thomas Schwentick
Lecture Notes in Computer Science
8087
, 2013, pp. 837-848
Seiten
<
1
2
3