2002, ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
2002, ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2002, ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
Springer.com Nr. 978-3-540-36206-7. Versandkosten:Worldwide free shipping, , zzgl. Versandkosten. Details... |
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science : 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings - neues Buch
2002, ISBN: 9783540362067
; PDF; Computing > Computer programming / software development > Software Engineering, Springer Berlin Heidelberg
hive.co.uk No. 9783540362067. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details... |
2003, ISBN: 9783540362067
22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2003
lehmanns.de Versandkosten:Download sofort lieferbar. (EUR 0.00) Details... |
2002, ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
Manindra Agrawal; Anil Seth:
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - neues Buch2002, ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
2002
ISBN: 9783540362067
This volume consists of the proceedings of the 22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), organized under the … Mehr…
2003, ISBN: 9783540362067
22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg, 2003
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
EAN (ISBN-13): 9783540362067
Erscheinungsjahr: 2002
Herausgeber: Springer Berlin Heidelberg
Buch in der Datenbank seit 2017-04-25T08:48:09+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-19T17:32:33+01:00 (Zurich)
ISBN/EAN: 9783540362067
ISBN - alternative Schreibweisen:
978-3-540-36206-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: anil seth, schlicht
Titel des Buches: technology technology, foundations science, computer science
Daten vom Verlag:
Autor/in: Manindra Agrawal; Anil Seth
Titel: Lecture Notes in Computer Science; FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings
Verlag: Springer; Springer Berlin
368 Seiten
Erscheinungsjahr: 2003-07-01
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 368 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Algorithms; Approximation; Computer Science Logic; Computing Theory; Formal Methods; Mathematical Logic; Optimization; Program Semantics; Programming Calculi; Programming Theory; Theoretical Computer Science; algorithmics; computer; computer science; programming; algorithm analysis and problem complexity; C; Software Engineering; Theory of Computation; Computer Science Logic and Foundations of Programming; Compilers and Interpreters; Algorithms; Computer Science; Theoretische Informatik; Compiler und Übersetzer; Algorithmen und Datenstrukturen; BC
Invited Papers.- Primality Testing with Gaussian Periods.- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.- Encoding Generic Judgments.- Model Checking Algol-Like Languages Using Game Semantics.- Modeling Software: From Theory to Practice.- Contributed Papers.- Local Normal Forms for Logics over Traces.- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.- Communication Interference in Mobile Boxed Ambients.- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity.- Composing Strand Spaces.- Generalising Automaticity to Modal Properties of Finite Structures.- An Automata-Theoretic Approach to Constraint LTL.- Hardness Results for Multicast Cost Sharing.- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.- State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences.- Algorithmic Combinatorics Based on Slicing Posets.- Pattern Matching for Arc-Annotated Sequences.- Knowledge over Dense Flows of Time (from a Hybrid Point of View).- The Complexity of the Inertia.- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures.- Deciding the First Level of the ?-Calculus Alternation Hierarchy.- Dynamic Message Sequence Charts.- The Complexity of Compositions of Deterministic Tree Transducers.- On the Hardness of Approximating Minimum Monopoly Problems.- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems.- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic.- Nearest Neighbors Search Using Point Location in Balls with Applications toApproximate Voronoi Decompositions.- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases.- Decomposition in Asynchronous Circuit Design.- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387587158 Foundations of Software Technology and Theoretical Computer Science: 14th Conference, Madras, India, December 15-17, 1994 : Proceedings (P. S. Thiagarajan)
- 9780387138831 Foundations of Software Technology and Theoretical Computer Science (Lecture Notes in Computer Science) (Editor-Mathai Joseph)
- 9780387534879 Foundations of Software Technology and Theoretical Computer Science 10th Conference, Bangalore, India, Dec. 17-19, 1990 Proceedings (Lecture Notes in Computer Science) (Kesav V. Nori)
- 9780387549675 Foundations of Software Technology and Theoretical Computer Science 11th Conference, New Delhi, India December 17-19, 1991 Proceedings (S. Biswas; Editor-Kesav V. Nori)
- 9780387171791 Foundations of Software Technology and Theoretical Computer Science: Sixth Conference, New Delhi, India December 18-20, 1986 Proceedings (Editor-Kesav V. Nori)
- 9780387575292 Foundations of Software Technology and Theoretical Computer Science: 13th Conference Bombay, India, December 15-17, 1993 : Proceedings (R. K. Shyamasundar)
- FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. (Hariharan, Ramesh et al. (Eds.))
< zum Archiv...