FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science: 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings: Lecture Notes in Computer Science, cartea 2245
Editat de Ramesh Hariharan, Madhavan Mukund, V. Vinayen Limba Engleză Paperback – 28 noi 2001
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 548.35 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 611.22 lei
- 20% Preț: 319.10 lei
- 20% Preț: 552.64 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 256.27 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 722.40 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 329.65 lei
Preț vechi: 412.06 lei
-20% Nou
Puncte Express: 494
Preț estimativ în valută:
63.11€ • 68.75$ • 52.94£
63.11€ • 68.75$ • 52.94£
Carte tipărită la comandă
Livrare economică 19 decembrie 24 - 02 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540430025
ISBN-10: 3540430024
Pagini: 364
Ilustrații: XII, 352 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.84 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540430024
Pagini: 364
Ilustrații: XII, 352 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.84 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.