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.
Kavitha Telikepalli is an Indian entrepreneur, consultant, and advocate known for her work in various industries. She has made significant contributions as a motivational speaker and has been involved in initiatives aimed at empowering women and supporting technological advancements.
Katrina Ligett is a prominent researcher in the field of computer science, particularly known for her work in algorithms, privacy, and machine learning. She has made significant contributions to topics such as differential privacy, which is a framework for ensuring that the privacy of individuals in a dataset is maintained while still allowing for useful data analysis. Her work addresses the challenges of designing algorithms that can provide accurate results while protecting sensitive information.
János Komlós is a Hungarian mathematician known for his contributions to various fields within mathematics, particularly in combinatorics, probability theory, and number theory. He has been involved in significant research that often intersects these areas and has also contributed to the development of algorithms and probabilistic methods in combinatorial mathematics. In addition to his research, Komlós has had a notable academic career as a professor, teaching and mentoring students in mathematics.
Juris Hartmanis is a prominent computer scientist known for his contributions to the fields of theoretical computer science and computational complexity theory. He was born on September 5, 1928, in Riga, Latvia, and later emigrated to the United States. Hartmanis is perhaps best known for his work on the theory of computational complexity, which studies the resources required (like time and space) for algorithms to solve computational problems.
Juraj Hromkovič is a notable figure in the field of computer science, particularly recognized for his contributions to theoretical computer science, algorithm design, and computational complexity. He is also known for his work in the area of informatics education and has authored several important publications. Hromkovič has been involved in developing educational materials and curricula aimed at improving the teaching of computer science concepts, particularly in relation to algorithms and data structures.
Julia Chuzhoy is a prominent researcher in the field of computer science, particularly known for her work in algorithms and complexity theory. She has contributed significantly to areas like graph theory, optimization, and computational geometry. Chuzhoy has published numerous papers in respected academic journals and has been involved in various research projects and collaborations.
Juhani Karhumäki is a mathematician known for his contributions to the fields of automata theory, formal languages, and discrete mathematics. He has been involved in research related to the mathematical aspects of computer science, particularly in the study of computational models and structures.
John Watrous is a prominent Canadian computer scientist known for his contributions to the fields of quantum computing and complexity theory. He is a professor at the University of Waterloo in Canada and has made significant advancements in understanding the theoretical foundations of quantum information processing, including quantum algorithms and quantum complexity classes. One of his notable contributions is the development of the concept of quantum interactive proofs, which has implications for both quantum computing and classical computational complexity.
John Reif is known primarily as a computer scientist, particularly in the fields of algorithms and computational theory. He has made significant contributions to areas such as parallel computation and complexity theory. His work often focuses on the theoretical foundations of computer science, including the study of algorithms, data structures, and computational models. If you're referring to a different John Reif in another context (such as literature, sports, etc.
John Koza is a computer scientist and a prominent figure in the field of genetic programming, which is a type of evolutionary algorithm used to evolve computer programs. He is best known for his work in the development of genetic programming techniques and for co-authoring several influential books on the subject, including "Genetic Programming: On the Programming of Computers by Means of Natural Selection." Koza's research has focused on using principles of natural selection and genetics to automatically generate algorithms and solutions to complex problems.
Johan Håstad is a prominent Swedish computer scientist known for his contributions to theoretical computer science, particularly in areas like computational complexity, cryptography, and algorithms. He has made significant advancements in understanding the limitations of algorithms and the complexity of various computational problems. Håstad is also known for his work on derandomization and the study of Boolean functions.
Joan Feigenbaum is a prominent computer scientist known for her work in the fields of computer science and information science, particularly in areas such as algorithms, security, and privacy. She has made significant contributions to the theory of computer science, including work on the development of effective algorithms and their applications in various domains. Feigenbaum has held academic positions at institutions such as Yale University and has been involved in research related to network security, cryptography, and the economics of information.
Joachim von zur Gathen is a notable German mathematician known for his contributions to the fields of algebra and computer algebra. He has been involved in research areas such as polynomial algorithms, computational number theory, and symbolic computation. One of his significant works includes co-authoring the book "Computer Algebra: Systems and Algorithms for Algebraic Computation," which serves as a foundational text in the field of computer algebra.
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.
Jennifer Tour Chayes is a prominent American mathematician and computer scientist known for her work in the fields of mathematical physics, network science, and machine learning. She has held significant academic and leadership roles, including serving as a professor at various universities and as a managing director at Microsoft Research New England. Chayes has made substantial contributions to the understanding of complex systems and algorithms, particularly in relation to the mathematical underpinnings of social networks and the spread of information.
Jeff Edmonds may refer to a few different individuals, but the most notable is likely Jeffrey Edmonds, an American businessman known for his work in various industries. Additionally, there might be references to Jeff Edmonds in other contexts like sports or entertainment. If you have a particular field in mind (like sports, entertainment, etc.), please provide more details for a more accurate response!
Jean Gallier is a name associated with several individuals and contexts, but one notable figure is a mathematician and computer scientist known for his work in areas such as applied mathematics, numerical analysis, and computer graphics. He has contributed to research in various fields, including shape representation and geometry processing.
Jean-Éric Pin is a prominent French physicist known for his contributions to several areas of physics, including condensed matter physics and materials science. He is recognized for his work on the properties of various materials at the microscopic level, particularly in relation to nanotechnology and the behavior of electrons in low-dimensional systems. Pin has published numerous scientific papers and has collaborated with various research institutions, contributing to the advancement of knowledge in his field.
Janusz Brzozowski is a computer scientist known for his contributions to automata theory, formal languages, and verification. He has made significant contributions to the design and analysis of algorithms, particularly in the context of model checking and state space reduction. Brzozowski is perhaps best known for Brzozowski's algorithm for regular expressions and for his work on deterministic finite automata (DFAs).

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