First Sentence:
The primary goal of data structures research is to design data organization mechanisms that admit fast access and update operations.
Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
bin covering problem, working set property, queueish property, awake processors, biased skip lists, edge ranking, static finger property, strong history independence, assembly scheduling problem, degree capacity function, quantum provers, ranking spanning trees, timestamping algorithm, static optimality property, supply vertex, document listing problem, broadcast probabilities, broadcast probability, private qubits, cache oblivious priority queue, quantum verifier, smallest enclosing square, branching vector, tree spanners, irreducible triangulation
Key Phrases - Capitalized Phrases (CAPs):
(learn more)
Springer-Verlag Berlin Heidelberg, Lecture Notes, New York, Discrete Algorithms, Theory of Computing, Discrete Math, Springer Verlag, Journal of Algorithms, Artificial Intelligence, Cambridge University Press, Discrete Applied Mathematics, Journal of Computing, Annual Symposium, Computer Society, Discrete Comput, The Netherlands, University of Sydney, Academic Press, Annual European Symposium, Approximate Distance Oracles Revisited, Computer-Aided Design, Department of Mathematics, International Workshop, Kluwer Academic Publishers, Memory-Efficient Bounded Concurrent Timestamping Algorithm
New!
Books on Related Topics |
Concordance
|
Text Stats
Browse Sample Pages:
Front Cover |
Table of Contents |
First Pages |
Index |
Back Cover |
Surprise Me!