FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science als eBook Download von - neues Buch

EAN (ISBN-13): 9783540305385
Erscheinungsjahr: 2004
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-01-09T20:42:43+01:00 (Zurich)
Detailseite zuletzt geändert am 2021-12-02T18:04:32+01:00 (Zurich)
ISBN/EAN: 9783540305385

ISBN - alternative Schreibweisen:
978-3-540-30538-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: mahajan, anthony fauci
Titel des Buches: international conference software

---

Daten vom Verlag:

Autor/in: Kamal Lodaya; Meena Mahajan
Titel: Lecture Notes in Computer Science; FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science - 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
Verlag: Springer; Springer Berlin
532 Seiten
Erscheinungsjahr: 2004-11-24
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XVI, 532 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Automat; automata; automata theory; complexity; complexity theory; computer; computer science; design; formal method; logic; mathematical logic; programming; algorithm analysis and problem complexity; C; Software Engineering/Programming and Operating Systems; Theory of Computation; Logics and Meanings of Programs; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Algorithm Analysis and Problem Complexity; Software Engineering; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Algorithms; Computer Science; Theoretische Informatik; Compiler und Übersetzer; Algorithmen und Datenstrukturen; BC

Invited Papers.- Genome Halving Problem Revisited.- Verifying Probabilistic Procedural Programs.- Streaming Algorithms for Geometric Problems.- Toward a Grainless Semantics for Shared-Variable Concurrency.- Regular Languages, Unambiguous Concatenation and Computational Complexity.- Contributed Papers.- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.- On the Urgency Expressiveness.- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.- A Decidable Fragment of Separation Logic.- Approximate Range Searching Using Binary Space Partitions.- Representable Disjoint NP-Pairs.- Symbolic Reachability Analysis of Higher-Order Context-Free Processes.- Optimal Strategies in Priced Timed Game Automata.- A Calculus for Trust Management.- Short-Cuts on Star, Source and Planar Unfoldings.- Subdividing Alpha Complex.- Real-Counter Automata and Their Decision Problems.- Adjunct Elimination Through Games in Static Ambient Logic.- On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite.- On the Complexity of Hilbert’s 17th Problem.- Who is Pointing When to Whom?.- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix.- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS.- Minimum Weight Pseudo-Triangulations.- Join Algorithms for the Theory of Uninterpreted Functions.- No, Coreset, No Cry.- Hardness Hypotheses, Derandomization, and Circuit Complexity.- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract.- Learning Languages from Positive Data and a Finite Number of Queries.- The Complexity of the Local Hamiltonian Problem.- Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds.- Adaptive Stabilization of Reactive Protocols.- Visibly Pushdown Games.- Refinement and Separation Contexts.- Decidability of MSO Theories of Tree Structures.- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.- Testing Geometric Convexity.- Complexity of Linear Connectivity Problems in Directed Hypergraphs.- Actively Learning to Verify Safety for FIFO Automata.- Reasoning About Game Equilibria Using Temporal Logic.- Alternation in Equational Tree Automata Modulo XOR.