Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=472

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

Reasoning about linear constraints using parametric queries
Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
Lecture Notes in Computer Science 472, 1990, pp. 1-20
Discriminant circumscription
Li Yan Yuan, Jia-Huai You
Lecture Notes in Computer Science 472, 1990, pp. 21-32
Complexity of algebraic specifications
Ramesh Subrahmanyam
Lecture Notes in Computer Science 472, 1990, pp. 33-47
A new method for undecidability proofs of first order theories
Ralf Treinen
Lecture Notes in Computer Science 472, 1990, pp. 48-62
Generating plans in linear logic
M. Masseron, C. Tollu, J. Vauzeilles
Lecture Notes in Computer Science 472, 1990, pp. 63-75
Automata-theoretic techniques for image generation and compression
Karel Culik II, Simant Dube
Lecture Notes in Computer Science 472, 1990, pp. 76-90
Recognizable infinite tree sets and their complexity
A. Saoudi, D.E. Muller, P.E. Schupp
Lecture Notes in Computer Science 472, 1990, pp. 91-103
The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata
V. Vinay, V. Chandru
Lecture Notes in Computer Science 472, 1990, pp. 104-114
Towards constructive program derivation in VDM
Christopher P. Lewington
Lecture Notes in Computer Science 472, 1990, pp. 115-132
A new method for proving termination of AC-rewrite systems
Deepak Kapur, G. Sivakumar, Hantao Zhang
Lecture Notes in Computer Science 472, 1990, pp. 133-148
Efficient parallel algorithms for optical computing with the DFT primitive
John Reif, Akhilesh Tyagi
Lecture Notes in Computer Science 472, 1990, pp. 149-160
The power of collision: Randomized parallel algorithms for chaining and integer sorting
Rajeev Raman
Lecture Notes in Computer Science 472, 1990, pp. 161-175
Fast parallel algorithms for cographs
R. Lin, S. Olariu
Lecture Notes in Computer Science 472, 1990, pp. 176-189
Optimally representing Euclidean space discretely for analogically simulating physical phenomena
John Case, Dayanand S. Rajan, Anil M. Shende
Lecture Notes in Computer Science 472, 1990, pp. 190-203
Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs
Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
Lecture Notes in Computer Science 472, 1990, pp. 204-214
Randomized parallel selection
Sanguthevar Rajasekaran
Lecture Notes in Computer Science 472, 1990, pp. 215-224
A fast parallel algorithm for finding a maximal bipartite set
David Pearson, Vijay Vazirani
Lecture Notes in Computer Science 472, 1990, pp. 225-231
On the parallel evaluation of classes of circuits
S. Rao Kosaraju
Lecture Notes in Computer Science 472, 1990, pp. 232-237
Voronoi diagrams of moving points in the plane
Jyh-Jong Fu, R.C.T. Lee
Lecture Notes in Computer Science 472, 1990, pp. 238-254
Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design
Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray
Lecture Notes in Computer Science 472, 1990, pp. 255-269
On some largest empty orthoconvex polygons in a point set
Amitava Datta, G.D.S. Ramkumar
Lecture Notes in Computer Science 472, 1990, pp. 270-285
Defining process fairness for non-interleaving concurrency
Marta Z. Kwiatkowska
Lecture Notes in Computer Science 472, 1990, pp. 286-300
Observational logics and concurrency models
Rocco De Nicola, Gian Luigi Ferrari
Lecture Notes in Computer Science 472, 1990, pp. 301-315
Distributed reset
Anish Arora, Mohamed Gouda
Lecture Notes in Computer Science 472, 1990, pp. 316-331
Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables
Peter Grnning, Thomas Qvist Nielsen, Hans Henrik Lvengreen
Lecture Notes in Computer Science 472, 1990, pp. 332-348

Seiten 1 2 >