ISBN: 9783540491163
The Symposium on Theoretical Aspects of Computer Science (STACS) is held annually, alternating between France and Germany. The current volume cons- tutes the proceedings of the 16th STACS… Mehr…
ebooks.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2003, ISBN: 9783540491163
16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Ber… Mehr…
lehmanns.de Versandkosten:Download sofort lieferbar. (EUR 0.00) Details... |
STACS 99 : 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings - neues Buch
ISBN: 9783540491163
; PDF; Computing > Databases, Springer Berlin Heidelberg
hive.co.uk No. 9783540491163. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details... |
ISBN: 9783540491163
STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science Trier Germany March 4-6 1999 Proceedings: ab 106.99 € Medien > Bücher > E-books, [PU: Springer, Berlin/Heidelberg]
eBook.de Nr. 33504889. Versandkosten:, , DE. (EUR 0.00) Details... |
ISBN: 9783540491163
There is currently no description available Books > Computer Science eBook, Springer Shop
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540491163
The Symposium on Theoretical Aspects of Computer Science (STACS) is held annually, alternating between France and Germany. The current volume cons- tutes the proceedings of the 16th STACS… Mehr…
2003, ISBN: 9783540491163
16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Ber… Mehr…
ISBN: 9783540491163
STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science Trier Germany March 4-6 1999 Proceedings: ab 106.99 € Medien > Bücher > E-books, [PU: Springer, Berlin/Heidelberg]
ISBN: 9783540491163
There is currently no description available Books > Computer Science eBook, Springer Shop
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - STACS 99
EAN (ISBN-13): 9783540491163
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin Heidelberg
Buch in der Datenbank seit 2017-06-04T10:53:35+02:00 (Zurich)
Detailseite zuletzt geändert am 2022-01-03T12:07:33+01:00 (Zurich)
ISBN/EAN: 9783540491163
ISBN - alternative Schreibweisen:
978-3-540-49116-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: christoph meinel
Titel des Buches: kur trier
Daten vom Verlag:
Autor/in: Christoph Meinel; Sophie Tison
Titel: Lecture Notes in Computer Science; STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings
Verlag: Springer; Springer Berlin
590 Seiten
Erscheinungsjahr: 2003-05-21
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIV, 590 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; algorithms; automata; complexity; computational geometry; computer; computer science; data structures; formal language; formal languages; logic; verification; C; Theory of Computation; Data Structures and Information Theory; Mathematics of Computing; Data Structures; Programming Languages, Compilers, Interpreters; Theory of Computation; Data Structures and Information Theory; Mathematics of Computing; Data Science; Compilers and Interpreters; Computer Science; Algorithmen und Datenstrukturen; Informationstheorie; Mathematik für Informatiker; Datenbanken; Compiler und Übersetzer; BC
Invited Talks.- Algorithms for Selfish Agents.- The Reduced Genus of a Multigraph.- Classifying Discrete Temporal Properties.- Complexity 1.- Circuit Complexity of Testing Square-Free Numbers.- Relating Branching Program Size and Formula Size over the Full Binary Basis.- Theory of Parallel Algorithms 1.- Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.- The Average Time Complexity to Compute Prefix Functions in Processor Networks.- Complexity 2.- On the Hardness of Permanent.- One-Sided Versus Two-Sided Error in Probabilistic Computation.- Computational Geometry.- An Optimal Competitive Strategy for Walking in Streets.- An Optimal Strategy for Searching in Unknown Streets.- Parallel Searching on m Rays.- Complexity 3.- A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.- Descriptive Complexity of Computable Sequences.- Complexity of Some Problems in Universal Algebra.- Algorithms and Data Structures 1.- New Branchwidth Territories.- Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.- Treewidth and Minimum Fill-In of Weakly Triangulated Graphs.- Automata and Formal Languages.- Decidability and Undecidability of Marked PCP.- On Quadratic Word Equations.- Some Undecidability Results Related to the Star Problem in Trace Monoids.- Algorithms and Data Structures 2.- An Approximation Algorithm for Max p-Section.- Approximating Bandwidth by Mixing Layouts of Interval Graphs.- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs.- Complexity 4.- Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries.- Sparse Sets, Approximable Sets, and Parallel Queries to NP.- Algorithms and Data Structures 3.- External Selection.- Fast Computations of the Exponential Function.- Verification.- A Model of Behaviour Abstraction for Communicating Processes.- Model Checking Lossy Vector Addition Systems.- Algorithms and Data Structures 4.- Constructing Light Spanning Trees with Small Routing Cost.- Finding Paths with the Right Cost.- Complexity 5.- In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?.- Lower Bounds for Dynamic Algebraic Problems.- An Explicit Lower Bound for TSP with Distances One and Two.- Theory of Parallel Algorithms 2.- Scheduling Dynamic Graphs.- Supporting Increment and Decrement Operations in Balancing Networks.- Worst-Case Equilibria.- Algorithmic Learning.- A Complete and Tight Average-Case Analysis of Learning Monomials.- Costs of General Purpose Learning.- Universal Distributions and Time-Bounded Kolmogorov Complexity.- Logic in Computer Science.- The Descriptive Complexity Approach to LOGCFL.- The Weakness of Self-Complementation.- On the Difference of Horn Theories.- Complexity 6.- On Quantum Algorithms for Noncommutative Hidden Subgroups.- On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions.- How To Forget a Secret.- Logic in Computer Science 2.- A Modal Fixpoint Logic with Chop.- Completeness of Neighbourhood Logic.- Eliminating Recursion in the ?-Calculus.- Complexity 7.- On Optimal Algorithms and Optimal Proof Systems.- Space Bounds for Resolution.- Algorithms and Data Structures 5.- Upper Bounds for Vertex Cover Further Improved.- Online Matching for Scheduling Problems.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9780387172194 Stacs 87: 4th Annual Symposium on Theoretical Aspects of Computer Science Passau, Federal Republic of Germany, February 19-21, 1987 Proceedings (Lecture Notes in Computer Science) (Wirsing, M., Franz J. Brandenburg and G. Vidal-Naquet)
- 9780387172194 Stacs 87: 4th Annual Symposium on Theoretical Aspects of Computer Science Passau, Federal Republic of Germany, February 19-21, 1987 Proceedings (Lecture Notes in Computer Science) (Wirsing, M., Franz J. Brandenburg and G. Vidal-Naquet)
- 9780387522821 Language Policy and Modernity in Southeast Asia (Lecture Notes in Computer Science) (Antonio L. Rappa, Lionel Wee Hock An)
- 9783540656913 STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999 Proceedings Christoph Meinel Editor (Tison, Sophie, Meinel, Christoph)
- 9780387552101 Stacs 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992 : Proceedings (Lecture Notes in Computer Science) (Finkel, A)
< zum Archiv...