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="Rosier, L.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm reminiscent of Euclidean-
gcd
for computing a function related to pinwheel scheduling
T.H. Romer
,
L.E. Rosier
Algorithmica
17
(1), 1997, pp. 1-10
On preemptive scheduling of periodic, real-time tasks on one processor
S.K. Baruah
,
R.R. Howell
,
L.E. Rosier
Lecture Notes in Computer Science
452
, 1990, pp. 173-179
System simulation and the sensitivity of self-stabilization (extended abstract)
M.G. Gouda
,
R.R. Howell
,
L.E. Rosier
Lecture Notes in Computer Science
379
, 1989, pp. 249-258
Normal and sinkless Petri nets
R.R. Howell
,
L.E. Rosier
,
Hsu-Chun Yen
Lecture Notes in Computer Science
380
, 1989, pp. 234-243
A taxonomy of fairness and temporal logic problems for Petri nets
R.R. Howell
,
L.E. Rosier
,
H.-C. Yen
Lecture Notes in Computer Science
324
, 1988, pp. 351-359
On questions of fairness and temporal logic for conflict-free Petri nets
R.R. Howell
,
L.E. Rosier
Lecture Notes in Computer Science
340
, 1988, pp. 200-226
On the complexity of containment, equivalence and reachibility for finite and 2-dimensional vector addition systems with states
R.R. Howell
,
D.T. Huynh
,
L.E. Rosier
,
H.C. Yen
Lecture Notes in Computer Science
247
, 1987, pp. 360-370
Completeness results for reachability, containment, and equivalence with respect to conflict-free vector replacement systems
R.R. Howell
,
L.E. Rosier
Lecture Notes in Computer Science
267
, 1987, pp. 509-520
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning
\omega
-machines
L.E. Rosier
,
Hsu-Chun Yen
SIAM Journal on Computing
16
(5), 1987, October, pp. 779-807
Boundedness, empty channel detection, and synchronization for communicating finite automata
L.E. Rosier
,
H.-C. Yen
Theoretical Computer Science
44
(1), 1986, pp. 69-105
A multiparameter analysis of the boundedness problem for vector addition systems
L.E. Rosier
,
Hsu-Chun Yen
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 105-135
A note on Presburger arithmetic with array segments, permutation and equality
L.E. Rosier
Information Processing Letters
22
(1), 1986, January, pp. 33-35
Priority networks of communicating finite state machines
M.G. Gouda
,
L.E. Rosier
SIAM Journal on Computing
14
(3), 1985, August, pp. 569-584
On space and time efficient TM simulations of some restricted classes of PDA's
O.H. Ibarra
,
S.M. Kim
,
L.E. Rosier
Information and Control
67
(1-3), 1985, pp. 126-143
Some characterizations of multihead finite automata
O.H. Ibarra
,
S.M. Kim
,
L.E. Rosier
Information and Control
67
(1-3), 1985, pp. 114-125
The equivalence problem and correctness formulas for a simple class of programs
O.H. Ibarra
,
L.E. Rosier
Information and Control
65
(1), 1985, pp. 18-41
On simple programs with primitive conditional statements
O.H. Ibarra
,
L.E. Rosier
Information and Control
65
(1), 1985, pp. 42-62
A multiparameter analysis of the boundedness problem for vector addition systems
L.E. Rosier
,
H.-C. Yen
Lecture Notes in Computer Science
199
, 1985, pp. 361-370
Communicating finite state machines with priority channels
M.G. Gouda
,
L.E. Rosier
Lecture Notes in Computer Science
172
, 1984, pp. 209-221
Space and time efficient simulations and characterizations of some restricted classes of PDAS
O.H. Ibarra
,
S.M. Kim
,
L.E. Rosier
Lecture Notes in Computer Science
172
, 1984, pp. 247-259
On the control power of integer division
O.H. Ibarra
,
S. Moran
,
L.E. Rosier
Theoretical Computer Science
24
(1), 1983, pp. 35-52
Simple programming languages and restricted classes of Turing machines
O.H. Ibarra
,
L.E. Rosier
Theoretical Computer Science
26
(1,2), 1983, pp. 197-220
Probabilistic algorithms and straight-line programs for some rank decision problems
O.H. Ibarra
,
S. Moran
,
L.E. Rosier
Information Processing Letters
12
(5), 1981, October, pp. 227-232
On the decidability of equivalence for deterministic pushdown transducers
O.H. Ibarra
,
L.E. Rosier
Information Processing Letters
13
(3), 1981, December, pp. 89-93
A note on the parallel complexity of computing the rank of order
n
matrices
O. Ibarra
,
S. Moran
,
L.E. Rosier
Information Processing Letters
11
, 1980, December, pp. 162