Narendra Karmarkar is an Indian mathematician and computer scientist, known for his contributions to optimization and algorithm design. He is best known for developing Karmarkar's algorithm in 1984, which is a polynomial-time algorithm for linear programming. This was a significant advancement in the field of optimization as it provided a more efficient way to solve linear programming problems compared to earlier methods like the Simplex algorithm.
Nancy Lynch is a prominent computer scientist and professor known for her work in distributed computing, algorithms, and theoretical computer science. She has made significant contributions to the field, particularly in areas such as synchronization, fault tolerance, and the theory of distributed systems. Lynch is also recognized for her work on the development of algorithms that enable reliable communication and coordination among distributed processes.
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.
Moti Yung is a prominent figure in the fields of cryptography and computer science. He is known for his contributions to various areas, including cryptographic protocols, security, and algorithm design. Moti Yung has authored numerous research papers and has been influential in advancing theoretical foundations and practical applications of cryptography. In the context of academia, he has been associated with various institutions and has played a critical role in mentoring and collaborating with other researchers in the field.
Monika Henzinger is a prominent computer scientist known for her work in theoretical computer science, algorithms, and web-search technologies. She has made significant contributions to areas such as algorithm design, graph algorithms, and the analysis of algorithms. Henzinger has held various academic positions and has been involved in research institutions and universities. Additionally, she has served in leadership roles within the academic community and has been an advocate for diversity in computer science.
Moni Naor is a prominent computer scientist, known for his contributions to various fields within cryptography and computer security. He has worked on topics including secure protocols, blockchain technology, and privacy in computing. Naor is often cited for his work on theoretical aspects of cryptography, as well as practical implementations and their implications for security systems.
Mohammad Hajiaghayi is a prominent computer scientist known for his contributions in areas such as algorithm design, computational complexity, and graph theory. He has worked on various topics, including approximation algorithms, algorithmic game theory, and network design. Hajiaghayi has published numerous research papers and has been involved in both academic and practical applications of computer science.
Miklós Ajtai is a Hungarian-born computer scientist, recognized for his contributions to theoretical computer science, particularly in the areas of computational complexity and algorithms. He is best known for his work on the Ajtai–Komlós–Szemerédi (AKS) sorting algorithm, which is notable for its probabilistic approach to sorting. Miklós Ajtai has also made significant contributions to the fields of logic and proof systems.
Mikkel Thorup is not a widely recognized public figure, so specific information about him may vary based on context.
Mikhail Atallah may refer to different individuals or contexts, as names can be common. If you're referring to a specific person or field, please provide more context. For instance, Mikhail Atallah might be related to technology, academia, or another profession.
Mike Paterson is a name that could refer to different people depending on the context. Without additional information, it's challenging to provide a specific answer. For example, Mike Paterson could be a professional in various fields such as sports, music, academia, or others. If you are referring to a specific Mike Paterson, could you please provide more details?
Mihalis Yannakakis is a prominent Greek computer scientist known for his contributions to the fields of computer science, particularly in algorithms, computational complexity, and optimization. He has made significant strides in areas such as approximation algorithms and game theory. Yannakakis is also recognized for his research on theoretical aspects of computer science and has published numerous papers in leading scientific journals. He has held academic positions at various institutions and has been influential in advancing the understanding of algorithmic processes and their applications.
Mihai Pătrașcu is a notable computer scientist known for his contributions to the fields of data structures, algorithms, and theoretical computer science. He gained prominence for his work on lower bounds in data structures, particularly in developing techniques to prove the limitations of certain data structure operations, such as searching and updating. Pătrașcu is also recognized for his research in combinatorial optimization and has made significant contributions to dynamic data structures.
As of my last knowledge update in October 2023, Michal Parnas does not appear to be a widely recognized public figure, concept, or term. It's possible that the name might refer to a private individual or a lesser-known topic that has not gained significant prominence in popular culture or academia. If you can provide more context or specify the area related to Michal Parnas (e.g., arts, science, literature, etc.
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!
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 Saks is a mathematician known for his contributions to computational complexity theory, a field that explores the resources required to solve problems using algorithms. He has worked on topics such as the complexity of Boolean functions, lower bounds, and the theoretical underpinnings of various computational models. Saks has published numerous research papers and has had a significant influence in the area of theoretical computer science.
Michael O. Rabin is an influential computer scientist known for his contributions to theoretical computer science, particularly in the areas of algorithms, cryptography, and randomization techniques. He is widely recognized for his work on the Rabin-Karp string search algorithm, which uses hashing for efficient substring searching, and for his contributions to randomized algorithms.
Michael Mitzenmacher is a prominent computer scientist known for his work in the areas of algorithms, randomness in computing, and theoretical computer science. He is a professor at Harvard University, where he has made significant contributions to the fields of computer science and engineering. His research often focuses on topics such as algorithms for data structures, probabilistic analysis, and network theory. Mitzenmacher is also known for co-authoring the book "Randomized Algorithms," which is widely used in computer science education.
Michael Luby is a notable figure in the fields of computer science and information theory. He is particularly recognized for his work on algorithms, error-correcting codes, and randomized algorithms. Luby is known for co-developing Luby Transform (LT) codes, which are a form of fountain codes used for efficient data transmission and error correction in communication systems. In addition to his research contributions, Luby has held academic positions and has been involved in various projects related to computer science and engineering.

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