Foundations of Software Technology and Theoretical Computer Science
Springer Berlin (Verlag)
978-3-540-66836-7 (ISBN)
Invited Talk 1.- Recent Developments in the Theory of Arrangements of Surfaces.- Session 1(a).- Dynamic Compressed Hyperoctrees with Application to the N-body Problem.- Largest Empty Rectangle among a Point Set.- Session 1(b).- Renaming Is Necessary in Timed Regular Expressions.- Product Interval Automata: A Subclass of Timed Automata.- Session 2(a).- The Complexity of Rebalancing a Binary Search Tree.- Fast Allocation and Deallocation with an Improved Buddy System.- Session 2(b).- Optimal Bounds for Transformations of ?-Automata.- CTL+ Is Exponentially More Succinct than CTL.- Invited Talk 2.- A Top-Down Look at a Secure Message.- Session 3.- Explaining Updates by Minimal Sums.- A Foundation for Hybrid Knowledge Bases.- Session 4.- Hoare Logic for Mutual Recursion and Local Variables.- Invited Talk 3.- Explicit Substitutions and Programming Languages.- Session 5(a).- Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings.- A Randomized Algorithm for Flow Shop Scheduling.- Session 5(b).- Synthesizing Distributed Transition Systems from Global Specifications.- Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata.- Session 6.- Implicit Temporal Query Languages: Towards Completeness.- On the Undecidability of Some Sub-classical First-Order Logics.- Invited Talk 4.- How to Compute with DNA.- Session 7(a).- A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles.- Protecting Facets in Layered Manufacturing.- Session 7(b).- The Receptive Distributed ?-Calculus.- Series and Parallel Operations on Pomsets.- Session 8.- Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus.- Invited Talk 5.- Graph Isomorphism: Its Complexity and Algorithms.- Session9(a).- Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables.- Lower Bounds for Linear Transformed OBDDs and FBDDs.- Session 9(b).- A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems.- Graded Modalities and Resource Bisimulation.- Session 10(a).- The Non-recursive Power of Erroneous Computation.- Analysis of Quantum Functions.- Session 10(b).- On Sets Growing Continuously.- Model Checking Knowledge and Time in Systems with Perfect Recall.- FST&TCS - ISAAC Joint Session Talks.- The Engineering of Some Bipartite Matching Programs.
Erscheint lt. Verlag | 29.11.1999 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 460 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 611 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Mathematik / Informatik ► Mathematik | |
Schlagworte | algorithms • Algorithmus • Automata • Automata Theory Algorithms • Calculus • Complexity • Computer Science • Computing Theory • D programming language • Foundations of Computing • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logic • Mathematical Logic • Model Checking • Programmiersprache • Searching • Software Engineering / Softwareentwicklung • Softwareentwicklung • theoretical computer science • Variable |
ISBN-10 | 3-540-66836-5 / 3540668365 |
ISBN-13 | 978-3-540-66836-7 / 9783540668367 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich