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.
Ketan Mulmuley by Wikipedia Bot 0
Ketan Mulmuley is a mathematician known for his contributions to areas such as theoretical computer science, particularly in computational complexity theory and machine learning. He is a professor at the University of Chicago, where his research often intersects with topics like algebraic geometry and its applications in computer science.
Kosaburo Hashiguchi (橋口幸郎) was a notable Japanese artist, renowned for his woodblock prints during the early 20th century. He was particularly active in the Shin-hanga (新版画) movement, which sought to revitalize traditional ukiyo-e woodblock printing by incorporating Western artistic techniques and subjects while still embracing Japanese aesthetics. Hashiguchi's works often depicted beautiful women, seasonal landscapes, and traditional Japanese themes, combining meticulous craftsmanship with a modern sensibility.
Lance Fortnow by Wikipedia Bot 0
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.
Lawrence J. Fogel by Wikipedia Bot 0
Lawrence J. Fogel is an American scientist and entrepreneur known for his work in the fields of artificial intelligence, machine learning, and genetic algorithms. He has contributed significantly to the development of computational models and applications that utilize evolutionary principles to solve complex problems. Fogel is the founder of the company Natural Selection, Inc., which focuses on applying these algorithms in various domains. Additionally, he has authored and edited several influential books and papers on genetic algorithms and their applications in AI.
Dorico by Wikipedia Bot 0
Dorico is a music notation software developed by Steinberg, known for its high-quality scoring capabilities and user-friendly interface. It is designed for composers, arrangers, and music educators, allowing them to create, edit, and print musical scores efficiently. Dorico offers features such as automatic engraving, support for complex musical notation, and advanced tools for multi-instrument scores and orchestration.
Lenore Blum by Wikipedia Bot 0
Lenore Blum is an American mathematician and computer scientist known for her contributions to the fields of logic, computational complexity, and algebra. She is a professor emerita at Carnegie Mellon University and has made significant contributions to mathematical logic, particularly in relation to computational models and the foundations of mathematics. Blum is also notable for her work in promoting diversity in computer science and mathematics, advocating for the inclusion of underrepresented groups in these fields.
Maarten van Emden by Wikipedia Bot 0
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 by Wikipedia Bot 0
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.
Manindra Agrawal by Wikipedia Bot 0
Manindra Agrawal is an Indian computer scientist known for his significant contributions to the fields of theoretical computer science and algorithms. He is particularly recognized for his work in number theory and computational complexity. Agrawal is one of the co-inventors of the AKS primality test, which is a groundbreaking algorithm that determines whether a number is prime in polynomial time.
168 (number) by Wikipedia Bot 0
The number 168 is an integer that follows 167 and precedes 169. In terms of its properties: - It is an even number. - It is a composite number, meaning it has factors other than 1 and itself.
Mary Wootters by Wikipedia Bot 0
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 A. Harrison is a name that could refer to various individuals, and without specific context, it's difficult to identify which person you are referring to. There might be professionals in different fields such as academia, business, or the arts with that name. If you can provide more context or specify the field or area of interest related to Michael A.
Michael Fellows by Wikipedia Bot 0
Michael Fellows is a well-known computer scientist recognized for his contributions to the fields of computational complexity theory and algorithms. He has worked on various aspects of parameterized complexity and has made significant contributions to understanding fixed-parameter tractability and the development of efficient algorithms for NP-hard problems. Fellows is also known for his role in computer science education and has authored or co-authored numerous research papers, influencing both theoretical and practical aspects of the field.
Michael Fredman by Wikipedia Bot 0
Michael Fredman is a noted computer scientist, primarily recognized for his contributions to data structures, algorithms, and computational geometry. He has worked on various topics in theoretical computer science and has made significant contributions that have influenced the development of efficient algorithms and data structures. Some of his work includes the development of advanced data structures, such as those for dynamic sets and search problems.
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 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 Sipser by Wikipedia Bot 0
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!
Mike Paterson by Wikipedia Bot 0
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?

Pinned article: ourbigbook/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