|
Algorithms and Data Structures: The Basic Toolbox
by
3.75 avg rating — 16 ratings
—
published
2008
—
7 editions
|
|
|
Data Structures and Algorithms: Multi-Dimensional Searching and Computational Geometry (Etacs Monographs on Theroetical Computer Science)
by
4.33 avg rating — 3 ratings
—
published
1987
—
2 editions
|
|
|
LEDA: A Platform for Combinatorial and Geometric Computing
by
3.67 avg rating — 3 ratings
—
published
1999
|
|
|
Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox
by
really liked it 4.00 avg rating — 1 rating
—
5 editions
|
|
|
Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Lecture Notes in Computer Science Book 7391)
by
|
|
|
Constructive Hopf's Theorem: Or how to Untangle Closed Planar Curves
by
|
|
|
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings (Lecture Notes in Computer Science Book 5193)
by
0.00 avg rating — 0 ratings
|
|
|
On the size of sets of computable functions
by
0.00 avg rating — 0 ratings
|
|
|
GRAPH ALGORITHMS AND NP-COMPLETENESS
by
0.00 avg rating — 0 ratings
|
|
|
Multidimensional Searching and Computational Geometry
by
0.00 avg rating — 0 ratings
|
|
|
Proceedings of the fifth annual symposium on Computational Geometry
by
0.00 avg rating — 0 ratings
—
published
1989
|
|
|
Constructive Hopf's Theorem, or How to Untangle Closed Planar Curves
by
|
|
|
Granularity of Parallel Memories
by
|
|
|
Informatik 2000: Neue Horizonte im neuen Jahrhundert 30. Jahrestagung der Gesellschaft für Informatik Berlin, 19.–22. September 2000 (Informatik aktuell)
by
0.00 avg rating — 0 ratings
—
published
2000
|
|
|
Grundlagen der Programmiersprachen (Leitfäden und Monographien der Informatik) (German Edition)
by
0.00 avg rating — 0 ratings
—
published
1986
—
2 editions
|
|
|
Datenstrukturen und effiziente Algorithmen: Band 1: Sortieren und Suchen (Leitfäden und Monographien der Informatik) (German Edition)
by
0.00 avg rating — 0 ratings
—
published
2012
—
2 editions
|
|
|
Fundamentals - Foundations of Computer Science: Proceedings of the XV. Ifip World Computer Congress, 31 August - 4 September 1998, Vienna/Austria and
by
0.00 avg rating — 0 ratings
|
|
|
Effiziente Algorithmen (Leitfäden der angewandten Mathematik und Mechanik)
by
0.00 avg rating — 0 ratings
—
published
1977
|
|
|
Sorting and Searching
by
0.00 avg rating — 0 ratings
—
published
1984
|
|
|
Algorithms - ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings (Lecture Notes in Computer Science, 5193)
by
0.00 avg rating — 0 ratings
—
published
2008
|
|
|
LEDA 2 Part Paperback Set: A Platform for Combinatorial and Geometric Computing
by
0.00 avg rating — 0 ratings
—
published
2009
—
2 editions
|
|
|
Stacs 84: Symposium of Theoretical Aspects of Computer Science, Paris April 11-13, 1984 (Lecture Notes in Computer Science, 166)
by
0.00 avg rating — 0 ratings
—
published
1984
—
2 editions
|
|
|
VLSI Algorithms and Architectures: Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986. Proceedings (Lecture Notes in Computer Science, 227)
by
0.00 avg rating — 0 ratings
—
published
1986
|
|
|
Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II (Lecture Notes in Computer Science, 7392)
by
0.00 avg rating — 0 ratings
—
published
2012
—
2 editions
|
|
|
Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Lecture Notes in Computer Science, 7391)
by
0.00 avg rating — 0 ratings
—
published
2012
|
|
|
Algorithmen und Datenstrukturen: Die Grundwerkzeuge (eXamen.press)
by
0.00 avg rating — 0 ratings
|
|
|
Parallel Algorithms and Architectures: Proceedings of the International Workshop on Parallel Algorithms and Architectures Held in Suhl (Gdr), May 25-30, 1987
by
0.00 avg rating — 0 ratings
|
|
* Note: these are all the books on Goodreads for this author. To add more books,
click here.