Space-time tradeoffs for graph properties

Yevgeniy Dodis, Sanjeev Khanna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time tra- deoffs have been studied in this model under the assumption that the preprocessing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tigh- Ter space-time tradeoffs for various natural settings of F. The extreme settings of our model reduce to the classical cell probe and generalized decision tree complexities. We use graph properties for the purpose of illustrating various aspects of our model across this broad spectrum. In doing so, we develop new lower bound techniques and strengthen some existing results. In particular, we obtain near-optimal space-time tradeoffs for various natural choices of F; strengthen the Rivest-Vuillemin proof of the famous AKR conjecture to show that no non-trivial monotone graph property can be expressed as a polynomial of sub-quadratic degree; and obtain new results on the generalized decision tree complexity w.r.t. various families F.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings
PublisherSpringer Verlag
Pages291-300
Number of pages10
Volume1644 LNCS
ISBN (Print)3540662243, 9783540662242
StatePublished - 1999
Event26th International Colloquium on Automata, Languages and Programming, ICALP 1999 - Prague, Czech Republic
Duration: Jul 11 1999Jul 15 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1644 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other26th International Colloquium on Automata, Languages and Programming, ICALP 1999
CountryCzech Republic
CityPrague
Period7/11/997/15/99

Fingerprint

Trade-offs
Space-time
Preprocessing
Graph in graph theory
Decision tree
Decision trees
Probe
Model
Cell
Computational Model
Upper and Lower Bounds
Monotone
Extremes
Lower bound
Polynomials
Polynomial
Family

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dodis, Y., & Khanna, S. (1999). Space-time tradeoffs for graph properties. In Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings (Vol. 1644 LNCS, pp. 291-300). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1644 LNCS). Springer Verlag.

Space-time tradeoffs for graph properties. / Dodis, Yevgeniy; Khanna, Sanjeev.

Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Vol. 1644 LNCS Springer Verlag, 1999. p. 291-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1644 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y & Khanna, S 1999, Space-time tradeoffs for graph properties. in Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. vol. 1644 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1644 LNCS, Springer Verlag, pp. 291-300, 26th International Colloquium on Automata, Languages and Programming, ICALP 1999, Prague, Czech Republic, 7/11/99.
Dodis Y, Khanna S. Space-time tradeoffs for graph properties. In Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Vol. 1644 LNCS. Springer Verlag. 1999. p. 291-300. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Dodis, Yevgeniy ; Khanna, Sanjeev. / Space-time tradeoffs for graph properties. Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Vol. 1644 LNCS Springer Verlag, 1999. pp. 291-300 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{07c76c4004094f58b3317b91cfeeab50,
title = "Space-time tradeoffs for graph properties",
abstract = "We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time tra- deoffs have been studied in this model under the assumption that the preprocessing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tigh- Ter space-time tradeoffs for various natural settings of F. The extreme settings of our model reduce to the classical cell probe and generalized decision tree complexities. We use graph properties for the purpose of illustrating various aspects of our model across this broad spectrum. In doing so, we develop new lower bound techniques and strengthen some existing results. In particular, we obtain near-optimal space-time tradeoffs for various natural choices of F; strengthen the Rivest-Vuillemin proof of the famous AKR conjecture to show that no non-trivial monotone graph property can be expressed as a polynomial of sub-quadratic degree; and obtain new results on the generalized decision tree complexity w.r.t. various families F.",
author = "Yevgeniy Dodis and Sanjeev Khanna",
year = "1999",
language = "English (US)",
isbn = "3540662243",
volume = "1644 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "291--300",
booktitle = "Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings",

}

TY - GEN

T1 - Space-time tradeoffs for graph properties

AU - Dodis, Yevgeniy

AU - Khanna, Sanjeev

PY - 1999

Y1 - 1999

N2 - We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time tra- deoffs have been studied in this model under the assumption that the preprocessing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tigh- Ter space-time tradeoffs for various natural settings of F. The extreme settings of our model reduce to the classical cell probe and generalized decision tree complexities. We use graph properties for the purpose of illustrating various aspects of our model across this broad spectrum. In doing so, we develop new lower bound techniques and strengthen some existing results. In particular, we obtain near-optimal space-time tradeoffs for various natural choices of F; strengthen the Rivest-Vuillemin proof of the famous AKR conjecture to show that no non-trivial monotone graph property can be expressed as a polynomial of sub-quadratic degree; and obtain new results on the generalized decision tree complexity w.r.t. various families F.

AB - We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing power. Classically, space-time tra- deoffs have been studied in this model under the assumption that the preprocessing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tigh- Ter space-time tradeoffs for various natural settings of F. The extreme settings of our model reduce to the classical cell probe and generalized decision tree complexities. We use graph properties for the purpose of illustrating various aspects of our model across this broad spectrum. In doing so, we develop new lower bound techniques and strengthen some existing results. In particular, we obtain near-optimal space-time tradeoffs for various natural choices of F; strengthen the Rivest-Vuillemin proof of the famous AKR conjecture to show that no non-trivial monotone graph property can be expressed as a polynomial of sub-quadratic degree; and obtain new results on the generalized decision tree complexity w.r.t. various families F.

UR - http://www.scopus.com/inward/record.url?scp=84887490720&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887490720&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84887490720

SN - 3540662243

SN - 9783540662242

VL - 1644 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 291

EP - 300

BT - Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings

PB - Springer Verlag

ER -