Search preferences
Vai alla pagina principale dei risultati di ricerca

Filtri di ricerca

Tipo di articolo

  • Tutti i tipi di prodotto 
  • Libri (7)
  • Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
  • Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
  • Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
  • Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
  • Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
  • Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
  • Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)

Condizioni Maggiori informazioni

  • Nuovo (7)
  • Come nuovo, Ottimo o Quasi ottimo (Nessun altro risultato corrispondente a questo perfezionamento)
  • Molto buono o Buono (Nessun altro risultato corrispondente a questo perfezionamento)
  • Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
  • Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)

Legatura

  • Tutte 
  • Rilegato (Nessun altro risultato corrispondente a questo perfezionamento)
  • Brossura (7)

Ulteriori caratteristiche

  • Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
  • Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
  • Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
  • Con foto (5)
  • Non Print on Demand (4)

Lingua (1)

Prezzo

  • Qualsiasi prezzo 
  • Inferiore a EUR 20 (Nessun altro risultato corrispondente a questo perfezionamento)
  • EUR 20 a EUR 45 (Nessun altro risultato corrispondente a questo perfezionamento)
  • Superiore a EUR 45 
Fascia di prezzo personalizzata (EUR)

Paese del venditore

  • Jos C.M. Baeten

    Lingua: Inglese

    Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: Grand Eagle Retail, Bensenville, IL, U.S.A.

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    EUR 72,44

    Spedizione gratuita
    Spedito in U.S.A.

    Quantità: 1 disponibili

    Aggiungi al carrello

    Paperback. Condizione: new. Paperback. This book constitutes the refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections including algorithms, process algebra, approximation algorithms, languages and programming, complexity and data structures. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

  • Jos C.M. Baeten

    Lingua: Inglese

    Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: AussieBookSeller, Truganina, VIC, Australia

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    EUR 85,09

    Spedizione EUR 31,89
    Spedito da Australia a U.S.A.

    Quantità: 1 disponibili

    Aggiungi al carrello

    Paperback. Condizione: new. Paperback. This book constitutes the refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections including algorithms, process algebra, approximation algorithms, languages and programming, complexity and data structures. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

  • Jos C. M. Baeten (u. a.)

    Lingua: Inglese

    Editore: Springer, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: preigu, Osnabrück, Germania

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    EUR 50,25

    Spedizione EUR 70,00
    Spedito da Germania a U.S.A.

    Quantità: 5 disponibili

    Aggiungi al carrello

    Taschenbuch. Condizione: Neu. Automata, Languages and Programming | 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings | Jos C. M. Baeten (u. a.) | Taschenbuch | 2 Taschenbücher | Englisch | 2003 | Springer | EAN 9783540404934 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

  • Jos C. M. Baeten

    Lingua: Inglese

    Editore: Springer Berlin Heidelberg, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: AHA-BUCH GmbH, Einbeck, Germania

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    EUR 53,49

    Spedizione EUR 68,85
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Aggiungi al carrello

    Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Therefereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003.The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.

  • Jos C. M. Baeten

    Lingua: Inglese

    Editore: Springer Berlin Heidelberg Jun 2003, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    Print on Demand

    EUR 53,49

    Spedizione EUR 23,00
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Aggiungi al carrello

    Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Therefereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003.The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems. 1240 pp. Englisch.

  • Baeten, Joseph C. M.|Lenstra, Jan Karel|Parrow, Joachim

    Lingua: Inglese

    Editore: Springer Berlin Heidelberg, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: moluna, Greven, Germania

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    Print on Demand

    EUR 48,37

    Spedizione EUR 48,99
    Spedito da Germania a U.S.A.

    Quantità: Più di 20 disponibili

    Aggiungi al carrello

    Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The&nbsprefereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003.The 84 revised full papers presented together with six invited papers were .

  • Jos C. M. Baeten

    Lingua: Inglese

    Editore: Springer, Springer Jun 2003, 2003

    ISBN 10: 3540404937 ISBN 13: 9783540404934

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania

    Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

    Contatta il venditore

    Print on Demand

    EUR 53,49

    Spedizione EUR 60,00
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Aggiungi al carrello

    Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Lectures.- Polarized Process Algebra and Program Equivalence.- Problems on RNA Secondary Structure Prediction and Design.- Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks.- The SPQR-Tree Data Structure in Graph Drawing.- Model Checking and Testing Combined.- Logic and Automata: A Match Made in Heaven.- Algorithms.- Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.- Generalized Framework for Selectors with Applications in Optimal Group Testing.- Decoding of Interleaved Reed Solomon Codes over Noisy Data.- Process Algebra.- On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.- Resource Access and Mobility Control with Dynamic Privileges Acquisition.- Replication vs. Recursive Definitions in Channel Based Calculi.- Approximation Algorithms.- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality.- An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.- Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem.- Approximating Steiner k-Cuts.- MAX k-CUT and Approximating the Chromatic Number of Random Graphs.- Approximation Algorithm for Directed Telephone Multicast Problem.- Languages and Programming.- Mixin Modules and Computational Effects.- Decision Problems for Language Equations with Boolean Operations.- Generalized Rewrite Theories.- Complexity.- Sophistication Revisited.- Scaled Dimension and Nonuniform Complexity.- Quantum Search on Bounded-Error Inputs.- A Direct Sum Theorem in Communication Complexity via Message Compression.- Data Structures.- Optimal Cache-Oblivious Implicit Dictionaries.- TheCell Probe Complexity of Succinct Data Structures.- Succinct Representations of Permutations.- Succinct Dynamic Dictionaries and Trees.- Graph Algorithms.- Labeling Schemes for Weighted Dynamic Trees.- A Simple Linear Time Algorithm for Computing a (2k - 1)-Spanner of O(n 1+1/k ) Size in Weighted Graphs.- Multicommodity Flows over Time: Efficient Algorithms and Complexity.- Multicommodity Demand Flow in a Tree.- Automata.- Skew and Infinitary Formal Power Series.- Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.- Residual Languages and Probabilistic Automata.- A Testing Scenario for Probabilistic Automata.- The Equivalence Problem for t-Turn DPDA Is Co-NP.- Flip-Pushdown Automata: k + 1 Pushdown Reversals Are Better than k.- Optimization and Games.- Convergence Time to Nash Equilibria.- Nashification and the Coordination Ratio for a Selfish Routing Game.- Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution.- An Intersection Inequality for Discrete Distributions and Related Generation Problems.- Graphs and Bisimulation.- Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games.- Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.- Bisimulation Proof Methods for Mobile Ambients.- On Equivalent Representations of Infinite Structures.- Online Problems.- Adaptive Raising Strategies Optimizing Relative Efficiency.- A Competitive Algorithm for the General 2-Server Problem.- On the Competitive Ratio for Online Facility Location.- A Study of Integrated Document and Connection Caching.- Verification.- A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems.- Monadic Second-Order Logics withCardinalities.- 2 2 AFMC.- Upper Bounds for a Theory of Queues.- Around the Internet.- Degree Distribution of the FKP Network Model.- Similarity Matrices for Pairs of Graphs.- Algorithmic Aspects of Bandwidth Trading.- Temporal Logic and Model Checking.- CTL+ Is Complete for Double Exponential Time.- Hierarchical and Recursive State Machines w.