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
[2]
Hilfe
Suche: Author="Dietzfelbinger, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Martin Aumüller
,
Martin Dietzfelbinger
,
Philipp Woelfel
Algorithmica
70
(3), 2014, pp. 428-456
Sofic-Dyck shifts
Marie-Pierre Béal
,
Michel Blockelet
,
Cȃtȃlin Dima
Lecture Notes in Computer Science
8634
, 2014, pp. 63-74
A logical characterization of timed (non-)regular languages
Marcello M. Bersani
,
Matteo Rossi
,
Pierluigi San Pietro
Lecture Notes in Computer Science
8634
, 2014, pp. 75-86
Asymptotic monadic second-order logic
Achim Blumensath
,
Olivier Carton
,
Thomas Colcombet
Lecture Notes in Computer Science
8634
, 2014, pp. 87-98
Towards efficient reasoning under guarded-based disjunctive existential rules
Pierre Bourhis
,
Michael Morak
,
Andreas Pieris
Lecture Notes in Computer Science
8634
, 2014, pp. 99-110
Alternating parity Krivine automata
Florian Bruse
Lecture Notes in Computer Science
8634
, 2014, pp. 111-122
Advances in parametric real-time reasoning
Daniel Bundala
,
Joël Ouaknine
Lecture Notes in Computer Science
8634
, 2014, pp. 123-134
Universal Lyndon words
Arturo Carpi
,
Gabriele Fici
,
S̑tȇpán Holub
,
Jakub Oprs̑al
,
Marinella Sciortino
Lecture Notes in Computer Science
8634
, 2014, pp. 135-146
Cyclic complexity of words
Julien Cassaigne
,
Gabriele Fici
,
Marinella Sciortino
,
Luca Q. Zamboni
Lecture Notes in Computer Science
8634
, 2014, pp. 159-170
Subword complexity and decomposition of the set of factors
Julien Cassaigne
,
Anna E. Frid
,
Svetlana Puzynina
,
Luca Q. Zamboni
Lecture Notes in Computer Science
8634
, 2014, pp. 147-158
Partial-observation stochastic reachability and parity games
Krishnendu Chatterjee
Lecture Notes in Computer Science
8634
, 2014, pp. 1-4
Classifying recognizable infinitary trace languages using word automata
Namit Chaturvedi
,
Marcus Gelderie
Lecture Notes in Computer Science
8634
, 2014, pp. 171-182
Bounded variable logic, parameterized logarithmic space, and Savitch's theorem
Yijia Chen
,
Moritz Müller
Lecture Notes in Computer Science
8634
, 2014, pp. 183-195
An algebraic characterization of unary two-way transducers
Christian Choffrut
,
Bruno Guillon
Lecture Notes in Computer Science
8634
, 2014, pp. 196-207
Size-change abstraction and max-plus automata
Thomas Colcombet
,
Laure Daviaud
,
Florian Zuleger
Lecture Notes in Computer Science
8634
, 2014, pp. 208-219
Information rate of some classes of non-regular languages: An automata-theoretic approach
Cewei Cui
,
Zhe Dang
,
Thomas R. Fischer
,
Oscar H. Ibarra
Lecture Notes in Computer Science
8634
, 2014, pp. 232-243
Relating nominal and higher-order rewriting
Jesús Domínguez
,
Maribel Fernández
Lecture Notes in Computer Science
8634
, 2014, pp. 244-255
Expressivity and succinctness of order-invariant logics on depth-bounded structures
Kord Eickmeyer
,
Michael Elberfeld
,
Frederik Harwath
Lecture Notes in Computer Science
8634
, 2014, pp. 256-266
Two recursively inseparable problems for probabilistic automata
Nathanaël Fijalkow
,
Hugo Gimbert
,
Florian Horn
,
Youssouf Oualhadj
Lecture Notes in Computer Science
8634
, 2014, pp. 267-278
Monadic second-order logic with arbitrary monadic predicates
Nathanaël Fijalkow
,
Charles Paperman
Lecture Notes in Computer Science
8634
, 2014, pp. 279-290
Transforming two-way alternating finite automata to one-way nondeterministic automata
Viliam Geffert
,
Alexander Okhotin
Lecture Notes in Computer Science
8634
, 2014, pp. 291-302
Measure properties of game tree languages
Tomasz Gogacz
,
Henryk Michalewski
,
Matteo Mio
,
Michaƚ Skrzypczak
Lecture Notes in Computer Science
8634
, 2014, pp. 303-314
On upper and lower bounds on the length of alternating towers
S̑tȇpán Holub
,
Galina Jirásková
,
Tomás̑ Masopust
Lecture Notes in Computer Science
8634
, 2014, pp. 315-326
{\sf L\textsuperscript {ax}F}: Side conditions and external evidence as monads
Furio Honsell
,
Luigi Liquori
,
Ivan Scagnetto
Lecture Notes in Computer Science
8634
, 2014, pp. 327-339
The monoid of queue actions
Martin Huschenbett
,
Dietrich Kuske
,
Georg Zetzsche
Lecture Notes in Computer Science
8634
, 2014, pp. 340-351
Seiten 1
2
3
4
5
6
>