Share on TelegramAutomata, languages and programming Elektronische Daten : 27th international colloquium : proceedings
Author: Montanari, Ugo, International Colloquium on Automata, Languages and Programming
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: ABSTRAKTE MASCHINEN + UNIVERSELLE MASCHINEN (THEORETISCHE INFORMATIK), THEORIE DER PROGRAMMIERUNG, ABSTRACT DEVICES + UNIVERSAL MACHINES (THEORETICAL COMPUTER SCIENCE), MODULES ABSTRAITS + MACHINES UNIVERSELLES (INFORMATIQUE THÉORIQUE), THÉORIE DE LA PROGRAMMATION, THEORY OF PROGRAMMING
Publishers: Berlin : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540677151, 9783540677154
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 482.02 MB
PDF Size: 12.39 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 936
Views: 986
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 08:48:03
Size: 22.93 KB
Description
Author: Ugo Montanari, José D. P. Rolim, Emo Welzl
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67715-4
DOI: 10.1007/3-540-45022-X
Table of Contents:
- Game Semantics: Achievements and Prospects
- Clique Is Hard to Approximate within n
- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming
- A Statically Allocated Parallel Functional Language
- An Optimal Minimum Spanning Tree Algorithm
- Improved Shortest Paths on the Word RAM
- Improved Algorithms for Finding Level Ancestors in Dynamic Trees
- Lax Logical Relations
- Reasoning about Idealized ALGOL Using Regular Languages
- The Measurement Process in Domain Theory
- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution
- Monotone Proofs of the Pigeon Hole Principle
- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models
- Algebraic Models for Contextual Nets
- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
- Measures of Nondeterminism in Finite Automata
- LTL Is Expressively Complete for Mazurkiewicz Traces
- An Automata-Theoretic Completeness Proof for Interval Temporal Logic
- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
"... 27th International Colloquium on Automata, Languages and Programming"
