What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Artificial intelligence
Lars Arge focuses on Algorithm, Data structure, Auxiliary memory, Tree and Theoretical computer science.
His Algorithm study integrates concerns from other disciplines, such as Scalability and Search engine indexing.
His biological study spans a wide range of topics, including Interval tree and Priority queue.
In his study, Lars Arge carries out multidisciplinary Auxiliary memory and Discrete mathematics research.
His research integrates issues of Asymptotically optimal algorithm and Combinatorics in his study of Tree.
His Theoretical computer science research includes themes of Cache-oblivious algorithm and Cache.
His most cited work include:
- The Influence of Late Quaternary Climate-Change Velocity on Species Endemism (483 citations)
- Indexing moving points (229 citations)
- Scalable Sweeping-Based Spatial Join (172 citations)
What are the main themes of his work throughout his whole career to date?
Lars Arge mostly deals with Data structure, Algorithm, Combinatorics, Auxiliary memory and Theoretical computer science.
His Data structure study combines topics from a wide range of disciplines, such as Rectangle, Computational geometry, Set and Linear space.
His work deals with themes such as Binary logarithm, Point and Search engine indexing, which intersect with Set.
His Range query, Segment tree and Tree study in the realm of Algorithm connects with subjects such as Internal memory.
His Combinatorics research is multidisciplinary, relying on both Discrete mathematics and Cache-oblivious algorithm.
Lars Arge has included themes like Planar and Spatial analysis in his Theoretical computer science study.
He most often published in these fields:
- Data structure (33.51%)
- Algorithm (28.11%)
- Combinatorics (27.03%)
What were the highlights of his more recent work (between 2010-2020)?
- Combinatorics (27.03%)
- Auxiliary memory (25.41%)
- Data structure (33.51%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Auxiliary memory, Data structure, Set and Vegetation.
His study in the field of Binary logarithm is also linked to topics like Structure, Block size and Web of science.
Lars Arge integrates many fields in his works, including Auxiliary memory, Parallel computing, Sorting, Internal memory, Algorithm and Resolution.
His biological study spans a wide range of topics, including Window, Path and Terrain.
The Data structure study which covers Shortest path problem that intersects with Representation and Amortized analysis.
His Set research integrates issues from Class, Rectangle, Computational geometry, Range and Point.
Between 2010 and 2020, his most popular works were:
- The Influence of Late Quaternary Climate-Change Velocity on Species Endemism (483 citations)
- Residential green space in childhood is associated with lower risk of psychiatric disorders from adolescence into adulthood (137 citations)
- Topography as a driver of local terrestrial vascular plant diversity patterns (99 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Artificial intelligence
His primary areas of study are Vegetation, Ecology, Socioeconomic status, Combinatorics and Biodiversity.
The Ecology study combines topics in areas such as Physical geography, Extinction and Water content.
Auxiliary memory, Block size and Dynamic range are fields of study that intersect with his Combinatorics study.
His work in Auxiliary memory incorporates the disciplines of Algorithm, Time complexity, Topological sorting, Dynamic array and Internal memory.
His Biodiversity research is multidisciplinary, incorporating elements of Hydrology, Wetland, Landscape ecology and Digital elevation model.
His studies in Climate change integrate themes in fields like Biological dispersal and Endemism.
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.
