Edsger W. Dijkstra was a prominent Dutch computer scientist, widely regarded for his contributions to the fields of computer programming, algorithms, and software engineering. Born on May 11, 1930, and passing away on August 6, 2002, Dijkstra is best known for several key concepts and innovations in computing.
Edward G. Coffman Jr. is an American historian known for his work on military history, particularly relating to the United States in World War II and the post-war era. He has authored several books and articles on military subjects and has contributed to our understanding of American military policy, strategy, and the social implications of war.
Ferdinand Peper is not a widely recognized figure or term in mainstream historical, scientific, or cultural contexts as of my last update in October 2023. It’s possible that the name could refer to a private individual or a lesser-known figure, or it might be a typo or a misinterpretation of another name or term.
Hans Hermes is a well-known figure associated with logistics and supply chain management. He is the founder of Hermes Group, a leading logistics service provider in Europe, particularly recognized for its parcel delivery and e-commerce solutions. The Hermes Group was established in Germany and has expanded its services to various other countries. They are known for their roles in last-mile delivery, particularly in the growing e-commerce sector, where efficient and reliable delivery services are increasingly essential.
Jin-Yi Cai is a prominent computer scientist known for his contributions to computational complexity theory, particularly in relation to the field of parameterized complexity and graph algorithms. His work often focuses on the foundations of parameterized computation, which deals with issues related to the tractability of algorithms depending on certain parameters of the input rather than the size of the input itself.
Kazuo Iwama is a prominent computer scientist known for his contributions in the fields of theoretical computer science, particularly in algorithms, complexity theory, and information technology. He has also made significant contributions to the study of quantum computing and combinatorial optimization. Iwama's research has often focused on the design and analysis of algorithms, including those related to graph theory, scheduling, and computational complexity.
Lance Fortnow is a computer scientist known for his work in computational complexity theory, a branch of theoretical computer science that focuses on the resources required to solve computational problems. He has made significant contributions to understanding the limits of computation and has explored topics such as the P vs NP problem, which is one of the most important open questions in computer science. In addition to his research, Fortnow has been involved in educating and mentoring students and has held academic positions at various institutions.
Maarten van Emden is a Dutch politician and member of the People's Party for Freedom and Democracy (Volkspartij voor Vrijheid en Democratie, VVD). He has served in various capacities within the party and has been involved in Dutch politics, particularly focusing on issues related to socio-economic policy, public administration, and digitalization.
Madhu Sudan is likely referring to a prominent Indian computer scientist known for his contributions to theoretical computer science, particularly in the areas of coding theory, complexity theory, and algorithms. He is recognized for his work on error-correcting codes, particularly the development of probabilistically checkable proofs (PCP), which has had a significant impact on computational complexity.
Mary Wootters is a multi-disciplinary artist and educator based in New York City. She is known for her work in various mediums, including sculpture, painting, and installation art. Her practice often explores themes such as identity, memory, and the human experience, frequently utilizing found objects and unconventional materials to challenge traditional artistic boundaries. In addition to her artistic work, Wootters has been involved in teaching and mentoring emerging artists, sharing her expertise and fostering creativity in others.
Michael Sipser is a prominent computer scientist and educator, known primarily for his contributions to the fields of theoretical computer science and complexity theory. He is the author of the widely used textbook "Introduction to the Theory of Computation," which covers topics such as formal languages, automata theory, computability, and complexity theory. Sipser has held various academic positions, including serving as a professor at the Massachusetts Institute of Technology (MIT).
Michael W. Shields could refer to several individuals, as it's not a unique name, but one notable person is an academic known for his work in economics, particularly in the field of health economics and education economics. He has contributed to various studies and published research in those areas. If you were referring to a different Michael W. Shields or need specific information about a certain context, please provide more details!
Nachum Dershowitz is an acclaimed mathematician and computer scientist known for his work in various fields, including theoretical computer science and mathematics. He has made significant contributions to topics such as algorithms, computational complexity, and the foundations of mathematics. Additionally, he has authored or co-authored numerous papers and may have developed influential theories or models in his areas of expertise.
Nick Pippenger is a notable figure in the field of computer science, particularly known for his contributions to algorithms and the theory of computation. He is recognized for his work on topics such as circuit complexity and the development of efficient algorithms. One of his significant contributions includes the Pippenger–Beame–Hennessy theorem, which addresses time-space trade-offs in computational complexity.
Noam Nisan is a prominent computer scientist known for his contributions to various fields within theoretical computer science, economics, and game theory. He is particularly recognized for his work on algorithmic game theory, which combines ideas from computer science and economics to understand strategic interactions in computational settings. Nisan has authored and co-authored numerous influential papers and has been involved in the development of concepts such as mechanism design and auctions within this interdisciplinary framework.
As of my last knowledge update in October 2023, Patricia Bouyer-Decitre is a French mathematician known for her work in the fields of mathematical analysis and partial differential equations. She has contributed to various areas, including mathematical modeling and numerical analysis. Additionally, she is recognized for her involvement in promoting mathematics and science education.
Ran Libeskind-Hadas is a prominent computer scientist and educator, known primarily for his work in the field of computer science education, algorithms, and data structures. He often focuses on innovative teaching methods and curriculum development to enhance learning experiences. Libeskind-Hadas has contributed to various research areas, and his work often includes interdisciplinary approaches to problem-solving in computer science. His dedication to education has made him a notable figure in discussions on how to effectively teach complex concepts in a clear and engaging manner.
Ray Solomonoff (1934–2018) was an American scientist and a pioneer in the fields of algorithmic information theory and artificial intelligence. He is best known for developing the theory of algorithmic probability, which is a formal approach to the concept of randomness and information content.
Richard Lipton is a prominent computer scientist known for his contributions to theoretical computer science, particularly in the areas of algorithms, complexity theory, and cryptography. He is a professor at the Georgia Institute of Technology and has authored numerous research papers and publications in his field. Lipton is also known for his work on the P vs NP problem, a fundamental question in computer science that addresses the relationship between problems that can be solved quickly (in polynomial time) and those for which solutions can be verified quickly.
Wilfried Brauer is a notable figure in the field of applied mathematics and computer science, particularly known for his work in the areas of numerical methods, mathematical modeling, and the development of algorithms. He has contributed to the study of various mathematical problems and is often recognized for his impact on both academic research and practical applications.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact