Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains-Reference-Cited by-同舟云学术

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

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

Published:1998-08 Issue:2 Volume:28 Page:197-215
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Berkman Omer,Matias Yossi,Ragde Prabhakar

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference38 articles.

1. Efficient pattern matching with scaling;Amir,1990

2. Optimal bounds for decision problems on the CRCW PRAM;Beame,1987

3. Graphs and Hypergraphs;Berge,1973

4. O. Berkman, Paradigms for Very Fast Parallel Algorithms, Tel Aviv University, 1991

5. Top-bottom routing around a rectangle is as easy as computing prefix minima;Berkman;SIAM J. Comput.,1994

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

1. Optimized Line-of-Sight Assessment Algorithm for 5G mmW Network Design using LiDAR Information;Proceedings of the 18th International Conference on Wireless Networks and Mobile Systems;2021

2. Improved bounds for the sunflower lemma;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

3. All Nearest Smallers Made Simple;Parallel Processing Letters;2020-06

4. Algorithms for testing occurrences of length 4 patterns in permutations;Journal of Combinatorial Optimization;2017-08-09

5. Parallel Algorithms for Testing Length Four Permutations;2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming;2014-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP