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
[1]
Hilfe
Suche: Author="Wagner, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generation problems
E. Böhler
,
C. Glaßer
,
B. Schwarz
,
K.W. Wagner
Theoretical Computer Science
345
(2-3), 2005, pp. 260-295
The chain method to separate counting classes
K. Cronauer
,
U. Hertrampf
,
H. Vollmer
,
K.W. Wagner
Theory of Computing Systems
31
(1), 1998, pp. 93-108
On balanced versus unbalanced computation trees
U. Hertrampf
,
H. Vollmer
,
K.W. Wagner
Math. Systems Theory
29
(4), 1996, pp. 411-421
On adaptive dlogtime and polylogtime reductions
Carme Álvarez
,
Birgit Jenner
Lecture Notes in Computer Science
775
, 1994, pp. 301-312
On the approximability of finding maximum feasible subsystems of linear systems
Edoardo Amaldi
,
Viggo Kann
Lecture Notes in Computer Science
775
, 1994, pp. 521-532
Parallel detection of all palindromes in a string
Alberto Apostolico
,
Dany Breslauer
,
Zvi Galil
Lecture Notes in Computer Science
775
, 1994, pp. 497-506
Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
Hiroki Arimura
,
Takeshi Shinohara
,
Setsuko Otsuki
Lecture Notes in Computer Science
775
, 1994, pp. 649-660
Hypertransition systems
André Arnold
Lecture Notes in Computer Science
775
, 1994, pp. 327-338
Operational specifications with built-ins
Jürgen Avenhaus
,
Klaus Becker
Lecture Notes in Computer Science
775
, 1994, pp. 263-274
Two proof procedures for a cardinality based language in propositional calculus
Belaid Benhamou
,
Lakhdar Sais
,
Pierre Siegel
Lecture Notes in Computer Science
775
, 1994, pp. 71-82
Transforming constraint logic programs
N. Bensaou
,
I. Guessarian
Lecture Notes in Computer Science
775
, 1994, pp. 33-46
On the complexity of the maximum cut problem
Hans L. Bodlaender
,
Klaus Jansen
Lecture Notes in Computer Science
775
, 1994, pp. 769-780
The global power of additional queries to random oracles
Ronald V. Book
,
Jack H. Lutz
,
David M., Jr. Martin
Lecture Notes in Computer Science
775
, 1994, pp. 403-414
On the acceptance power of regular languages
Bernd Borchert
Lecture Notes in Computer Science
775
, 1994, pp. 533-541
Coding with traces
Véronique Bruyère
,
Clelia De Felice
,
Giovanna Guaiana
Lecture Notes in Computer Science
775
, 1994, pp. 353-364
The variable membership problem: Succinctness versus complexity
Gerhard Buntrock
,
Krzysztof Loryś
Lecture Notes in Computer Science
775
, 1994, pp. 595-606
On the structure of parameterized problems in
NP
Liming Cai
,
Jianer Chen
,
Rodney Downey
,
Michael Fellows
Lecture Notes in Computer Science
775
, 1994, pp. 509-520
Optimal pattern matching on meshes
Bogdan S. Chlebus
,
Leszek Ga̧sieniec
Lecture Notes in Computer Science
775
, 1994, pp. 213-224
Ground reducibility and automata with disequality constraints
Hubert Comon
,
Florent Jacquemard
Lecture Notes in Computer Science
775
, 1994, pp. 151-162
Upper bounds for the expected length of a longest common subsequence of two binary sequences
Vlado Danc̑ík
,
Mike Paterson
Lecture Notes in Computer Science
775
, 1994, pp. 669-678
Efficient parallel algorithms for geometric
k
-clustering problems
Amitava Datta
Lecture Notes in Computer Science
775
, 1994, pp. 475-486
q
-grammars: Results, implementation
Maylis Delest
,
Jean-Philippe Dubernard
Lecture Notes in Computer Science
775
, 1994, pp. 377-388
On vertex ranking for permutation and other graphs
J.S. Deogun
,
T. Kloks
,
D. Kratsch
,
H. Müller
Lecture Notes in Computer Science
775
, 1994, pp. 747-758
One binary Horn clause is enough
Philippe Devienne
,
Patrick Lebègue
,
Jean-Christophe Routier
,
Jörg Würtz
Lecture Notes in Computer Science
775
, 1994, pp. 21-32
Dominating cliques in graphs with hypertree structure
Feodor F. Dragan
,
Andreas Brandstädt
Lecture Notes in Computer Science
775
, 1994, pp. 735-746
Seiten 1
2
3
4
5
6
7
>