Computational Geometry Column 66-Reference-Cited by-同舟云学术

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

Computational Geometry Column 66

Published:2017-12-13 Issue:4 Volume:48 Page:57-74
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Elbassioni Khaled¹,Dumitrescu Adrian²

Affiliation:

1. Masdar Institute, Khalifa University of Science and Technology Abu Dhabi, UAE.

2. University of Wisconsin, Milwaukee, USA.

Abstract

The list update problem is a well studied online problem in the area of self-adjusting data structures. Understanding the o?ine version of this problem is crucial because of the role it plays in the competitive analysis of online list update algorithms. In this paper we settle a long-standing open problem by showing that the o?ine list update problem is NP-hard.

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3173127.3173138

Reference111 articles.

1. A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio

2. Improved Complexity for Maximum Volume Inscribed Ellipsoids

3. How good are convex hull algorithms?

4. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

5. Reverse search for enumeration

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP