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

EAN (ISBN-13): 9783540430025
ISBN (ISBN-10): 3540430024
Livro de capa dura
Livro de bolso
Ano de publicação: 2001
Editor/Editora: Springer
364 Páginas
Peso: 0,550 kg
Língua: eng/Englisch

Livro na base de dados desde 2007-11-11T21:53:46+00:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-02-08T14:16:36+00:00 (Lisbon)
Número ISBN/EAN: 9783540430025

Número ISBN - Ortografia alternativa:
3-540-43002-4, 978-3-540-43002-5
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: hariharan, ramesh, vinay
Título do livro: 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

---

Dados da editora

Autor: Ramesh Hariharan; Madhavan Mukund; V. Vinay
Título: 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
Editora: Springer; Springer Berlin
352 Páginas
Ano de publicação: 2001-11-28
Berlin; Heidelberg; DE
Língua: Inglês
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.