Willkommen, schön sind Sie da!
Logo Ex Libris

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

  • Kartonierter Einband
  • 556 Seiten
(0) Erste Bewertung abgeben
Alle Bewertungen ansehen
The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-ru... Weiterlesen
CHF 136.00
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich


The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-running conference on computer science in India, and is organized under the aegis of the Indian As- ciation for Research in Computing Science, IARCS. Since its inception in 1981, the conference (held annually in the month of December) has helped in nurt- ing and creating an environment for the exchange of ideas amongst the research community in the country, by attracting top scientists around the world to the conference. This volume contains the proceedings of the 24th FSTTCS conf- ence held in December 2004. A strong point of the FSTTCS programmes has been excellent invited talks by eminent computer scientists of international renown. Continuing this t- dition, this FSTTCS featured invited talks by Javier Esparza, Piotr Indyk, Pavel A. Pevzner, John C. Reynolds, and Denis Th erien. We thank our invited speakers for readily agreeing to come to FSTTCS, and for providing write-ups for the proceedings. It is our pleasure that IARCS chose to honor Prof. Rani Siromoney at this conference, on the occasion of her 75th birthday. The in?uence she has wielded (and the impact she has exerted) in Indian theoretical computer science is tremendous, and the tribute is ?tting and richly deserved. We thank R.K. Sh- masundar for chairing the special session in her honor, and Kamala Krithivasan and K.G. Subramanian for speaking at the session.

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.


Titel: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Untertitel: 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings
EAN: 9783540240587
ISBN: 3540240586
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Genre: Informatik
Anzahl Seiten: 556
Gewicht: 832g
Größe: H235mm x B155mm x T29mm
Jahr: 2004
Untertitel: Englisch
Auflage: 2005

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"