基本信息
浏览量:97
职业迁徙
个人简介
rofessor Buss works in the field of computational complexity, which considers the fundamental nature and limitations of computation. Computational complexity treats computation in mathematical terms; rather than using computers to do mathematical calculations, it uses mathematical analysis to understand computation. In the long term, a better understanding of the fundamental properties of computation leads to better use of existing computers and better design of new ones.
Some computational problems require too much time to be feasible. Ideally, the computation time should be roughly proportional to the amount of input data that must be used in the calculation. In some cases, however, no possible computation can obtain the answer for the given data so quickly. While the precise boundary between feasible and infeasible problems depends on the particular computer in use, some problems can be shown to be infeasible for any envisionable computer.
One focus of Professor Buss's work is to characterize what properties of a problem make it amenable to solution and what properties make a problem impossible to solve quickly. These characterizations include (1) costly searches that can be avoided, (2) independence of parts, so that the solution can be computed in parallel, and (3) alternative formulations that are more amenable to solution.
In addition to abstract work, Professor Buss has applied techniques of computational complexity to problems from parallel processing (minimizing the impact of processor failures), scientific computing (mesh generation), and the solution of algebraic equations.
研究兴趣
论文共 28 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
ACM SIGACT Newsno. 1 (2008): 33-46
Theory of Computing Systemsno. 3 (2007): 445-457
Therese Biedl,Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammadtaghi Hajiaghayi, Tomáš Vinař
THEORETICAL COMPUTER SCIENCEno. 1 (2003): 475-480
Theory of Computing Systemsno. 2 (1998): 187-214
SIAM JOURNAL ON COMPUTINGno. 5 (1998): 27-33
Emulations and embeddings of meshes of trees and hypercubes of cliques (1996)
引用23浏览0EI引用
23
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn