ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
3
views
13
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,218
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Deterministic Constructions of Approximate Distance Oracles and Spanners
other
Author(s):
Liam Roditty
,
Mikkel Thorup
,
Uri Zwick
Publication date
(Print):
2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
2021 Research and Innovation Open Distance and eLearning Virtual Conference
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
Fibonacci heaps and their uses in improved network optimization algorithms
Michael Fredman
,
Robert Tarjan
(1987)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
The Probabilistic Method
Noga Alon
,
Joel Spencer
(2000)
0
comments
Cited
124
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Storing a Sparse Table with 0(1) Worst Case Access Time
Michael Fredman
,
János Komlós
,
Endre Szemerédi
(1984)
0
comments
Cited
91
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 261-272
DOI:
10.1007/11523468_22
SO-VID:
8d914738-3165-4115-975d-21f68083f552
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 16
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
pp. 791
Boneh-Franklin Identity Based Encryption Revisited
pp. 956
Approximating Max kCSP – Outperforming a Random Assignment with Almost a Linear Factor
pp. 153
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
pp. 191
Measure and Conquer: Domination – A Case Study
pp. 249
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
pp. 261
Deterministic Constructions of Approximate Distance Oracles and Spanners
pp. 347
On the Wake-Up Problem in Radio Networks
pp. 513
Weighted Automata and Weighted Logics
pp. 589
Simulated Annealing Beats Metropolis in Combinatorial Optimization
pp. 627
Reordering Buffer Management for Non-uniform Cost Models
pp. 677
On the Cover Time of Random Geometric Graphs
pp. 779
Completely Non-malleable Schemes
pp. 803
Single-Database Private Information Retrieval with Constant Communication Rate
pp. 878
The Complexity of Stochastic Rabin and Streett Games
pp. 1018
An Accessible Approach to Behavioural Pseudometrics
pp. 1043
A Better Approximation Ratio for the Vertex Cover Problem
pp. 1089
Decidability and Complexity Results for Timed Automata via Channel Machines
pp. 1102
Congruences for Visibly Pushdown Languages
pp. 1115
Approximation Algorithms for Euclidean Group TSP
pp. 1202
A Fully Abstract Encoding of the π-Calculus with Data Terms
pp. 1349
The Polyranking Principle
pp. 1450
Unsafe Grammars and Panic Automata
Similar content
2,218
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
Authors:
Jakub Pachocki
,
Liam Roditty
,
Aaron Sidford
…
Spanners of de Bruijn and Kautz graphs
Authors:
Rabah Harbane
,
Carles Padró
From the outside in: The negative spillover effects of boundary spanners' relations with members of other organizations
Authors:
Lakshmi Ramarajan
,
Katerina Bezrukova
,
Karen A. Jehn
…
See all similar
Cited by
20
Shortest-path queries in static networks
Authors:
Christian Sommer
On Dynamic Shortest Paths Problems
Authors:
Uri Zwick
,
Liam Roditty
f-Sensitivity Distance Oracles and Routing Schemes
Authors:
Michael Langberg
,
David Peleg
,
Liam Roditty
…
See all cited by