What is recorded here?
Gave a deterministic logarithmic-space algorithm for undirected graph connectivity, establishing the equality of deterministic and symmetric logarithmic space for this problem class.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The record is the sole-author 2008 Journal of the ACM article. The 2005 conference version, randomized log-space algorithms, directed reachability and later graph-canonization results remain separate.
Read the original work
- JACM DOI record for undirected connectivity in log-space
- ACM SIGLOG bibliography for Reingold connectivity paper
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Omer Reingold
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: Israel
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Reingold: undirected connectivity in logarithmic space
Gave a deterministic logarithmic-space algorithm for undirected graph connectivity, establishing the equality of deterministic and symmetric logarithmic space for this problem class.
Scientific scope
The record is the sole-author 2008 Journal of the ACM article. The 2005 conference version, randomized log-space algorithms, directed reachability and later graph-canonization results remain separate.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Omer Reingold
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.