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="Joseph, Mathai"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Verification, refinement and scheduling of real-time programs
Zhiming Liu
,
Mathai Joseph
Theoretical Computer Science
253
(1), 2001, pp. 119-152
A compositional framework for fault tolerance by specification transformation
Doron Peled
,
Mathai Joseph
Theoretical Computer Science
128
(1-2), 1994, pp. 99-125
A compositional approach for fault-tolerance using specification transformation
Doron Peled
,
Mathai Joseph
Lecture Notes in Computer Science
694
, 1993, pp. 173-184
Time and real-time in programs
Mathai Joseph
Lecture Notes in Computer Science
405
, 1989, pp. 312-324
Persistent first class procedures are enough
Malcolm P. Atkinson
,
Ronald Morrison
Lecture Notes in Computer Science
181
, 1984, pp. 223-240
Replacement in monotone Boolean networks: An algebraic perspective
Meurig Beynon
Lecture Notes in Computer Science
181
, 1984, pp. 165-178
Heuristic search approach to optimal routing in a distributed architecture
Bhargab B. Bhattacharya
,
Suranjan Ghose
,
Bhabani P. Sinha
,
Pradip K. Srimani
Lecture Notes in Computer Science
181
, 1984, pp. 152-164
Eliminating cascading rollback in structured databases
Gael N. Buckley
,
A. Silberschatz
Lecture Notes in Computer Science
181
, 1984, pp. 331-343
On the existence and construction of robust communication protocols for unreliable channels
Saumya K. Debray
,
Ariel J. Frank
,
Scott A. Smolka
Lecture Notes in Computer Science
181
, 1984, pp. 136-151
A linear-time algorithm for determining the intersection type of two star polygons
S.K. Ghosh
Lecture Notes in Computer Science
181
, 1984, pp. 317-330
Functional programming systems revisited
Asis K. Goswami
,
L.M. Patnaik
Lecture Notes in Computer Science
181
, 1984, pp. 44-59
An efficient algorithm for random sampling without replacement
P. Gupta
,
G.P. Bhattacharjee
Lecture Notes in Computer Science
181
, 1984, pp. 435-442
Universal and representative instances using unmarked nulls
Sushil Jajodia
Lecture Notes in Computer Science
181
, 1984, pp. 367-378
VLSI systems for design rule checks
Rajiv Kane
,
Sartaj Sahni
Lecture Notes in Computer Science
181
, 1984, pp. 259-278
Logic for knowledge representation
R.A. Kowalski
Lecture Notes in Computer Science
181
, 1984, pp. 1-12
Treating terminals as function values of time
Kamala Krithivasan
,
Anindya Das
Lecture Notes in Computer Science
181
, 1984, pp. 188-201
Recognition and top-down generation of
\beta
-acyclic database schemes
V.S. Lakshmanan
,
N. Chandraskaran
,
C.E. Veni Madhavan
Lecture Notes in Computer Science
181
, 1984, pp. 344-366
Bounds on the length of convex partitions of polygons
Christos Levcopoulos
,
Andrzej Lingas
Lecture Notes in Computer Science
181
, 1984, pp. 279-295
Logical specification and implementation
T.S.E. Maibaum
,
M.R. Sadler
,
P.A.S. Veloso
Lecture Notes in Computer Science
181
, 1984, pp. 13-30
Models and transformations for nondeterministic extensions of functional programming
Thomas J. Myers
,
A. Toni Cohen
Lecture Notes in Computer Science
181
, 1984, pp. 60-88
A distributed algorithm for detecting communication deadlocks
N. Natarajan
Lecture Notes in Computer Science
181
, 1984, pp. 119-135
Degrees of non-determinism and concurrency: A Petri net view
M. Nielsen
,
P.S. Thiagarajan
Lecture Notes in Computer Science
181
, 1984, pp. 89-117
On the mean weight balance factor of binary trees
A.K. Pal
,
A. Bagchi
Lecture Notes in Computer Science
181
, 1984, pp. 419-434
Logics of knowledge, games and dynamic logic
Rohit Parikh
Lecture Notes in Computer Science
181
, 1984, pp. 202-222
Generic oracles
Bruno Poizat
Lecture Notes in Computer Science
181
, 1984, pp. 380-380
Seiten 1
2
3
>