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="Koubek, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
Rostislav Caha
,
V. Koubek
Journal of Graph Theory
51
(2), 2006, pp. 137-169
Optimal embeddings of odd ladders into a hypercube
R. Caha
,
V. Koubek
Discrete Applied Mathematics
116
(1-2), 2002, pp. 73-102
Algorithms for transitive closure
A. Koubková
,
V. Koubek
Information Processing Letters
81
(6), 2002, pp. 289-296
On the disjunctive set problem
P. Goralcik
,
V. Koubek
Theoretical Computer Science
204
(1-2), 1998, pp. 99-118
On range searching with semialgebraic sets
Pankaj K. Agarwal
,
Jiȓí Matous̑ek
Lecture Notes in Computer Science
629
, 1992, pp. 1-13
A perfect parallel dictionary
Holger Bast
,
Martin Dietzfelbinger
,
Torben Hagerup
Lecture Notes in Computer Science
629
, 1992, pp. 133-141
Some remarks on the test complexity of iterative logic arrays
Bernd Becker
,
Joachim Hartmann
Lecture Notes in Computer Science
629
, 1992, pp. 142-152
The degree structure of 1-L reductions
Hans-Jörg Burtschick
,
Albrecht Hoene
Lecture Notes in Computer Science
629
, 1992, pp. 153-161
Promise problems and access to unambiguous computation
Jin-yi Cai
,
Lane A. Hemachandra
,
Jozef Vyskoc̑
Lecture Notes in Computer Science
629
, 1992, pp. 162-171
On the complexity of incremental computation
Suresh Chari
,
Desh Ranjan
,
Pankaj Rohatgi
Lecture Notes in Computer Science
629
, 1992, pp. 172-180
Rational transductions and complexity of counting problems
Christian Choffrut
,
Massimiliano Goldwurm
Lecture Notes in Computer Science
629
, 1992, pp. 181-190
Negation elimination in equational formulae
Hubert Comon
,
Maribel Fernández
Lecture Notes in Computer Science
629
, 1992, pp. 191-199
Object interaction
J.F. Costa
,
A. Sernadas
,
C. Sernadas
,
H.-D. Ehrich
Lecture Notes in Computer Science
629
, 1992, pp. 200-208
Strong normalization of substitutions
P.-L. Curien
,
T. Hardin
,
A. Ríos
Lecture Notes in Computer Science
629
, 1992, pp. 209-217
Probabilistic and pluralistic learners with mind changes
Robert Daley
,
Bala Kalyanasundaram
Lecture Notes in Computer Science
629
, 1992, pp. 218-226
Parallel complexity of iterated morphisms and the arithmetic of small numbers
Carsten Damm
,
Markus Holzer
,
Klaus-Jörn Lange
Lecture Notes in Computer Science
629
, 1992, pp. 227-235
On computational power of weighted finite automata
D. Derencourt
,
J. Karhumäki
,
M. Latteux
,
A. Terlutte
Lecture Notes in Computer Science
629
, 1992, pp. 236-245
Graph layout problems
J. Díaz
Lecture Notes in Computer Science
629
, 1992, pp. 14-23
The shuffle exchange network has a Hamiltonian path
Rainer Feldmann
,
Peter Mysliwietz
Lecture Notes in Computer Science
629
, 1992, pp. 246-254
Poset properties of complex traces
Paul Gastin
,
Antoine Petit
Lecture Notes in Computer Science
629
, 1992, pp. 255-263
A threshold for unsatisfiability
Andreas Goerdt
Lecture Notes in Computer Science
629
, 1992, pp. 264-274
Dataflow semantics for Petri nets
Robert Gold
Lecture Notes in Computer Science
629
, 1992, pp. 275-283
About boundedness for some DATALOG and
\mbox{DATALOG}^{neg}
programs
Irène Guessarian
,
Marcos Veloso-Peixoto
Lecture Notes in Computer Science
629
, 1992, pp. 284-297
Merging and sorting strings in parallel
Torben Hagerup
,
Ola Petersson
Lecture Notes in Computer Science
629
, 1992, pp. 298-306
Characterization of context-free languages by erasing automata
Petr Janc̑ar
,
Frantis̑ek Mrás
,
Martin Plátek
Lecture Notes in Computer Science
629
, 1992, pp. 307-314
Seiten 1
2
3
4
5
>