Reachability and the power of local ordering-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Reachability and the power of local ordering

Published:1995-09 Issue:2 Volume:148 Page:261-279
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Etessami Kousha,Immerman Neil

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Reachability is harder for directed than for undirected graphs;Ajtai;J. Symbolic Logic,1990

2. Random walks, universal traversal sequences, and the complexity of the maze problem;Aleliunas,1979

3. Time-space tradeoffs for undirected graph traversal;Beame,1990

4. On the power of the compass;Blum,1978

5. On the capability of finite automata in 2 and 3 dimensional space;Blum,1977

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pattern logics and auxiliary relations;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14

2. Pure pointer programs with iteration;ACM Transactions on Computational Logic;2010-07

3. Pointer Programs and Undirected Reachability;2009 24th Annual IEEE Symposium on Logic In Computer Science;2009-08

4. Monadic Second-Order Logic and Transitive Closure Logics Over Trees;Research on Language and Computation;2009-02-24

5. Approximate formulae for a logic that capture classes of computational complexity;Logic Journal of IGPL;2008-11-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP