Isbn: 9783319774039 - latin 2018: theoretical informatics: 13th latin american symposium, buenos aires, argentina, april 16-19, 2018, proceedings (lecture notes in computer science, 10807, band 10807) (19 Ergebnisse)

Zustand: New.

Paperback or Softback. Zustand: New. Latin 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Book.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New. 1st ed. 2018 edition NO-PA16APR2015-KAP.

Zustand: New.

Paperback. Zustand: Brand New. 800 pages. 9.25x6.10x1.97 inches. In Stock.

Taschenbuch. Zustand: Neu. LATIN 2018: Theoretical Informatics | 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings | Michael A. Bender (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xvii | Englisch | 2018 | Springer | EAN 9783319774039 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Zustand: new. Questo è un articolo print on demand.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018.The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions.The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures. 908 pp. Englisch.…

Zustand: New. Print on Demand.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018.&nbspThe 63 papers presented in this volume were carefully reviewed and selected from 161.…

Zustand: New. PRINT ON DEMAND.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018.The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions.The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The graph tessellation cover number: extremal bounds, efficient algorithms and hardness.- Approximate Correlation Clustering Using Same-Cluster Queries.- Finding tight Hamilton cycles in random hypergraphs faster.- Walking Through Waypoints.- Lower Bounds for Online Matching on the Line.- On the complexity of _nding internally vertex-disjoint long directed paths.- Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.- A Polynomial Sized Kernel for Tracking Paths Problem.- Time-Space Trade-O_s for Computing Euclidean Minimum Spanning Trees.- Approximate nearest neighbor for lp-spaces (2Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 908 pp. Englisch.…