AI & ChatGPT searches , social queries for THEORETICAL COMPUTER-SCIENCE
Search references for THEORETICAL COMPUTER-SCIENCE. Phrases containing THEORETICAL COMPUTER-SCIENCE
See searches and references containing THEORETICAL COMPUTER-SCIENCE!
Search references for THEORETICAL COMPUTER-SCIENCE. Phrases containing THEORETICAL COMPUTER-SCIENCE
See searches and references containing THEORETICAL COMPUTER-SCIENCE!THEORETICAL COMPUTER-SCIENCE
Subfield of computer science and mathematics
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation
Theoretical_computer_science
Organization
The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to
European Association for Theoretical Computer Science
European_Association_for_Theoretical_Computer_Science
Academic journal
Theoretical Computer Science is a peer-reviewed scientific journal covering computer science published by Elsevier. It was established in 1975. It is abstracted
Theoretical Computer Science (journal)
Theoretical_Computer_Science_(journal)
Study of computation
of computer science Computer science is the study of computation, information, and automation. Included broadly in the sciences, computer science spans
Computer_science
University academic program
software engineering, database systems and core subjects of theoretical computer science such as theory of computation, numerical methods, cloud computing
Computer science and engineering
Computer_science_and_engineering
Peer-reviewed open access journal
Mathematics & Theoretical Computer Science is a peer-reviewed open access scientific journal covering discrete mathematics and theoretical computer science. It
Discrete Mathematics & Theoretical Computer Science
Discrete_Mathematics_&_Theoretical_Computer_Science
Research institute in Berkeley, California
California, Berkeley is an institute for collaborative research in theoretical computer science. Established on July 1, 2012 with a grant of $60 million from
Simons Institute for the Theory of Computing
Simons_Institute_for_the_Theory_of_Computing
Sequence of characters, data type
In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from
String_(computer_science)
Subdivisions of science defined by their scope
formal sciences are the branches of science that are concerned with formal systems, such as mathematics, logic, theoretical computer science, information
Branches_of_science
This glossary of computer science is a list of definitions of terms and concepts used in computer science, its sub-disciplines, and related fields, including
Glossary_of_computer_science
Chinese research institute
The Institute for Theoretical Computer Science (ITCS; Chinese: 清华大学理论计算机科学研究中心) is a scholastic research institute headed by Professor Andrew Yao at Tsinghua
Institute for Theoretical Computer Science
Institute_for_Theoretical_Computer_Science
Use of functions that call themselves
In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same
Recursion_(computer_science)
Bachelor's degree program studying theoretical or practical aspects of computing
In general, computer science degree programs emphasize the mathematical and theoretical foundations of computing. Because computer science is a wide field
Bachelor_of_Computer_Science
Type of algorithm, produces approximately correct solutions
to generate good seed values). Results about NP-hardness in theoretical computer science make heuristics the only viable option for a variety of complex
Heuristic_(computer_science)
Academic journal
Electronic Notes in Theoretical Computer Science is an electronic computer science journal published by Elsevier, started in 1995. Its issues include many
Electronic Notes in Theoretical Computer Science
Electronic_Notes_in_Theoretical_Computer_Science
Scientist specializing in computer science
theory, theoretical computer science, numerical analysis, programming language theory, compiler, computer graphics, computer vision, robotics, computer architecture
Computer_scientist
Study of discrete mathematical structures
geometrical objects, while computer image analysis applies them to representations of images. Theoretical computer science also includes the study of
Discrete_mathematics
Quality of an algorithm being correct with respect to a specification
In theoretical computer science, an algorithm is correct with respect to a specification if it behaves as specified. Best explored is functional correctness
Correctness (computer science)
Correctness_(computer_science)
Overview of and topical guide to computer science
Computer science (also called computing science) is the study of the theoretical foundations of information and computation and their implementation and
Outline_of_computer_science
Theoretical model of computation
In theoretical computer science and computational theory, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing
Nondeterministic Turing machine
Nondeterministic_Turing_machine
Computer hardware technology that uses quantum mechanics
Supercomputer – Type of extremely powerful computer Theoretical computer science – Subfield of computer science and mathematics Unconventional computing –
Quantum_computing
In theoretical computer science, a simulation is a relation between state transition systems associating systems that behave in the same way in the sense
Simulation_(computer_science)
Study of abstract structures described by formal systems
Theoretical computer science Artificial intelligence Game theory Systems theory Theoretical linguistics Decision theory Systems science Data science Information
Formal_science
Conference on Innovations in Theoretical Computer Science is an academic conference about theoretical computer science. The conference was initiated
Innovations in Theoretical Computer Science
Innovations_in_Theoretical_Computer_Science
Ability to execute a task in a non-serial manner
Concurrency theory has been an active field of research in theoretical computer science. One of the first proposals was Carl Adam Petri's seminal work
Concurrency (computer science)
Concurrency_(computer_science)
Form of automatic memory management
In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated
Garbage collection (computer science)
Garbage_collection_(computer_science)
Entrance test for PhD admissions in India
Screening Test (JEST) is a national entrance test in physics and theoretical computer science conducted annually in India. The test is utilised by various
Joint_Entrance_Screening_Test
computer science awards List of computer science journals List of computer scientists List of Internet pioneers List of pioneers in computer science List
List of pioneers in computer science
List_of_pioneers_in_computer_science
Israeli computer scientist and mathematician
computing. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science. He also received the 2023 Turing Award for his contributions
Avi_Wigderson
This list of computer science awards is an index to articles on notable awards related to computer science. It includes lists of awards by the Association
List of computer science awards
List_of_computer_science_awards
Center for Discrete Mathematics and Theoretical Computer Science at Rutgers University
The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and
DIMACS
Conference Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational
List of computer science conferences
List_of_computer_science_conferences
Indian computer scientist (1962–2009)
Indian-American professor of computer science at Stanford University whose research focused on theoretical computer science. He was a special advisor to
Rajeev_Motwani
Mathematical framework for natural language processing
Compositional Natural Language Processing". Electronic Proceedings in Theoretical Computer Science. 221: 67–75. arXiv:1608.01406. doi:10.4204/EPTCS.221.8. ISSN 2075-2180
DisCoCat
Academic discipline
"perfect." In addition some other major areas of theoretical overlap between logic and computer science are: Gödel's incompleteness theorem proves that
Logic_in_computer_science
British American computer scientist
where he received a PhD in computer science in 1974. Valiant is world-renowned for his work in Theoretical Computer Science. Among his many contributions
Leslie_Valiant
Academic subfield of computer science
In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation
Theory_of_computation
Computer and information science (CIS; also known as information and computer science) is a field that emphasizes both computing and informatics, upholding
Computer and information science
Computer_and_information_science
American theoretical computer scientist
Zuckerman is an American theoretical computer scientist whose work concerns randomness in computation. He is a professor of computer science at the University
David Zuckerman (computer scientist)
David_Zuckerman_(computer_scientist)
British mathematician
His interests include mathematical logic, category theory, and theoretical computer science. Hyland was educated at the University of Oxford where he was
Martin_Hyland
Electronic Proceedings in Theoretical Computer Science is an international, peer-reviewed, open access series published by Open Publishing Association
Electronic Proceedings in Theoretical Computer Science
Electronic_Proceedings_in_Theoretical_Computer_Science
Mathematics & Theoretical Computer Science Distributed Computing e-Informatica Software Engineering Journal Electronic Letters on Computer Vision and Image
List of computer science journals
List_of_computer_science_journals
Israeli mathematician
University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Alon was born in 1956 in
Noga_Alon
Type of data structure
theoretical computer science model (an abstract data type or ADT) intended to capture the essential properties of arrays. The first digital computers
Array_(data_structure)
Pattern in mathematics and computer science
In mathematics and theoretical computer science, a pattern is an unavoidable pattern if it is unavoidable on any finite alphabet. Like a word, a pattern
Unavoidable_pattern
deal with the "population explosion among the logical systems used in computer science". The notion attempts to "formalize the informal" concept of logical
Institution (computer science)
Institution_(computer_science)
Academic journal
in Theoretical Computer Science is a peer-reviewed scientific journal that publishes long survey and tutorial articles in the field of theoretical computer
Foundations and Trends in Theoretical Computer Science
Foundations_and_Trends_in_Theoretical_Computer_Science
Computer science award
papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association
Gödel_Prize
Formal language that can be expressed using a regular expression
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be defined
Regular_language
In computer science, arrows or bolts are a type class used in computer programming to describe computations in a pure and declarative fashion. First proposed
Arrow_(computer_science)
The history of computer science began long before the modern discipline of computer science, usually appearing in forms like mathematics or physics. Developments
History_of_computer_science
Conference in theoretical computer science
of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May
Symposium on Theory of Computing
Symposium_on_Theory_of_Computing
The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately
Symposium on Theoretical Aspects of Computer Science
Symposium_on_Theoretical_Aspects_of_Computer_Science
IEEE conference for theoretical computer science
Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society
Symposium on Foundations of Computer Science
Symposium_on_Foundations_of_Computer_Science
Subpermutation of a longer permutation
In combinatorial mathematics and theoretical computer science, a (classical) permutation pattern is a sub-permutation of a longer permutation. Any permutation
Permutation_pattern
Problem in theoretical computer science
In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle
Subgraph_isomorphism_problem
American computer scientist (born 2000)
Graduate in computer science, having maintained a 4.0 grade-point average. In 2023 Tang completed her Ph.D. in theoretical computer science at the University
Ewin_Tang
Model of computation
In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes
Circuit_(computer_science)
British computer scientist
British Columbia) is a Canadian-born British computer scientist and expert on theoretical computer science, particularly infinite-state automata theory
Faron_Moller
Cambridge Computer Laboratory, UK. Milner, Robin (2008). "Bigraphs and Their Algebra" (PDF). Electronic Notes in Theoretical Computer Science. 209: 5–19
Bigraph
Concept in theoretical computer science
In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that (depending on definition) either produces
Busy_beaver
French research institution for computer science
students and 500 postdoctorates. Inria does both theoretical and applied research in computer science. In the process, it has produced many widely used
French Institute for Research in Computer Science and Automation
French_Institute_for_Research_in_Computer_Science_and_Automation
German academic
computer scientist working as a professor of theoretical computer science at LMU Munich. Blanchette earned a Bachelor of Science degree in computer science
Jasmin_Blanchette
Unconventional computer based on a semi-solid chemical "soup"
chemical computer, also called a reaction-diffusion computer, Belousov–Zhabotinsky (BZ) computer, or gooware computer, is an unconventional computer based
Chemical_computer
Total order in computer science
In theoretical computer science, in particular in term rewriting, a path ordering is a well-founded strict total order (>) on the set of all terms such
Path ordering (term rewriting)
Path_ordering_(term_rewriting)
Israeli-American computer scientist
born 1978) is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New
Oded Regev (computer scientist)
Oded_Regev_(computer_scientist)
Science prize
2024 Theoretical Computer and Information Sciences, Andrew Yao for groundbreaking work that has deeply influenced theoretical computer science. 2024
Basic_Science_Lifetime_Award
Specialist field of computer science
typically the application of computer simulation and other forms of computation from numerical analysis and theoretical computer science to solve problems in
Computational_science
Theoretical computer scientist
Indian-American theoretical computer scientist who works in AI and Machine learning. He is a Charles C. Fitzmorris Professor in Computer Science at Princeton
Sanjeev Arora (computer scientist)
Sanjeev_Arora_(computer_scientist)
The EATCS–IPEC Nerode Prize is a theoretical computer science prize awarded for outstanding research in the area of multivariate algorithmics. It is awarded
Nerode_Prize
Hungarian-American mathematician
and computer scientist, working in the field of combinatorics and theoretical computer science. He is the State of New Jersey Professor of Computer Science
Endre_Szemerédi
Public research institute in Mumbai, India
conducts research primarily in the natural sciences, the biological sciences and theoretical computer science. Homi J. Bhabha, known for his role in the
Tata Institute of Fundamental Research
Tata_Institute_of_Fundamental_Research
Automata that lists elements of some given set
P ≟ NP This theoretical computer science–related article is a stub. You can help Wikipedia by adding missing information.
Enumerator_(computer_science)
Systematic endeavour to gain knowledge
societies. While referred to as the formal sciences, the study of logic, mathematics, and theoretical computer science are typically regarded as separate because
Science
Fernandez (2008). "A polynomial nominal unification algorithm". Theoretical Computer Science. 403 (2–3): 285–306. doi:10.1016/j.tcs.2008.05.012. Christophe
Nominal terms (computer science)
Nominal_terms_(computer_science)
System of resource-aware logic
In 2015, a proof of decidability was published in the journal Theoretical Computer Science, but was later shown erroneous. Affine linear logic (that is
Linear_logic
Unsolved problem in formal language theory
Wolfgang Thomas (1981). "Remark on the star-height-problem". Theoretical Computer Science. 13 (2): 231–237. doi:10.1016/0304-3975(81)90041-4. MR 0594062
Generalized star-height problem
Generalized_star-height_problem
Algorithmic process of solving equations
In logic and computer science, specifically automated reasoning, unification is an algorithmic process of solving equations between symbolic expressions
Unification (computer science)
Unification_(computer_science)
American mathematician
is an American mathematician and theoretical computer scientist. Since 1994 he has been a professor of computer science at the University of Nevada, Las
Lawrence_L._Larmore
Problem in theoretical computer science
given strings of length n? More unsolved problems in computer science In theoretical computer science, the separating words problem is the problem of finding
Separating_words_problem
Inherent difficulty of computational problems
In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource
Computational complexity theory
Computational_complexity_theory
sponsored by DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science (at Rutgers University), with additional support from SIGACT
Algorithm_engineering
Polish mathematician, logician, and philosopher (1904 – c. 1943)
Holocaust, probably 1943. In 2010, the European Association for Theoretical Computer Science began conferring the annual Presburger Award named after him
Mojżesz_Presburger
Structure of a formal language
grammars and languages. Its applications are found in theoretical computer science, theoretical linguistics, formal semantics, mathematical logic, and
Formal_grammar
American mathematician and computer scientist (1903–1995)
American computer scientist, mathematician, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer
Alonzo_Church
Prize in foundations of computer science
Symposium on Foundations of Computer Science, which are among the most prestigious conferences in theoretical computer science. The recipient of the Knuth
Knuth_Prize
Scientific law in theoretical computer science
Within theoretical computer science, the Sun–Ni law (or Sun and Ni's law, also known as memory-bounded speedup) is a memory-bounded speedup model which
Sun–Ni_law
Greek computer scientist
Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science
Constantinos_Daskalakis
Computer science algorithm
In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.
Graph_traversal
European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions
International Colloquium on Automata, Languages and Programming
International_Colloquium_on_Automata,_Languages_and_Programming
Set of methods that extend the functionality of a class
Arnaud (2008). "Extending FeatherTrait Java with Interfaces". Theoretical Computer Science. 398 (1–3): 243–260. doi:10.1016/j.tcs.2008.01.051. S2CID 12923128
Trait_(computer_programming)
Models of computation
D. Sontag (1994). "Analog Computation via Neural Networks". Theoretical Computer Science. 131 (2): 331–360. doi:10.1016/0304-3975(94)90178-3. Biacino
Hypercomputation
In theoretical computer science, the word RAM (word random-access machine) model is a model of computation in which a random-access machine does arithmetic
Word_RAM
Base-1 numeral system
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Computer Science and Scientific Computing (2nd ed.), Academic Press,
Unary_numeral_system
Israeli theoretical computer scientist
2019-09-21 "Dana Moshkovitz – Theoretical Computer Science", New Faculty, University of Texas at Austin Department of Computer Science, retrieved 2019-09-21 Aaronson
Dana_Moshkovitz
Breadth of ideas which can be represented in a formal language
language equations: Expressive power and decision problems". Theoretical Computer Science. 349 (3): 283–308. doi:10.1016/j.tcs.2005.07.038. Serge Abiteboul
Expressive power (computer science)
Expressive_power_(computer_science)
Professor
algorithms, computational geometry, and several other branches of theoretical computer science. Together with his student Md. Iqbal Hossain he defined an interesting
Saidur Rahman (computer scientist)
Saidur_Rahman_(computer_scientist)
English computer scientist (1912–1954)
considered a model of a general-purpose computer. Turing is widely considered to be the father of theoretical computer science. Born in London, Turing was raised
Alan_Turing
Graphical language for quantum processes
ZX-calculus complete for scalars". Electronic Proceedings in Theoretical Computer Science. 195: 17–32. arXiv:1507.03854. doi:10.4204/eptcs.195.2. ISSN 2075-2180
ZX-calculus
Task of transforming a deterministic finite automaton
In automata theory (a branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA)
DFA_minimization
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE
THEORETICAL COMPUTER-SCIENCE