Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=181

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Logic for knowledge representation
R.A. Kowalski
Lecture Notes in Computer Science 181, 1984, pp. 1-12
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
Process specification of logic programs
R. Ramanujam, R.K. Shyamasundar
Lecture Notes in Computer Science 181, 1984, pp. 31-43
Functional programming systems revisited
Asis K. Goswami, L.M. Patnaik
Lecture Notes in Computer Science 181, 1984, pp. 44-59
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
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
Proof rules for communication abstractions
Gad Taubenfeld, Nissim Francez
Lecture Notes in Computer Science 181, 1984, pp. 118-118
A distributed algorithm for detecting communication deadlocks
N. Natarajan
Lecture Notes in Computer Science 181, 1984, pp. 119-135
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
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
Replacement in monotone Boolean networks: An algebraic perspective
Meurig Beynon
Lecture Notes in Computer Science 181, 1984, pp. 165-178
A new characterization of BPP
Stathis Zachos, Hans Heller
Lecture Notes in Computer Science 181, 1984, pp. 179-187
Treating terminals as function values of time
Kamala Krithivasan, Anindya Das
Lecture Notes in Computer Science 181, 1984, pp. 188-201
Logics of knowledge, games and dynamic logic
Rohit Parikh
Lecture Notes in Computer Science 181, 1984, pp. 202-222
Persistent first class procedures are enough
Malcolm P. Atkinson, Ronald Morrison
Lecture Notes in Computer Science 181, 1984, pp. 223-240
Abstraction concepts for modeling screen oriented dialogue interfaces
R. Studer
Lecture Notes in Computer Science 181, 1984, pp. 241-258
VLSI systems for design rule checks
Rajiv Kane, Sartaj Sahni
Lecture Notes in Computer Science 181, 1984, pp. 259-278
Bounds on the length of convex partitions of polygons
Christos Levcopoulos, Andrzej Lingas
Lecture Notes in Computer Science 181, 1984, pp. 279-295
On mapping cube graphs onto VLSI arrays
I.V. Ramakrishnan, P.J. Varman
Lecture Notes in Computer Science 181, 1984, pp. 296-316
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
Eliminating cascading rollback in structured databases
Gael N. Buckley, A. Silberschatz
Lecture Notes in Computer Science 181, 1984, pp. 331-343
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
Universal and representative instances using unmarked nulls
Sushil Jajodia
Lecture Notes in Computer Science 181, 1984, pp. 367-378
On some computational problems related to data base coding
F. de Santis, M.I. Sessa
Lecture Notes in Computer Science 181, 1984, pp. 379-379
Generic oracles
Bruno Poizat
Lecture Notes in Computer Science 181, 1984, pp. 380-380

Seiten 1 2 >