Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=560

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

Program checking
Manuel Blum
Lecture Notes in Computer Science 560, 1991, pp. 1-9
Randomizing reductions of search problems
Andreas Blass, Yuri Gurevich
Lecture Notes in Computer Science 560, 1991, pp. 10-24
Time analysis, cost equivalence, and program refinement
David Sands
Lecture Notes in Computer Science 560, 1991, pp. 25-39
AC-equation solving
Subrata Mitra, G. Sivakumar
Lecture Notes in Computer Science 560, 1991, pp. 40-56
On the operational interpretation of complex types
Qing-Ping Tan, Huo-Wang Chen
Lecture Notes in Computer Science 560, 1991, pp. 57-70
Tense logics for local reasoning in distributed systems
Kamal Lodaya, R. Ramanujam
Lecture Notes in Computer Science 560, 1991, pp. 71-88
Failures semantics for a simple process language with refinement
Luca Aceto, Uffe Engberg
Lecture Notes in Computer Science 560, 1991, pp. 89-108
Correctness of programs over poor signatures
Hardi Hungar
Lecture Notes in Computer Science 560, 1991, pp. 109-120
Complexity issues for vacillatory function identification
John Case, Sanjay Jain, Arun Sharma
Lecture Notes in Computer Science 560, 1991, pp. 121-140
A purely algebraic proof of McNaughton's theorem on infinite words
Bertrand Le Saec, Jean-Eric Pin, Pascal Weil
Lecture Notes in Computer Science 560, 1991, pp. 141-151
The structure and complexity of minimal NFA's over a unary alphabet
Tao Jiang, Edward McDowell, B. Ravikumar
Lecture Notes in Computer Science 560, 1991, pp. 152-171
Relativised cellular automata and complexity classes
Meena Mahajan, Kamala Krithivasan
Lecture Notes in Computer Science 560, 1991, pp. 172-185
Computing the order of a locally testable automaton
Sam Kim, Robert McNaughton
Lecture Notes in Computer Science 560, 1991, pp. 186-211
On the structure and complexity of infinite sets with minimal perfect hash functions
Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
Lecture Notes in Computer Science 560, 1991, pp. 212-223
NP-hard sets and creativeness over constant time languages
Manindra Agrawal
Lecture Notes in Computer Science 560, 1991, pp. 224-241
Complete problems involving Boolean labelled structures and projection translations
Iain A. Stewart
Lecture Notes in Computer Science 560, 1991, pp. 242-260
Is BP.\oplus P a probabilistic class?
V. Vinay
Lecture Notes in Computer Science 560, 1991, pp. 261-265
Fast stable in-place sorting with O(n) data moves
J. Ian Munro, Venkatesh Raman
Lecture Notes in Computer Science 560, 1991, pp. 266-277
A theorem on the approximation of set cover and vertex cover
V.Th. Paschos
Lecture Notes in Computer Science 560, 1991, pp. 278-287
A fast algorithm for the principal partition of a graph
Sachin Patkar, H. Narayanan
Lecture Notes in Computer Science 560, 1991, pp. 288-306
Uniform circuits and exclusive read PRAMs
Inga Niepel, Peter Rossmanith
Lecture Notes in Computer Science 560, 1991, pp. 307-318
Contracting planar graphs efficiently in parallel
Martin Fürer, Balaji Raghavachari
Lecture Notes in Computer Science 560, 1991, pp. 319-335
Fast deterministic selection on mesh-connected processor arrays
Danny Krizanc, Lata Narayanan, Rajeev Raman
Lecture Notes in Computer Science 560, 1991, pp. 336-346
Improved selection in totally monotone arrays
Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen
Lecture Notes in Computer Science 560, 1991, pp. 347-359
Designing secure communication protocols from trust specifications
Christos H. Papadimitriou, Venkat Rangan, Martha Sideri
Lecture Notes in Computer Science 560, 1991, pp. 360-368

Seiten 1 2 >