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: Author="Hirsch, Edward A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Plenary invited talks - Challenges in comparative genomics: From biological problems to combinatorial algorithms (and back)
Max A. Alekseyev
,
Pavel Pevzner
Lecture Notes in Computer Science
7353
, 2012, pp. XII-XII
Resilient quicksort and selection
Maxim Babenko
,
Ivan Pouzyrevsky
Lecture Notes in Computer Science
7353
, 2012, pp. 6-17
General quantitative specification theories with modalities
Sebastian S. Bauer
,
Uli Fahrenberg
,
Axel Legay
,
Claus Thrane
Lecture Notes in Computer Science
7353
, 2012, pp. 18-30
DKAL: A distributed knowledge autohorization language and its logic of information
Lev Beklemishev
Lecture Notes in Computer Science
7353
, 2012, pp. XIII-XIV
The complexity of intersecting finite automata having few final states
Michael Blondin
,
Pierre McKenzie
Lecture Notes in Computer Science
7353
, 2012, pp. 31-42
Infinite sets that are finite up to permutations
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
7353
, 2012, pp. XV-XVI
News about semiantichains and unichain coverings
Bartƚomiej Bosek
,
Stefan Felsner
,
Kolja Knauer
,
Grzegorz Matecki
Lecture Notes in Computer Science
7353
, 2012, pp. 43-51
Dynamics of Rauzy graphs for low-complexity words
Julien Cassaigne
Lecture Notes in Computer Science
7353
, 2012, pp. XVII-XVIII
Checking tests for read-once functions over arbitrary bases
Dmitry V. Chistikov
Lecture Notes in Computer Science
7353
, 2012, pp. 52-63
Approximating minimum power edge-multi-covers
Nachshon Cohen
,
Zeev Nutov
Lecture Notes in Computer Science
7353
, 2012, pp. 64-75
Computing all MOD-functions simultaneously
Evgeny Demenkov
,
Alexander S. Kulikov
,
Ivan Mihajlin
,
Hiroki Morizumi
Lecture Notes in Computer Science
7353
, 2012, pp. 81-88
A lower bound on circuit complexity of vector function in
U_2
Evgeny Demenkov
Lecture Notes in Computer Science
7353
, 2012, pp. 76-80
Bounded synchronization delay in Omega-rational expressions
Volker Diekert
,
Manfred Kufleitner
Lecture Notes in Computer Science
7353
, 2012, pp. 89-98
Towards optimal degree-distributions for left-perfect matchings in random bipartite graphs
Martin Dietzfelbinger
,
Michael Rink
Lecture Notes in Computer Science
7353
, 2012, pp. 99-111
Robust sensor range for constructing strongly connected spanning digraphs in UDGs
Stefan Dobrev
,
Evangelos Kranakis
,
Oscar Morales Ponce
,
Milan Plz̑ík
Lecture Notes in Computer Science
7353
, 2012, pp. 112-124
Worst-case optimal priority queues via extended regular counters
Amr Elmasry
,
Jyrki Katajainen
Lecture Notes in Computer Science
7353
, 2012, pp. 125-137
The complexity of minor-ancestral graph properties with forbidden pairs
Eli Fox-Epstein
,
Danny Krizanc
Lecture Notes in Computer Science
7353
, 2012, pp. 138-147
Satisfiability thresholds beyond
k
-XORSAT
Andreas Goerdt
,
Lutz Falke
Lecture Notes in Computer Science
7353
, 2012, pp. 148-159
Finding vertex-surjective graph homomorphisms
Petr A. Golovach
,
Bernard Lidický
,
Barnaby Martin
,
Daniël Paulusma
Lecture Notes in Computer Science
7353
, 2012, pp. 160-171
Broadcast domination on block graphs in linear time
Pinar Heggernes
,
Sigve H. Sæther
Lecture Notes in Computer Science
7353
, 2012, pp. 172-183
Characterizing certain topological specifications
Bernhard Heinemann
Lecture Notes in Computer Science
7353
, 2012, pp. 184-195
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
Edward A. Hirsch
,
Dmitry Itsykson
,
Ivan Monakhov
,
Alexander Smal
Theory of Computing Systems
51
(2), 2012, pp. 179-195
On an optimal randomized acceptor for graph nonisomorphism
Edward A. Hirsch
,
Dmitry Itsykson
Information Processing Letters
112
(5), 2012, pp. 166-171
Faster algorithms for sparse Fourier Transform
Piotr Indyk
Lecture Notes in Computer Science
7353
, 2012, pp. IXX-IXX
Descriptional complexity of operations on alternating and Boolean automata
Galina Jirásková
Lecture Notes in Computer Science
7353
, 2012, pp. 196-204
Seiten 1
2
3
>