FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings - nuovo libro

EAN (ISBN-13): 9783540430025
ISBN (ISBN-10): 3540430024
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2001
Editore: Springer
364 Pagine
Peso: 0,550 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-11-11T22:53:46+01:00 (Zurich)
Pagina di dettaglio ultima modifica in 2024-02-08T15:16:36+01:00 (Zurich)
ISBN/EAN: 9783540430025

ISBN - Stili di scrittura alternativi:
3-540-43002-4, 978-3-540-43002-5
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : hariharan, ramesh, vinay
Titolo del libro: bangalore, theoretical computer science, war 2001, the wonder that was india, software, foundations science, lecture notes computer science, science and technology, computer science 1st edition ebook

---

Dati dell'editore

Autore: Ramesh Hariharan; Madhavan Mukund; V. Vinay
Titolo: Lecture Notes in Computer Science; FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings
Editore: Springer; Springer Berlin
352 Pagine
Anno di pubblicazione: 2001-11-28
Berlin; Heidelberg; DE
Lingua: Inglese
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 352 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; complexity; computer; computer science; data structure; data structures; formal verification; logic; model checking; petri net; verification; Theory of Computation; Software Engineering; Computer and Information Systems Applications; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Formal Languages and Automata Theory; Software Engineering; Angewandte Informatik; Compiler und Übersetzer; EA

Invited Papers.- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity.- Approximation Schemes for Geometric NP-Hard Problems: A Survey.- On Clustering Using Random Walks.- An Introduction to Decidability of DPDA Equivalence.- Semidefinite Programming Based Approximation Algorithms.- Contributed Papers.- Hard Sets and Pseudo-random Generators for Constant Depth Circuits.- The First-Order Isomorphism Theorem.- Thresholds and Optimal Binary Comparison Search Trees.- Distributed LTL Model Checking Based on Negative Cycle Detection.- Computability and Complexity Results for a Spatial Assertion Language for Data Structures.- Using Nondeterminism to Design Efficient Deterministic Algorithms.- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.- A Mechanically Verified Compiling Specification for a Lisp Compiler.- Beyond Regular Model Checking.- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel.- List Decoding from Erasures: Bounds and Code Constructions.- Verification of a Leader Election Algorithm in Timed Asynchronous Systems.- Efficient Addition on Field Programmable Gate Arrays.- The Directed Minimum-Degree Spanning Tree Problem.- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.- Beyond Message Sequence Graphs.- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints.- Properties of Distributed Timed-Arc Petri Nets.- From Falsification to Verification.- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.- Range Allocation for Equivalence Logic.- Rewrite Closure for Ground and Cancellative AC Theories.