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="Cori, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the orbits of the product of two permutations
A. Bergey
,
R. Cori
Theoretical Computer Science
131
(2), 1994, pp. 449-461
On the boundary of a union of rays
Panagiotis Alevizos
,
Jean-Daniel Boissonnat
,
Franco P. Preparata
Lecture Notes in Computer Science
349
, 1989, pp. 72-83
The query topology in logic programming
Aida Batarekh
,
V.S. Subrahmanian
Lecture Notes in Computer Science
349
, 1989, pp. 375-387
Distributed computing on transitive networks: The torus
Paul W. Beame
,
Hans L. Bodländer
Lecture Notes in Computer Science
349
, 1989, pp. 294-303
Testing membership: Beyond permutation groups
M. Beaudry
,
P. McKenzie
,
D. Thérien
Lecture Notes in Computer Science
349
, 1989, pp. 388-399
On the complexity of approximating the independent set problem
Piotr Berman
,
Georg Schnitger
Lecture Notes in Computer Science
349
, 1989, pp. 256-268
Properties of infinite words: Recent results
J. Berstel
Lecture Notes in Computer Science
349
, 1989, pp. 36-46
Reversals and Alternation
Gerhard Buntrock
,
Albrecht Höne
Lecture Notes in Computer Science
349
, 1989, pp. 218-228
On the power of parity polynomial time
Jin-yi Cai
,
Lane A. Hemachandra
Lecture Notes in Computer Science
349
, 1989, pp. 229-239
Measure of parallelism of distributed computations
Bernadette Charron-Bost
Lecture Notes in Computer Science
349
, 1989, pp. 434-445
On the equivalence problem for deterministic multitape automata and transducers
Karel Culik II
,
Juhani Karhumäki
Lecture Notes in Computer Science
349
, 1989, pp. 468-479
Word problems over traces which are solvable in linear time
Volker Diekert
Lecture Notes in Computer Science
349
, 1989, pp. 168-180
An
O(n \log n)
algorithm for computing a link center in a simple polygon
Hristo N. Djidjev
,
Andrzej Lingas
,
Jörg-Rüdiger Sack
Lecture Notes in Computer Science
349
, 1989, pp. 96-107
Fault masking probabilities with single and multiple signature analysis
Jürgen Doenhardt
Lecture Notes in Computer Science
349
, 1989, pp. 327-338
Linear numeration systems,
\Theta
-developments and finite automata
Christiane Frougny
Lecture Notes in Computer Science
349
, 1989, pp. 144-155
Successive approximation in parallel graph algorithms
Donald Fussell
,
Ramakrishna Thurimella
Lecture Notes in Computer Science
349
, 1989, pp. 205-217
Complete problems and strong polynomial reducibilities
K. Ganesan
,
Steven Homer
Lecture Notes in Computer Science
349
, 1989, pp. 240-250
Polynomial graph-colorings
Wolfgang Gutjahr
,
Emo Welzl
,
Gerhart Wöginger
Lecture Notes in Computer Science
349
, 1989, pp. 108-119
Observational implementations
Rolf Hennicker
Lecture Notes in Computer Science
349
, 1989, pp. 59-71
Chain properties of rule closures
Miki Hermann
Lecture Notes in Computer Science
349
, 1989, pp. 339-347
Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
Friedhelm Hinz
Lecture Notes in Computer Science
349
, 1989, pp. 132-143
Decidability of weak fairness in Petri nets
Petr Janc̑ar
Lecture Notes in Computer Science
349
, 1989, pp. 446-457
Deciding bisimulation equivalences for a class of non-finite-state programs
Bengt Jonsson
,
Joachim Parrow
Lecture Notes in Computer Science
349
, 1989, pp. 421-433
Rounds versus time for the two person pebble game
Bala Kalyanasundaram
,
Georg Schnitger
Lecture Notes in Computer Science
349
, 1989, pp. 517-529
Average number of messages for distributed leader finding in rings of processors
Christian Lavault
Lecture Notes in Computer Science
349
, 1989, pp. 269-281
Seiten 1
2
3
4
>