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="Puri, Anuj"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for the multi-constrained routing problem
Anuj Puri
,
Stavros Tripakis
Lecture Notes in Computer Science
2368
, 2002, pp. 338-347
What's decidable about hybrid automata?
Thomas A. Henzinger
,
Peter W. Kopke
,
Anuj Puri
,
Pravin Varaiya
Journal of Computer and System Sciences
57
(1), 1998, pp. 94-124
What's decidable about hybrid automata?
Thomas A. Henzinger
,
Peter W. Kopke
,
Anuj Puri
,
Pravin Varaiya
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 373-382
Structural complexity of
\omega
-automata
Sriram C. Krishnan
,
Anuj Puri
,
Robert K. Brayton
Lecture Notes in Computer Science
900
, 1995, pp. 143-156
Deterministic
\omega
automata vis-a-vis deterministic Buchi automata
Sriram C. Krishnan
,
Anuj Puri
,
Robert K. Brayton
Lecture Notes in Computer Science
834
, 1994, pp. 378-386