- Home
- Best Scientists - Computer Science
- Peter Widmayer

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
33
Citations
7,732
145
World Ranking
6591
National Ranking
137

1997 - ACM Fellow For original contributions in data structures and algorithms advancing the areas of geometric and combinatorial computation and spatial databases.

- Algorithm
- Artificial intelligence
- Operating system

Peter Widmayer mainly investigates Combinatorics, Theoretical computer science, Mobile robot, Distributed computing and Range query. His Combinatorics research is multidisciplinary, relying on both Discrete mathematics and Theory of computation. His study looks at the intersection of Theoretical computer science and topics like Search tree with Tree structure.

The concepts of his Distributed computing study are interwoven with issues in Computability, Robotics and Complete graph. His Range query study integrates concerns from other disciplines, such as Structure, Gray code, Spatial analysis and Data structure. His Data mining study combines topics from a wide range of disciplines, such as Expression, Software development and Database.

- Genevestigator v3: a reference expression database for the meta-analysis of transcriptomes. (1475 citations)
- An asymptotically optimal multiversion B-tree (357 citations)
- Gathering of asynchronous robots with limited visibility (332 citations)

Peter Widmayer mostly deals with Combinatorics, Theoretical computer science, Algorithm, Discrete mathematics and Time complexity. His Combinatorics course of study focuses on Set and Simple. His research in Theoretical computer science intersects with topics in Robot, Spatial analysis and Data structure.

His research integrates issues of Range query and Message passing in his study of Data structure. His biological study spans a wide range of topics, including Upper and lower bounds and Mathematical optimization. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Competitive analysis and Robustness.

- Combinatorics (28.27%)
- Theoretical computer science (14.35%)
- Algorithm (14.35%)

- Combinatorics (28.27%)
- Discrete mathematics (13.08%)
- Algorithm (14.35%)

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Algorithm, Graph and Mathematical optimization. Peter Widmayer interconnects Polygon covering and Simple polygon in the investigation of issues within Combinatorics. His study in Simple polygon is interdisciplinary in nature, drawing from both Exact geometry and Mobile robot.

His studies deal with areas such as Theory of computation and Maximization as well as Discrete mathematics. His Algorithm research incorporates elements of Theoretical computer science, Heuristics and Query optimization. His work deals with themes such as Energy constrained, Energy and Probability distribution, which intersect with Mathematical optimization.

- Mathematical Foundations of Computer Science 2012 (38 citations)
- Data Delivery by Energy-Constrained Mobile Agents (27 citations)
- Data Delivery by Energy-Constrained Mobile Agents on a Line (21 citations)

- Algorithm
- Artificial intelligence
- Operating system

His primary scientific interests are in Combinatorics, Mathematical optimization, Visibility graph, Discrete mathematics and Visibility polygon. His Combinatorics study combines topics in areas such as Graph center, Path graph and Wheel graph. His Mathematical optimization research includes elements of Data delivery, Probability distribution and Energy constrained, Energy.

His Energy research incorporates themes from Point and Schedule. He has researched Discrete mathematics in several fields, including Scheme, Approximation algorithm, Directed acyclic graph, Theory of computation and Floyd–Warshall algorithm. The various areas that Peter Widmayer examines in his Visibility polygon study include Point in polygon, Robot and Equiangular polygon.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Genevestigator v3: a reference expression database for the meta-analysis of transcriptomes.

Tomas Hruz;Oliver Laule;Gabor Szabo;Frans Wessendorp.

Advances in Bioinformatics **(2008)**

1852 Citations

An asymptotically optimal multiversion B-tree

Bruno Becker;Stephan Gschwind;Thomas Ohler;Bernhard Seeger.

very large data bases **(1996)**

487 Citations

Gathering of asynchronous robots with limited visibility

Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer.

Theoretical Computer Science **(2005)**

374 Citations

The LSD tree: spatial access to multidimensional and non-point objects

A. Henrich;H. W. Six;P. Widmayer.

very large data bases **(1989)**

308 Citations

Towards an analysis of range query performance in spatial data structures

Bernd-Uwe Pagel;Hans-Werner Six;Heinrich Toben;Peter Widmayer.

symposium on principles of database systems **(1993)**

303 Citations

Space-filling curves and their use in the design of geometric data structures

Tetsuo Asano;Desh Ranjan;Thomas Roos;Emo Welzl.

Theoretical Computer Science **(1997)**

280 Citations

Beyond Steiner's Problem: A VLSI Oriented Generalization

Gabriele Reich;Peter Widmayer.

workshop on graph theoretic concepts in computer science **(1989)**

203 Citations

Time is not a healer

Nicola Santoro;Nicola Santoro;Peter Widmayer.

symposium on theoretical aspects of computer science **(1989)**

202 Citations

Arbitrary pattern formation by asynchronous, anonymous, oblivious robots

Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer.

Theoretical Computer Science **(2008)**

202 Citations

NovoHMM: a hidden Markov model for de novo peptide sequencing

Bernd Fischer;Volker Roth;Franz Roos;Jonas Grossmann.

Analytical Chemistry **(2005)**

198 Citations

Carleton University

ETH Zurich

University of Leicester

University of Ottawa

Philipp University of Marburg

University of Zurich

ETH Zurich

ETH Zurich

University of California, Santa Barbara

Kiel University

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.