• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel och pussel

Skapa nya rutiner – hälsoböcker upp till 50% →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Systemvetenskap och AI

    Automata, Languages and Programming

    26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings

    AvJiri Wiedermann,Peter van Emde Boas

    Häftad, Engelska, 1999

    Del i serien Lecture Notes in Computer Science

    1 110 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    ICALP { the International Colloquium on Automata, Languages, and Progr- ming { is a series of annual conferences of the European Association for Th- retical Computer Science (EATCS). ICALP'99 was organized by the Institute of Computer Science of the Academy of Sciences of the Czech Republic in - operation with the Action M Agency. Stimulated by the positive experience from previous meetings, the guiding idea of the ICALP'99 organization was to keep and to enhance the idea of a parallel two{track conference with invited plenary talks. Similarly to the two parts of the journal Theoretical Computer Science, Track A of the meeting is devoted to Algorithms, Automata, Complexity, and Games, and Track B to Logic, Semantics, and Theory of Programming. The Program Committee was structured along these same lines. As a further inno- tion, ICALP'99 was coordinated with the European Symposium on Algorithms (ESA'99) in such a way that both conferences took place in the same location with the former immediately followed by the latter. ICALP'99 was the 26th in the series of ICALP colloquia. Previous colloquia were held in Paris (1972), Saarbruc .. ken (1974), Edinburgh (1976), Turku (1977), Udine (1978), Graz (1979), Amsterdam (1980), Haifa (1981), Aarhus (1982), Barcelona (1983), Antwerp (1984), Nafplion (1985), Rennes (1986), Karlsruhe (1987), Tampere (1988), Stresa (1989), Warwick (1990), Madrid (1991), Vienna (1992), Lund (1993), Jerusalem (1994), Szeged (1995), Paderborn (1996), Bo- gna (1997), and Aalborg (1998).In the year 2000 ICALP will be held in Geneva.

    Produktinformation

    • Utgivningsdatum:1999-06-29
    • Mått:155 x 235 x 40 mm
    • Vikt:1 101 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:726
    • Upplaga:1999
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783540662242

    Utforska kategorier

    • Systemvetenskap och AI inom Data och IT
    • Programvaruutveckling inom Data och IT
    • Nätverk och kommunikation inom Data och IT

    Innehållsförteckning

    • Invited Talks.- Generating Hard Instances of the Short Basis Problem.- Wide Area Computation.- Proof Techniques for Cryptographic Protocols.- Type Structure for Low-Level Programming Languages.- Real Computations with Fake Numbers.- A Model for Associative Memory, a Basis for Thinking and Consciousness.- Numerical Integration with Exact Real Arithmetic.- Observations about the Nature and State of Computer Science.- DNA Computing: New Ideas and Paradigms.- Online Data Structures in External Memory.- From Computational Learning Theory to Discovery Science.- Contributed Papers.- Bounded Depth Arithmetic Circuits: Counting and Closure.- Parametric Temporal Logic for “Model Measuring”.- Communicating Hierarchical State Machines.- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs.- General Morphisms of Petri Nets (Extended Abstract).- On Some Tighter Inapproximability Results (Extended Abstract).- Decomposition and Composition of Timed Automata.- New Applications of the Incompressibility Method (Extended Abstract).- Mobility Types for Mobile Ambients.- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains.- Decidable Fragments of Simultaneous Rigid Reachability.- Text Compression Using Antidictionaries.- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract).- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem.- Space-Time Tradeoffs for Graph Properties.- Boundedness of Reset P/T Nets.- Two-way finite state transducers and monadic second-order logic.- Partially Ordered Regular Languages for Graph Queries.- Deciding First-Order Properties of Locally Tree-Decomposable Graphs.- Comparison of Process Algebra EquivalencesUsing Formats.- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract).- Computing LOGCFL Certificates.- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract).- On the Complements of Partial k-Trees.- Approximation Results for Kinetic Variants of TSP.- Distributed Probabilistic Polling and Applications to Proportionate Agreement.- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract).- A Framework for Decidable Metrical Logics.- On the Power of Las Vegas II. Two-Way Finite Automata.- Stable Marriage with Incomplete Lists and Ties.- Average-Case Complexity of Shellsort (Preliminary Version).- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract).- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract).- Two Techniques in the Area of the Star Problem.- Approximations by OBDDs and the Variable Ordering Problem.- Simulation Preorder on Simple Process Algebras.- Solos in Concert.- Shortest Anisotropic Paths on Terrains.- Relations between Local and Global Periodicity of Words (Extended Abstract).- Efficient Merging, Construction, and Maintenance of Evolutionary Trees.- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions.- Leader Election by d Dimensional Cellular Automata.- New Upper Bounds for MaxSat.- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ?.- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time.- Finite Automata with Generalized Acceptance Criteria.- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract).- Closed Freyd- and ?-categories.- TypedExceptions and Continuations Cannot Macro-Express Each Other.- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract).- Accessing Multiple Sequences Through Set Associative Caches.- T(A) = T(B)?.- Many-Valued Logics and Holographic Proofs.- On the Complexity and Inapproximability of Shortest Implicant Problems.- The Wave Propagator Is Turing Computable.- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract).- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices.
    Hoppa över listan

    Du kanske också är intresserad av

    Mogens Nielsen, Peter van Emde Boas, Jiri Wiedermann - Automata, Languages and Programming, E-bok

    Automata, Languages and Programming

    Mogens Nielsen, Peter van Emde Boas, Jiri Wiedermann

    E-bok
    2003

    1 455 kr

    Peter van Emde Boas, Ghica van Emde Boas, Kaibo Xie, Bonan Zhao - Analyzing the Logic of Sun Tzu in “The Art of War”, Using Mind Maps, Inbunden

    Analyzing the Logic of Sun Tzu in “The Art of War”, Using Mind Maps

    Peter van Emde Boas, Ghica van Emde Boas, Kaibo Xie, Bonan Zhao

    Inbunden, 2022

    1 078 kr

    Bonan Zhao, Kaibo Xie, Ghica van Emde Boas, Peter van Emde Boas - Analyzing the Logic of Sun Tzu in &quote;The Art of War&quote;, Using Mind Maps, E-bok

    Analyzing the Logic of Sun Tzu in &quote;The Art of War&quote;, Using Mind Maps

    Bonan Zhao, Kaibo Xie, Ghica van Emde Boas, Peter van Emde Boas

    E-bok
    2022

    1 413 kr

    Peter van Emde Boas, Frans C.A. Groen, Giuseppe F. Italiano, Jerzy Nawrocki, Harald Sack - SOFSEM 2013: Theory and Practice of Computer Science, Häftad

    SOFSEM 2013: Theory and Practice of Computer Science

    Peter van Emde Boas, Frans C.A. Groen, Giuseppe F. Italiano, Jerzy Nawrocki, Harald Sack

    Häftad, 2013

    542 kr

    Harald Sack, Jerzy Nawrocki, Giuseppe F. Italiano, Frans C.A. Groen, Peter van Emde Boas - SOFSEM 2013: Theory and Practice of Computer Science, E-bok

    SOFSEM 2013: Theory and Practice of Computer Science

    Harald Sack, Jerzy Nawrocki, Giuseppe F. Italiano, Frans C.A. Groen, Peter van Emde Boas

    E-bok
    2013

    710 kr

    Peter van Emde Boas, Ghica van Emde Boas, Kaibo Xie, Bonan Zhao - Analyzing the Logic of Sun Tzu in “The Art of War”, Using Mind Maps, Häftad

    Analyzing the Logic of Sun Tzu in “The Art of War”, Using Mind Maps

    Peter van Emde Boas, Ghica van Emde Boas, Kaibo Xie, Bonan Zhao

    Häftad, 2023

    1 078 kr

    Vaclav Hlavac, Keith G. Jeffery, Jiri Wiedermann - SOFSEM 2000: Theory and Practice of Informatics, Häftad

    SOFSEM 2000: Theory and Practice of Informatics

    Vaclav Hlavac, Keith G. Jeffery, Jiri Wiedermann

    Häftad, 2000

    559 kr

    Miroslav Bartosek, Jan Staudek, Jiri Wiedermann - SOFSEM '95: Theory and Practice of Informatics, Häftad

    SOFSEM '95: Theory and Practice of Informatics

    Miroslav Bartosek, Jan Staudek, Jiri Wiedermann

    Häftad, 1995

    559 kr

    Julius Stuller, Maria Bielikova, Jaroslav Pokorny, Gerard Tel, Jiri Wiedermann - SOFSEM 2006: Theory and Practice of Computer Science, E-bok

    SOFSEM 2006: Theory and Practice of Computer Science

    Julius Stuller, Maria Bielikova, Jaroslav Pokorny, Gerard Tel, Jiri Wiedermann

    E-bok
    2005

    732 kr

    Jiri Wiedermann, Keith G. Jeffery, Vaclav Hlavac - SOFSEM 2000: Theory and Practice of Informatics, E-bok

    SOFSEM 2000: Theory and Practice of Informatics

    Jiri Wiedermann, Keith G. Jeffery, Vaclav Hlavac

    E-bok
    2003

    732 kr