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="Reps, Thomas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Program analysis using weighted pushdown systems
Thomas Reps
,
Akash Lal
,
Nick Kidd
Lecture Notes in Computer Science
4855
, 2007, pp. 23-51
Model checking of unrestricted hierarchical state machines
Michael Benedikt
,
Patrice Godefroid
,
Thomas Reps
Lecture Notes in Computer Science
2076
, 2001, pp. 652-666
Interconvertibility of a class of set constraints and context-free-language reachability
David Melski
,
Thomas Reps
Theoretical Computer Science
248
(1-2), 2000, pp. 29-98
An incremental algorithm for a generalization of the shortest-path problem
G. Ramalingam
,
Thomas Reps
Journal of Algorithms
21
(2), 1996, pp. 267-305
On the computational complexity of dynamic graph problems
G. Ramalingam
,
Thomas Reps
Theoretical Computer Science
158
(1-2), 1996, pp. 233-277
On the sequential nature of interprocedural program-analysis problems
Thomas Reps
Acta Informatica
33
(8), 1996, pp. 739-757
Precise interprocedural dataflow analysis with applications to constant propagation
Mooly Sagiv
,
Thomas Reps
,
Susan Horwitz
Theoretical Computer Science
167
(1-2), 1996, pp. 131-170
Scan grammars: Parallel attribute evaluation via data-parallelism
Thomas Reps
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 367-376
Efficient comparison of program slices
Susan Horwitz
,
Thomas Reps
Acta Informatica
28
, 1991, pp. 713-732