|
Peter Sanders (computer Scientist)
Peter Sanders (born 1967) is a German computer scientist who works as a professor of computer science at the Karlsruhe Institute of Technology. His research concerns the design, analysis, and implementation of algorithms and data structures, and he is particularly known for his research on suffix sorting finding shortest paths in road networks. Sanders earned his Ph.D. from Karlsruhe in 1996, and worked for seven years at the Max Planck Institute for Informatics in Saarbrücken (completing his habilitation there in 2000) before returning to Karlsruhe as a professor in 2004. Sanders was one of the winners of the Gottfried Wilhelm Leibniz Prize in 2012.Prof. Dr. Peter Sanders – Gottfried Wilhelm Leibniz-Preisträger 2012 |
Karlsruhe Institute Of Technology
The Karlsruhe Institute of Technology (KIT; german: Karlsruher Institut für Technologie) is a public research university in Karlsruhe, Germany. The institute is a national research center of the Helmholtz Association. KIT was created in 2009 when the University of Karlsruhe (), founded in 1825 as a public research university and also known as the "Fridericiana", merged with the Karlsruhe Research Center (), which had originally been established in 1956 as a national nuclear research center (, or KfK). KIT is a member of the TU9, an incorporated society of the largest and most notable German institutes of technology.TU9 As part of the German Universities Excellence Initiative KIT was one of three universities which were awarded excellence status in 2006. In the following "German Excellence Strategy" KIT was awarded as one of eleven "Excellence Universities" in 2019. KIT is among the leading technical universities in Germany and Europe. According to different bibliometric ranking ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Data Structure
In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. Usage Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type. Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers. Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Suffix Array
In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compression algorithms, and the field of bibliometrics. Suffix arrays were introduced by as a simple, space efficient alternative to suffix trees. They had independently been discovered by Gaston Gonnet in 1987 under the name ''PAT array'' . gave the first in-place \mathcal(n) time suffix array construction algorithm that is optimal both in time and space, where ''in-place'' means that the algorithm only needs \mathcal(1) additional space beyond the input string and the output suffix array. Enhanced suffix arrays (ESAs) are suffix arrays with additional tables that reproduce the full functionality of suffix trees preserving the same time and memory complexity. The suffix array for a subset of all suffixes of a string is called sparse suffix array. Multiple probabilistic algorithms have been developed to minimize the additiona ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shortest Path
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment. Definition The shortest path problem can be defined for graphs whether undirected, directed, or mixed. It is defined here for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge. Two vertices are adjacent when they are both incident to a common edge. A path in an undirected graph is a sequence of vertices P = ( v_1, v_2, \ldots, v_n ) \in V \times V \times \cdots \times V such that v_i is adjacent to v_ for 1 \leq i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Road Network
A street network is a system of interconnecting lines and points (called ''edges'' and ''nodes'' in network science) that represent a system of streets or roads for a given area. A street network provides the foundation for network analysis; for example, finding the best route or creating service areas.Wade, T. and Sommer, S. eds. A to Z GIS' They greatly affect in-town movement and traffic. Street networks can become very complex in cities. Street networks are very often localized, because there is little non-highway transportation from town to town. The U.S. Highway System is like a street network, but it is national, and consists of highways instead of streets and roads. See also * Braess's paradox * Transport network * International E-road network * Inca road system * Traffic analysis ** Traffic flow ** Permeability * Grid plan * List of cities that are inaccessible by road References {{Authority control Network Network, networking and networked may refer to: Science an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Max Planck Institute For Informatics
The Max Planck Institute for Informatics (German: ''Max-Planck-Institut für Informatik'', abbreviated ''MPI-INF'' or ''MPII'') is a research institute in computer science with a focus on algorithms and their applications in a broad sense. It hosts fundamental research (algorithms and complexity, programming logics) as well a research for various application domains (computer graphics, geometric computation, constraint solving, computational biology). It is part of the Max-Planck-Gesellschaft, Germany's largest publicly funded body for foundation research. Research departments As of early 2018 the institute had five directors, called scientific members. These are: * Kurt Mehlhorn - algorithms and complexity department * Bernt Schiele - computer vision and multimodal computing department * Thomas Lengauer - computational biology and applied algorithmics department * Anja Feldmann - Internet architecture department * Hans-Peter Seidel - computer graphics department * Gerhard W ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Saarbrücken
Saarbrücken (; french: link=no, Sarrebruck ; Rhine Franconian: ''Saarbrigge'' ; lb, Saarbrécken ; lat, Saravipons, lit=The Bridge(s) across the Saar river) is the capital and largest city of the state of Saarland, Germany. Saarbrücken is Saarland's administrative, commercial and cultural centre and is next to the French border. The modern city of Saarbrücken was created in 1909 by the merger of three towns, Saarbrücken, St. Johann, and Malstatt-Burbach. It was the industrial and transport centre of the Saar coal basin. Products included iron and steel, sugar, beer, pottery, optical instruments, machinery, and construction materials. Historic landmarks in the city include the stone bridge across the Saar (1546), the Gothic church of St. Arnual, the 18th-century Saarbrücken Castle, and the old part of the town, the ''Sankt Johanner Markt'' (Market of St. Johann). In the 20th century, Saarbrücken was twice separated from Germany: from 1920 to 1935 as capit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Habilitation
Habilitation is the highest university degree, or the procedure by which it is achieved, in many European countries. The candidate fulfills a university's set criteria of excellence in research, teaching and further education, usually including a dissertation. The degree, abbreviated "Dr. habil." (Doctor habilitatus) or "PD" (for "Privatdozent"), is a qualification for professorship in those countries. The conferral is usually accompanied by a lecture to a colloquium as well as a public inaugural lecture. History and etymology The term ''habilitation'' is derived from the Medieval Latin , meaning "to make suitable, to fit", from Classical Latin "fit, proper, skillful". The degree developed in Germany in the seventeenth century (). Initially, habilitation was synonymous with "doctoral qualification". The term became synonymous with "post-doctoral qualification" in Germany in the 19th century "when holding a doctorate seemed no longer sufficient to guarantee a proficient transfer o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gottfried Wilhelm Leibniz Prize
The Gottfried Wilhelm Leibniz Prize (german: link=no, Förderpreis für deutsche Wissenschaftler im Gottfried Wilhelm Leibniz-Programm der Deutschen Forschungsgemeinschaft), in short Leibniz Prize, is awarded by the German Research Foundation to "exceptional scientists and academics for their outstanding achievements in the field of research". Since 1986, up to ten prizes are awarded annually to individuals or research groups working at a research institution in Germany or at a German research institution abroad. It is considered the most important research award in Germany. The prize is named after the German polymath and philosopher Gottfried Wilhelm Leibniz (1646–1716). It is one of the highest endowed research prizes in Germany with a maximum of €2.5 million per award. Past prize winners include Stefan Hell (2008), Gerd Faltings (1996), Peter Gruss (1994), Svante Pääbo (1992), Theodor W. Hänsch (1989), Erwin Neher (1987), Bert Sakmann (1987), Jürgen Habermas (1986), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deutsche Forschungsgemeinschaft
The German Research Foundation (german: Deutsche Forschungsgemeinschaft ; DFG ) is a German research funding organization, which functions as a self-governing institution for the promotion of science and research in the Federal Republic of Germany. In 2019, the DFG had a funding budget of €3.3 billion. Function The DFG supports research in science, engineering, and the humanities through a variety of grant programmes, research prizes, and by funding infrastructure. The self-governed organization is based in Bonn and financed by the German states and the federal government of Germany. As of 2017, the organization consists of approximately 100 research universities and other research institutions. The DFG endows various research prizes, including the Leibniz Prize. The Polish-German science award Copernicus Award, Copernicus is offered jointly with the Foundation for Polish Science. According to a 2017 article in ''The Guardian'', the DFG has announced it will publish its re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of The ACM
The ''Journal of the ACM'' is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is Venkatesan Guruswami. The journal was established in 1954 and "computer scientists universally hold the ''Journal of the ACM'' in high esteem". See also * ''Communications of the ACM ''Communications of the ACM'' is the monthly journal of the Association for Computing Machinery (ACM). It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are intended for readers with ...'' References External links * Publications established in 1954 Computer science journals Association for Computing Machinery academic journals Bimonthly journals English-language journals {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
