computer science

Peter Sanders (computer scientist)

Peter Sanders (computer scientist) is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Peter Sanders (computer scientist) rather than just read about it. In short: 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 and finding shortest paths in road networks.

Key takeaways

Peter Sanders (computer scientist) belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Peter Sanders (computer scientist) to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Peter Sanders (computer scientist) from memory before moving on to harder problems.

Reference excerpt

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 and 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.

Selected publications Books Mehlhorn, Kurt; Sanders, Peter (2008). Algorithms and Data Structures: The Basic Toolbox. Springer. ISBN 978-3-540-77977-3. MR 2444537. Research papers Sanders, Peter; Egner, Sebastian; Tolhuizen, Ludo (2003), "Polynomial Time Algorithms for Network Information Flow", Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03), New York, NY, USA: ACM, pp. 286–294, CiteSeerX 10.1.1.391.4104, doi:10.1145/777412.777464, ISBN 978-1581136616, S2CID 5507219 {{citation}}: Cite uses deprecated parameter |citeseerx= (help). Jaggi, S.; Sanders, P.; Chou, P. A.; Effros, M.; Egner, S.; Jain, K.; Tolhuizen, L. M.G.M. (2005), "Polynomial Time Algorithms for Multicast Network Code Construction", IEEE Trans. Inf. Theory, 51 (6): 1973–1982, Bibcode:2005ITIT...51.1973J, CiteSeerX 10.1.1.705.2444, doi:10.1109/TIT.2005.847712, S2CID 16817401 {{citation}}: Cite uses deprecated parameter |citeseerx= (help). Kärkkäinen, Juha; Sanders, Peter; Burkhardt, Stefan (November 2006), "Linear Work Suffix Array Construction", Journal of the ACM, 53 (6): 918–936, doi:10.1145/1217856.1217858, S2CID 12825385. Geisberger, Robert; Sanders, Peter; Schultes, Dominik; Delling, Daniel (2008), "Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks", Experimental Algorithms, Lecture Notes in Computer Science, vol. 5038, Berlin, Heidelberg: Springer-Verlag, pp. 319–333, doi:10.1007/978-3-540-68552-4_24, ISBN 978-3-540-68548-7, S2CID 777101.

References

External links Google scholar profile Peter Sanders at the Mathematics Genealogy Project

Worked examples

Example 1 — a first encounter with Peter Sanders (computer scientist)

Start with the simplest possible case. Write down what Peter Sanders (computer scientist) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Peter Sanders (computer scientist) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Peter Sanders (computer scientist) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Peter Sanders (computer scientist)

In research: Peter Sanders (computer scientist) appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Peter Sanders (computer scientist) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Peter Sanders (computer scientist) is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1967 births, Academic staff of the Karlsruhe Institute of Technology, German computer scientists, so understanding it makes those chapters shorter.
In everyday life: Look for Peter Sanders (computer scientist) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Peter Sanders (computer scientist)” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Peter Sanders (computer scientist) in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Peter Sanders (computer scientist) means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Peter Sanders (computer scientist) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Peter Sanders (computer scientist) in simple terms?

Why does Peter Sanders (computer scientist) matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Peter Sanders (computer scientist)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Peter Sanders (computer scientist).