| Description |
1 online resource (ix, 368 pages) : illustrations |
| Series |
Lecture notes in computer science ; 210 |
|
Lecture notes in computer science ; 210.
|
| Contents |
Abstract interpretation of denotational definitions -- Temporal reasoning under generalized fairness constraints -- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples -- Some probabilistic powerdomains in the category SFP -- Ions and local definitions in logic programming -- Input sensitive, optimal parallel randomized algorithms for addition and identification -- A parallel statistical cooling algorithm -- Subgraph isomorphism for biconnected outerplanar graphs in cubic time -- Polynomial time algorithms for finding integer relations among real numbers -- New upperbounds for decentralized extrema-finding in a ring of processors -- Algorithms for visibility representations of planar graphs -- Speeding up random access machines by few processors -- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs -- On sparseness, ambiguity and other decision problems for acceptors and transducers -- Varietes de Semis Groupes et Mots Infinis -- Equations in free partially commutative monoids -- Separating and testing -- Decomposition de Fonctions Rationnelles -- Long unavoidable patterns -- Abstract implementations and correctness proofs -- Strictness and serializability -- Towards specification and proof of asynchronous systems -- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report) -- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata -- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning?-machines -- On sparse oracles separating feasible complexity classes -- On generalized kolmogorov complexity -- Area-time optimal division for T=?((logn)1+?) -- A time-space tradeoff for element distinctness -- Parallel machines and their communication theoretical limits |
| Notes |
"Organized jointly by the special interest group for theoretical computer science of the Gesellschaft für Informatik (G.I.) and the special interest group for applied mathematic[s] of the Association française des sciences et techniques de l'information, de l'organisation et des systèmes (AFCET)"--Foreword |
|
English and French |
| Bibliography |
Includes bibliographical references |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
Print version record |
|
digitized 2015 HathiTrust Digital Library committed to preserve pda MiAaHDL |
| Subject |
Electronic data processing -- Congresses
|
|
Computers -- Congresses
|
|
Computers
|
|
Electronic data processing
|
|
Ordinateurs -- Congrès.
|
|
Informatique -- Congrès.
|
| Genre/Form |
Conference papers and proceedings
|
| Form |
Electronic book
|
| Author |
Monien, B.
|
|
Vidal-Naquet, G.
|
|
Gesellschaft für Informatik.
|
|
Association française des sciences et techniques de l'information, de l'organisation et des systèmes.
|
| ISBN |
9783540397588 |
|
3540397582 |
|
