- 5 Ergebnisse
Kleinster Preis: € 106,99, größter Preis: € 181,15, Mittelwert: € 134,58
1
Automata, Languages and Programming
Bestellen
bei Orellfuessli.ch
CHF 184,90
(ca. € 181,15)
Versand: € 17,631
Bestellen
Details beim Anbieter
gesponserter Link

Automata, Languages and Programming - neues Buch

2009, ISBN: 9783642029271

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Gr… Mehr…

Nr. A1032358135. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.63)
zuklappen (X)
2
Automata, Languages and Programming - Susanne Albers; Alberto Marchetti-Spaccamela; Yossi Matias; Sotiris Nikoletseas; Wolfgang Thomas
Bestellen
bei Springer.com
€ 106,99
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link

Susanne Albers; Alberto Marchetti-Spaccamela; Yossi Matias; Sotiris Nikoletseas; Wolfgang Thomas:

Automata, Languages and Programming - neues Buch

2009, ISBN: 9783642029271

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Gr… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
zuklappen (X)
3
Automata, Languages and Programming - Springer
Bestellen
bei Thalia.de
€ 128,39
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Springer:
Automata, Languages and Programming - neues Buch

2009

ISBN: 9783642029271

The two-volume set LNCS 5555 and LNCS 5556 constitutes the refereed proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, held in Rhodes, Gr… Mehr…

Nr. 25398478. Versandkosten:, Sofort per Download lieferbar, DE. (EUR 0.00)
zuklappen (X)
4
Automata, Languages and Programming - Susanne Albers; Alberto Marchetti-Spaccamela; Yossi Matias; Sotiris Nikoletseas; Wolfgang Thomas
Bestellen
bei lehmanns.de
€ 137,05
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Susanne Albers; Alberto Marchetti-Spaccamela; Yossi Matias; Sotiris Nikoletseas; Wolfgang Thomas:
Automata, Languages and Programming - neues Buch

2009, ISBN: 9783642029271

36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, eBooks, eBook Download (PDF), [PU: Springer Berlin Heidelberg], Springer Berlin Heidelberg… Mehr…

Versandkosten:Download sofort lieferbar. (EUR 0.00)
zuklappen (X)
5
Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I - Mutsumi Saito
Bestellen
bei hive.co.uk
£ 99,45
(ca. € 119,31)
Bestellen
Details und Versand
gesponserter Link
Mutsumi Saito:
Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I - neues Buch

2009, ISBN: 9783642029271

; PDF; Computing > Computer programming / software development > Algorithms & data structures, Springer Berlin Heidelberg

No. 9783642029271. Versandkosten:Instock, Despatched same working day before 3pm, plus shipping costs., zzgl. Versandkosten
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Automata, Languages and Programming
Autor:
Titel:
ISBN-Nummer:

9783642029271

Detailangaben zum Buch - Automata, Languages and Programming


EAN (ISBN-13): 9783642029271
ISBN (ISBN-10): 3642029272
Erscheinungsjahr: 2009
Herausgeber: Springer Berlin Heidelberg
22 Seiten
Sprache: eng/Englisch

Buch in der Datenbank seit 2010-11-18T05:08:16+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-12-18T09:10:29+01:00 (Zurich)
ISBN/EAN: 9783642029271

ISBN - alternative Schreibweisen:
3-642-02927-2, 978-3-642-02927-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: albers, susan albert, marchetti
Titel des Buches: art programming, automata, rhodes, colloquium international

Daten vom Verlag:

Autor/in: Susanne Albers; Alberto Marchetti-Spaccamela; Yossi Matias; Sotiris Nikoletseas; Wolfgang Thomas
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I
Verlag: Springer; Springer Berlin
789 Seiten
Erscheinungsjahr: 2009-07-06
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XXII, 789 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Hashing; Matchings; Partition; Quicksort; Scheduling; complexity; data streams; game theory; graph theory; k-SAT; logic; performance analysis; sorting; sorting algorithms; structured design; algorithm analysis and problem complexity; C; Software Engineering/Programming and Operating Systems; Theory of Computation; Discrete Mathematics in Computer Science; Mathematics of Computing; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Software Engineering; Theory of Computation; Discrete Mathematics in Computer Science; Mathematics of Computing; Algorithms; Computer Science; Theoretische Informatik; Mathematik für Informatiker; Diskrete Mathematik; Algorithmen und Datenstrukturen; BC

Invited Lectures.- Assigning Papers to Referees.- Algorithmic Game Theory: A Snapshot.- Contributed Papers.- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs.- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems.- Sorting and Selection with Imprecise Comparisons.- Fast FAST.- Bounds on the Size of Small Depth Circuits for Approximating Majority.- Counting Subgraphs via Homomorphisms.- External Sampling.- Functional Monitoring without Monotonicity.- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.- Towards a Study of Low-Complexity Graphs.- Decidability of Conjugacy of Tree-Shifts of Finite Type.- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule.- Competitive Analysis of Aggregate Max in Windowed Streaming.- Faster Regular Expression Matching.- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.- Unconditional Lower Bounds against Advice.- Approximating Decision Trees with Multiway Branches.- Annotations in Data Streams.- The Tile Complexity of Linear Assemblies.- A Graph Reduction Step Preserving Element-Connectivity and Applications.- Approximating Matches Made in Heaven.- Strong and Pareto Price of Anarchy in Congestion Games.- A Better Algorithm for Random k-SAT.- Exact and Approximate Bandwidth.- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs.- On Cartesian Trees and Range Minimum Queries.- Applications of a Splitting Trick.- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.- Incompressibility through Colors and IDs.- Partition Arguments in Multiparty Communication Complexity.- High Complexity Tilings with Sparse Errors.- Tight Bounds for the Cover Time of Multiple Random Walks.- Online Computation with Advice.- Dynamic Succinct Ordered Trees.- Universal Succinct Representations of Trees?.- Distortion Is Fixed Parameter Tractable.- Towards Optimal Range Medians.- B-Treaps: A Uniquely Represented Alternative to B-Trees.- Testing Fourier Dimensionality and Sparsity.- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.- Wireless Communication Is in APX.- The Ehrenfeucht-Silberger Problem.- Applications of Effective Probability Theory to Martin-Löf Randomness.- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables.- Popular Mixed Matchings.- Factoring Groups Efficiently.- On Finding Dense Subgraphs.- Learning Halfspaces with Malicious Noise.- General Scheme for Perfect Quantum Network Coding with Free Classical Communication.- Greedy -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.- Limits and Applications of Group Algebras for Parameterized Problems.- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.- Improved Bounds for Flow Shop Scheduling.- A 3/2-Approximation Algorithm for General Stable Marriage.- Limiting Negations in Formulas.- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems.- Superhighness and Strong Jump Traceability.- Amortized Communication Complexity of Distributions.- The Number of Symbol Comparisons in QuickSort and QuickSelect.- Computing the Girth of a Planar Graph in O(n logn) Time.- Elimination Graphs.

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9780387088600 Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17-21, 1978 (G. Ausiello)

< zum Archiv...