Piotr Indyk is a prominent computer scientist known for his contributions to algorithms, data structures, and their applications in various fields, including machine learning and computer vision. He has made significant advancements in the areas of high-dimensional data analysis, sketching algorithms, and nearest neighbor searching. Indyk is also well-known for his work in the development of techniques that allow for efficient approximations of problems that are typically computationally expensive, especially in the context of large datasets.
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.
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.
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.
The "Adele ring" refers to a specific type of ring associated with the singer Adele, particularly her engagement ring. Adele's engagement ring is notable for its intricate design and has garnered attention in the media due to the artist's high profile. The ring is often described as a large diamond set in a unique design, highlighting Adele's style and taste. Additionally, there may be references to "Adele rings" in popular culture or jewelry trends inspired by her aesthetic.
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.
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.
Nati Linial is an Israeli computer scientist known for his contributions to the fields of theoretical computer science, combinatorics, and graph theory. He is a professor at the Hebrew University of Jerusalem. Linial's research includes topics such as the complexity of computational problems, randomness in computation, and properties of various graph structures. In addition to his academic work, he has contributed to the development of algorithms and has been involved in various teaching and mentoring activities within the field.
Naum Z. Shor is a prominent mathematician known for his contributions to various fields, including optimization, control theory, and numerical analysis. He is perhaps best known for Shor's algorithm, which is a quantum algorithm for factoring large integers efficiently, significant for its implications in cryptography. Additionally, he has made important contributions to the development of methods for solving optimization problems, particularly in the context of convex optimization and its applications in engineering and computer science.
Neil Immerman is a prominent computer scientist and mathematician known for his contributions to computational complexity theory and formal language theory. He is best known for his work on the expressiveness and complexity of various computational models, particularly in the context of logics and automata. One of Immerman's key contributions is the development of the concept of "definability" in computational complexity, which relates to how certain properties and functions can be expressed in logical languages.
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.
Nicole Immorlica is a notable researcher in the field of computer science, particularly known for her work in game theory, algorithm design, and mechanisms in economics. She has made significant contributions to understanding strategic interactions in computational settings. Immorlica has published various papers on topics such as algorithmic game theory, mechanism design, and market design, and has been involved in academic and public discussions related to these subjects.
Nir Shavit is a distinguished computer scientist known for his contributions to the fields of computer architecture, distributed systems, and programming languages. He is particularly recognized for his work on memory consistency models, data structures, and algorithms that enhance concurrent programming and efficient system design. Shavit has been involved in both academia and industry, and he is known for his research that addresses challenges in parallel computing and software performance.
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.
Oscar H. Ibarra is a prominent figure in the field of computer science, particularly known for his contributions to theoretical computer science, automata theory, and formal languages. He has authored and co-authored numerous research papers and has made significant contributions to the understanding of computational theory, including complexity theory and the theory of computation. He has also been involved in educating and mentoring students at the university level.
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.
Patrick C. Fischer is a name that may refer to various individuals, but without additional context, it's difficult to pinpoint exactly who you are referring to. It is possible that he could be a figure in academia, a professional in a particular field, or even a fictional character. If you provide more specific details about the context or relevance of Patrick C.
Rod Downey is a prominent figure in the fields of mathematical logic and computability theory. He is known for his contributions to the study of computably enumerable sets and related areas. Downey has co-authored several research papers and books on these topics, and he is recognized for his work on the structure and properties of various mathematical constructs in the area of logic.
Ronald V. Book is a prominent American mathematician known for his work in the field of combinatorics and graph theory. He has authored and co-authored numerous papers and books, especially focusing on topics like graph colorings, combinatorial designs, and extremal combinatorics.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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