Find link

language:

Find link is a tool written by Edward Betts.

searching for Theoretical Computer Science (journal) 454 found (1192 total)

alternate case: theoretical Computer Science (journal)

Gödel Prize (2,163 words) [view diff] no match in snippet view article find links to article

papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association

Mathematical Reviews (823 words) [view diff] no match in snippet view article find links to article

evaluations, of many articles in mathematics, statistics, and theoretical computer science. The AMS also publishes an associated online bibliographic database

Formal methods (3,643 words) [view diff] no match in snippet view article find links to article

and robustness of a design. Formal methods employ a variety of theoretical computer science fundamentals, including logic calculi, formal languages, automata

Combinatorics, Probability and Computing (379 words) [view diff] no match in snippet view article find links to article

combinatorics journals and writes that it "maintains a high standard". The journal covers combinatorics, probability theory, and theoretical computer science. Currently

Electronic Notes in Theoretical Computer Science (61 words) [view diff] no match in snippet view article find links to article

Electronic Notes in Theoretical Computer Science is an electronic computer science journal published by Elsevier, started in 1995. Its issues include many

Knuth Prize (781 words) [view diff] no match in snippet view article find links to article

Science, which are among the most prestigious conferences in theoretical computer science. The recipient of the Knuth Prize delivers a lecture at the conference

Discrete Mathematics & Theoretical Computer Science (99 words) [view diff] no match in snippet view article find links to article

Mathematics & Theoretical Computer Science is a peer-reviewed open access scientific journal covering discrete mathematics and theoretical computer science. It

Noga Alon (1,336 words) [view diff] no match in snippet view article find links to article

University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Alon was born in 1956 in

International Journal of Algebra and Computation (91 words) [view diff] no match in snippet view article find links to article

computation Theoretical computer science According to the Journal Citation Reports, the journal has a 2020 impact factor of 0.719. The journal is indexed

Algorithms (journal) (230 words) [view diff] no match in snippet view article

peer-reviewed open-access scientific journal of mathematics, covering design, analysis, and experiments on algorithms. The journal is published by MDPI and was

Fundamenta Informaticae (100 words) [view diff] no match in snippet view article find links to article

IOS Press under the auspices of the European Association for Theoretical Computer Science. Janusz Kowalski, 2004. The Polish Mathematical Society (PTM)

International Symposium on Symbolic and Algebraic Computation (275 words) [view diff] no match in snippet view article find links to article

implementation of computer algebra systems; applications of computer algebra. Journal of Symbolic Computation Past ISSAC Conferences Computer Algebra Conferences

Pointer machine (1,556 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, a pointer machine is an atomistic abstract computational machine whose storage structure is a graph. A pointer algorithm

Transdichotomous model (503 words) [view diff] no match in snippet view article find links to article

(1993), "Surpassing the information-theoretic bound with fusion trees", Journal of Computer and System Sciences, 47 (3): 424–436, doi:10.1016/0022-0000(93)90040-4

Foundations and Trends in Theoretical Computer Science (69 words) [view diff] no match in snippet view article find links to article

in Theoretical Computer Science is a peer-reviewed scientific journal that publishes long survey and tutorial articles in the field of theoretical computer

Combinatorial optimization (1,847 words) [view diff] no match in snippet view article find links to article

theory, software engineering, VLSI, applied mathematics and theoretical computer science. Basic applications of combinatorial optimization include, but

Theory of Computing Systems (101 words) [view diff] no match in snippet view article find links to article

is devoted to publishing original research from all areas of theoretical computer science, such as computational complexity, algorithms and data structures

Graphs and Combinatorics (205 words) [view diff] no match in snippet view article find links to article

Asian Journal". In most years since 1999, it has been ranked as a second-quartile journal in discrete mathematics and theoretical computer science by SCImago

Martin Dyer (392 words) [view diff] no match in snippet view article find links to article

the University of Leeds in 1979. His research interests lie in theoretical computer science, discrete optimization and combinatorics. Currently, he focuses

Categorical logic (1,104 words) [view diff] no match in snippet view article find links to article

mathematical logic. It is also notable for its connections to theoretical computer science. In broad terms, categorical logic represents both syntax and

Electronic Proceedings in Theoretical Computer Science (109 words) [view diff] no match in snippet view article find links to article

Electronic Proceedings in Theoretical Computer Science is an international, peer-reviewed, open access series published by Open Publishing Association

Automated reasoning (1,346 words) [view diff] no match in snippet view article find links to article

sub-field of artificial intelligence, it also has connections with theoretical computer science and philosophy. The most developed subareas of automated reasoning

Threshold theorem (1,061 words) [view diff] no match in snippet view article find links to article

(2008-01-01). "Fault-Tolerant Quantum Computation with Constant Error Rate". SIAM Journal on Computing. 38 (4): 1207–1282. arXiv:quant-ph/9906129. doi:10.1137/S0097539799359385

E (complexity) (185 words) [view diff] no match in snippet view article

(1987), "Comparison of polynomial time completeness notions", Theoretical Computer Science, 54 (2–3): 249–265, doi:10.1016/0304-3975(87)90132-0. Complexity

Spintronics (3,343 words) [view diff] no match in snippet view article find links to article

(2011). "SPIN". World Scientific. ISSN 2010-3247. {{cite journal}}: Cite journal requires |journal= (help) "Spintronics Steps Forward.", University of South

Leslie Valiant (1,220 words) [view diff] no match in snippet view article find links to article

2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing

Journal of Automata, Languages and Combinatorics (221 words) [view diff] no match in snippet view article find links to article

The Journal of Automata, Languages and Combinatorics (JALC) is a peer-reviewed scientific journal of computer science. It was established in 1965 as the

Occam learning (1,710 words) [view diff] no match in snippet view article find links to article

, & Li, M. (1993). Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4), 807-837. Kearns, M. J., & Schapire, R. E. (1990, October)

AWPP (269 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, almost wide probabilistic polynomial-time (AWPP) is a complexity class contained in PP defined via GapP functions. The

Theory of Computing (50 words) [view diff] no match in snippet view article find links to article

Computing is a peer-reviewed open access scientific journal covering theoretical computer science. The journal was established in 2005 and is published by the

Neil Immerman (332 words) [view diff] no match in snippet view article find links to article

jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science for proof of what is known as the Immerman–Szelepcsényi theorem

Acta Informatica (119 words) [view diff] no match in snippet view article find links to article

scientific journal, publishing original research papers in computer science. The journal is mainly known for publications in theoretical computer science. One

Generalized game (385 words) [view diff] no match in snippet view article find links to article

an n × n {\displaystyle n\times n} board is PSPACE-complete", Theoretical Computer Science, 123 (2): 329–340, doi:10.1016/0304-3975(94)90131-7 Mishiba,

Discrete mathematics (2,771 words) [view diff] no match in snippet view article find links to article

Prize is awarded for outstanding papers in discrete mathematics. Theoretical computer science includes areas of discrete mathematics relevant to computing

Workshop on Logic, Language, Information and Computation (2,677 words) [view diff] no match in snippet view article find links to article

academic conference in the field of pure and applied logic and theoretical computer science. WoLLIC has been organised annually since 1994, typically in

Logical Methods in Computer Science (271 words) [view diff] no match in snippet view article find links to article

Science (LMCS) is a peer-reviewed open access scientific journal covering theoretical computer science and applied logic. It opened to submissions on September

Stephen Cole Kleene (1,356 words) [view diff] no match in snippet view article find links to article

theory, which subsequently helped to provide the foundations of theoretical computer science. Kleene's work grounds the study of computable functions. A number

Circuit (computer science) (857 words) [view diff] no match in snippet view article

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

Hypercomputation (3,368 words) [view diff] no match in snippet view article find links to article

D. Sontag (1994). "Analog Computation via Neural Networks". Theoretical Computer Science. 131 (2): 331–360. doi:10.1016/0304-3975(94)90178-3. Biacino

Philip Wadler (1,031 words) [view diff] no match in snippet view article find links to article

and type theory. He holds the position of Personal Chair of theoretical computer science at the Laboratory for Foundations of Computer Science at the

Algorithmic Number Theory Symposium (919 words) [view diff] no match in snippet view article find links to article

proceedings of ANTS XI and ANTS XII were published as a special issue of the LMS Journal of Computation and Mathematics (JCM). The proceedings for ANTS XV and ANTS

Chemical computer (1,076 words) [view diff] no match in snippet view article find links to article

"Chemical Computing: The different way of computing" (PDF). International Journal of Innovative Research in Technology. 1 (6). ISSN 2349-6002. Archived from

Journal of Automated Reasoning (133 words) [view diff] no match in snippet view article find links to article

The journal is published by Springer Science+Business Media. As of 2021, the editor-in-chief is Jasmin Blanchette, a professor of theoretical computer science

Algorithm (6,769 words) [view diff] no match in snippet view article find links to article

Absolute Definitions" (PDF). Bulletin of European Association for Theoretical Computer Science. 81. Archived (PDF) from the original on October 9, 2022. Includes

Computability in Europe (865 words) [view diff] no match in snippet view article find links to article

Springer book series Theory and Applications of Computability and the journal Computability published by IOS Press. Löwe, Benedikt (January 2016). "Benedikt

Chaos computing (1,144 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, chaos computing is the idea of using chaotic systems for computation. In particular, chaotic systems can be made to produce

International Workshop on First-Order Theorem Proving (296 words) [view diff] no match in snippet view article find links to article

have resulted in a special issue of a recognized peer-reviewed academic journal. FTP is one of the constituent meetings of the International Joint Conference

Journal of Applied Non-Classical Logics (83 words) [view diff] no match in snippet view article find links to article

natural language processing), and theoretical computer science (program verification, program synthesis). The journal was established in 1991 by Luis Fariñas

Michael Mitzenmacher (572 words) [view diff] no match in snippet view article find links to article

2010 to June 2013. He also runs My Biased Coin, a blog about theoretical computer science. In 1986, Mitzenmacher attended the Research Science Institute

RAMiCS (391 words) [view diff] no match in snippet view article find links to article

locations mainly in Europe, but also in other continents. Like most theoretical computer science conferences, its contributions are strongly peer-reviewed. Proceedings

Flajolet Lecture Prize (1,039 words) [view diff] no match in snippet view article find links to article

analytic combinatorics and analysis of algorithms, in the fields of theoretical computer science. This prize is named in memory of Philippe Flajolet. The Flajolet

Lulu smoothing (712 words) [view diff] no match in snippet view article find links to article

smoothers". Journal of Computational and Applied Mathematics. 186 (1): 253–267. Bibcode:2006JCoAM.186..253C. doi:10.1016/j.cam.2005.03.073.{{cite journal}}: CS1

Idempotence (2,939 words) [view diff] no match in snippet view article find links to article

Printed: Peirce, Benjamin (1881). "Linear associative algebra". American Journal of Mathematics. 4 (1): 97–229. doi:10.2307/2369153. JSTOR 2369153. See

Institutional model theory (358 words) [view diff] no match in snippet view article find links to article

Petria and Rãzvan Diaconescu: Abstract Beth definability in institutions. Journal of Symbolic Logic 71(3), p. 1002-1028, 2006. Daniel Gǎinǎ and Andrei Popescu:

Approximation algorithm (3,126 words) [view diff] no match in snippet view article find links to article

one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under

Alonzo Church (2,245 words) [view diff] no match in snippet view article find links to article

major contributions to mathematical logic and the foundations of theoretical computer science. He is best known for the lambda calculus, the Church–Turing

Tardiness (scheduling) (406 words) [view diff] no match in snippet view article

problem: an interconnected neural network approach, The International Journal of Advanced Manufacturing Technology May 2008, Volume 37, Issue 5, pp 576-588

International Journal of Software and Informatics (99 words) [view diff] no match in snippet view article find links to article

computer-aided applications, formal methods, multimedia techniques, theoretical computer science, network and information security, and related areas including

International Journal of Foundations of Computer Science (118 words) [view diff] no match in snippet view article find links to article

World Scientific. It was founded in 1990, covering the field of theoretical computer science, from algebraic theory and algorithms, to quantum computing and

Rajeev Motwani (919 words) [view diff] no match in snippet view article find links to article

computer science at Stanford University whose research focused on theoretical computer science. He was a special advisor to Sequoia Capital. He was a winner

Property testing (2,454 words) [view diff] no match in snippet view article find links to article

Property testing is a field of theoretical computer science, concerned with the design of super-fast algorithms for approximate decision making, where

Richard E. Ladner (381 words) [view diff] no match in snippet view article find links to article

American computer scientist known for his contributions to both theoretical computer science and assistive technology. Ladner is a professor emeritus at the

Bio-inspired computing (2,984 words) [view diff] no match in snippet view article find links to article

Wilson, David Sloan; Sober, Elliott (1989). "Reviving the superorganism". Journal of Theoretical Biology. 136 (3): 337–356. Bibcode:1989JThBi.136..337W.

DisCoCat (1,503 words) [view diff] no match in snippet view article find links to article

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

LOGCFL (304 words) [view diff] no match in snippet view article find links to article

Mitsunori (2002), The Complexity Theory Companion, Texts in Theoretical Computer Science: An EATCS Series, Springer, p. 280, doi:10.1007/978-3-662-04880-1

Evelyn Nelson (mathematician) (624 words) [view diff] no match in snippet view article

contributions to the area of universal algebra with applications to theoretical computer science. She, along with Cecilia Krieger, is the namesake of the Krieger–Nelson

Bisimulation (2,013 words) [view diff] no match in snippet view article find links to article

In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in

Grzegorz Rozenberg (949 words) [view diff] no match in snippet view article find links to article

(Springer-Verlag), Theoretical Computer Science C: Theory of Natural Computing (Elsevier), Monographs in Theoretical Computer Science (Springer-Verlag)

Evolution strategy (2,053 words) [view diff] no match in snippet view article find links to article

August 2006). "Weighted multirecombination evolution strategies". Theoretical Computer Science. 361 (1): 18–37. doi:10.1016/j.tcs.2006.04.003. ISSN 0304-3975

Transcriptor (716 words) [view diff] no match in snippet view article find links to article

doi:10.1126/science.1232758. PMID 23539178. S2CID 206546590. - original journal article, published in Science Explanatory video created by Drew Endy NPR

Quantum algorithm (4,560 words) [view diff] no match in snippet view article find links to article

Prime Factorization and Discrete Logarithms on a Quantum Computer". SIAM Journal on Scientific and Statistical Computing. 26 (5): 1484–1509. arXiv:quant-ph/9508027

Logical matrix (1,989 words) [view diff] no match in snippet view article find links to article

sets. It is an important tool in combinatorial mathematics and theoretical computer science. If R is a binary relation between the finite indexed sets X

Immerman–Szelepcsényi theorem (1,272 words) [view diff] no match in snippet view article find links to article

"Relationships between nondeterministic and deterministic tape complexities", Journal of Computer and System Sciences, 4 (2): 177–192, doi:10.1016/s0022-0000(70)80006-x

Continuous automaton (265 words) [view diff] no match in snippet view article find links to article

Part I--A New Paradigm of Human Social Pattern Formation". International Journal of Computational Cognition. 7 (1). Yang's Scientific Press: 1–34. Yang

Branches of science (3,820 words) [view diff] no match in snippet view article find links to article

are concerned with formal systems, such as logic, mathematics, theoretical computer science, information theory, systems theory, decision theory, statistics

Motion planning (3,119 words) [view diff] no match in snippet view article find links to article

6764. doi:10.1007/11558958_11. ISBN 978-3-540-29067-4. {{cite book}}: |journal= ignored (help) Wolf, Joerg Christian; Robinson, Paul; Davies, Mansel (2004)

Vincent Blondel (715 words) [view diff] no match in snippet view article find links to article

research lies in the area of mathematical control theory and theoretical computer science. He is mostly known for his contributions in computational complexity

Computational complexity theory (6,704 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource

Seymour Ginsburg (1,435 words) [view diff] no match in snippet view article find links to article

science, in general. His work was influential in distinguishing theoretical Computer Science from the disciplines of Mathematics and Electrical Engineering

Lowest common ancestor (2,991 words) [view diff] no match in snippet view article find links to article

representative lowest common ancestor in directed acyclic graphs" (PDF), Theoretical Computer Science, 513: 25–37, doi:10.1016/j.tcs.2013.09.030, hdl:2299/12152 Djidjev

Computational complexity of matrix multiplication (4,286 words) [view diff] no match in snippet view article find links to article

multiplication? More unsolved problems in computer science In theoretical computer science, the computational complexity of matrix multiplication dictates

Mihai Pătrașcu (computer scientist) (521 words) [view diff] no match in snippet view article

and the Presburger Award from the European Association for Theoretical Computer Science in 2012, for breaking "many old barriers on fundamental data

Subgraph isomorphism problem (1,857 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle

Information Processing Letters (520 words) [view diff] no match in snippet view article find links to article

This naturally covers topics in the broadly understood field of theoretical computer science, including algorithms, formal languages and automata, computational

Yuri Gurevich (836 words) [view diff] no match in snippet view article find links to article

Computer Science in the Bulletin of the European Association for Theoretical Computer Science. Since 2013 Gurevich has worked primarily on quantum computing

Least-squares spectral analysis (3,354 words) [view diff] no match in snippet view article find links to article

Rhythms: Peak Detection in the Periodogram of Unequally Spaced Data". Journal of Biological Rhythms. 14 (6): 617–620. doi:10.1177/074873099129000984

GapP (115 words) [view diff] no match in snippet view article find links to article

S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes, Journal of Computer and System Sciences 48(1):116-148, 1994. Complexity Zoo: GapP

Mark Jerrum (285 words) [view diff] no match in snippet view article find links to article

dynamical systems. This work has been highly influential in theoretical computer science and was recognised with the Gödel Prize in 1996. A refinement

Quantum complexity theory (3,632 words) [view diff] no match in snippet view article find links to article

Bernstein, Ethan; Vazirani, Umesh (1997). "Quantum Complexity Theory". SIAM Journal on Computing. 26 (5): 1411–1473. CiteSeerX 10.1.1.144.7852. doi:10.1137/S0097539796300921

Arto Salomaa (729 words) [view diff] no match in snippet view article find links to article

Denmark. Salomaa was president of the European Association for Theoretical Computer Science from 1979 until 1985. Salomaa authored or co-authored 46 textbooks

TC0 (4,770 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in

L/poly (443 words) [view diff] no match in snippet view article find links to article

"On read-once vs. multiple access to randomness in logspace", Theoretical Computer Science, 107 (1): 135–144, doi:10.1016/0304-3975(93)90258-U, MR 1201169

Arto Salomaa (729 words) [view diff] no match in snippet view article find links to article

Denmark. Salomaa was president of the European Association for Theoretical Computer Science from 1979 until 1985. Salomaa authored or co-authored 46 textbooks

Introduction to the Theory of Computation (94 words) [view diff] no match in snippet view article find links to article

Theory of Computation (ISBN 0-534-95097-3) is a textbook in theoretical computer science, written by Michael Sipser and first published by PWS Publishing

Algorithmic information theory (2,576 words) [view diff] no match in snippet view article find links to article

Algorithmic information theory (AIT) is a branch of theoretical computer science that concerns itself with the relationship between computation and information

Toniann Pitassi (990 words) [view diff] no match in snippet view article find links to article

European Association for Theoretical Computer Science (65): 66–89, MR 1650939. Reprinted in Current Trends in Theoretical Computer Science, World Scientific

Alasdair Urquhart (417 words) [view diff] no match in snippet view article find links to article

relevance logic R. He published numerous scientific papers in theoretical computer science venues, mostly on mathematical logic topics of relevance to computer

Shannon–Hartley theorem (3,087 words) [view diff] no match in snippet view article find links to article

(July 1928). "Transmission of Information" (PDF). Bell System Technical Journal. 7 (3): 535–563. doi:10.1002/j.1538-7305.1928.tb01236.x. Bell, D. A. (1962)

Maria-Florina Balcan (517 words) [view diff] no match in snippet view article find links to article

research investigates machine learning, algorithmic game theory, theoretical computer science, including active learning, kernel methods, random-sampling mechanisms

Random-access Turing machine (1,438 words) [view diff] no match in snippet view article find links to article

In computational complexity, a field of theoretical computer science, random-access Turing machines extend the functionality of conventional Turing machines

Π-calculus (4,860 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along the

Gregory Chaitin (1,101 words) [view diff] no match in snippet view article find links to article

algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. It is a common subject

State complexity (3,375 words) [view diff] no match in snippet view article find links to article

State complexity is an area of theoretical computer science dealing with the size of abstract automata, such as different kinds of finite automata. The

Hans-Jörg Kreowski (889 words) [view diff] no match in snippet view article find links to article

of Bremen in North West Germany. His primary research area is theoretical computer science with an emphasis on graph transformation, algebraic specification

Newman's lemma (452 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, specifically in term rewriting, Newman's lemma, also commonly called the diamond lemma, is a criterion to prove that an

Queue number (2,715 words) [view diff] no match in snippet view article find links to article

(2004), "Track layouts of graphs" (PDF), Discrete Mathematics & Theoretical Computer Science, 6 (2): 497–521, arXiv:cs/0407033, Bibcode:2004cs........7033D

Paul Spirakis (157 words) [view diff] no match in snippet view article find links to article

Academia Europaea. He is the Editor in Chief (Track A) of the journal Theoretical Computer Science. He completed his S.M in Applied Mathematics (Computer Science)

Baker's technique (875 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, Baker's technique is a method for designing polynomial-time approximation schemes (PTASs) for problems on planar graphs

Institution (computer science) (1,110 words) [view diff] no match in snippet view article

"Institutions: Abstract model theory for specification and programming", Journal of the ACM, 39 (1): 95–146, doi:10.1145/147508.147524, S2CID 16856895 Razvan

Eduardo D. Sontag (1,180 words) [view diff] no match in snippet view article find links to article

dynamical systems, systems molecular biology, cancer and immunology, theoretical computer science, neural networks, and computational biology. Sontag received

Tata Institute of Fundamental Research (1,443 words) [view diff] no match in snippet view article find links to article

primarily in the natural sciences, the biological sciences and theoretical computer science. Homi J. Bhabha, known for his role in the development of the

Machine learning in physics (2,264 words) [view diff] no match in snippet view article find links to article

Christopher E. (2012-07-06). "Robust Online Hamiltonian Learning". New Journal of Physics. 14 (10): 103013. arXiv:1207.1655. Bibcode:2012NJPh...14j3013G

Yuval Peres (1,140 words) [view diff] no match in snippet view article find links to article

in probability theory, ergodic theory, mathematical analysis, theoretical computer science, and in particular for topics such as fractals and Hausdorff

Shannon's source coding theorem (1,881 words) [view diff] no match in snippet view article find links to article

Communication Archived 2009-02-16 at the Wayback Machine", Bell System Technical Journal, vol. 27, pp. 379–423, 623-656, July, October, 1948 David J. C. MacKay

Computational social choice (1,538 words) [view diff] no match in snippet view article find links to article

choice is a field at the intersection of social choice theory, theoretical computer science, and the analysis of multi-agent systems. It consists of the

Quantifier elimination (1,435 words) [view diff] no match in snippet view article find links to article

simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement " ∃ x {\displaystyle \exists

Pattern language (formal languages) (1,261 words) [view diff] no match in snippet view article

In theoretical computer science, a pattern language is a formal language that can be defined as the set of all particular instances of a string of constants

Computer science (6,673 words) [view diff] no match in snippet view article find links to article

computer science as a branch of mathematics, which is prevalent in theoretical computer science, and mainly employs deductive reasoning), the "technocratic paradigm"

Schwartz–Zippel lemma (2,147 words) [view diff] no match in snippet view article find links to article

(2003-02-21). "Primality and Identity Testing via Chinese Remaindering". Journal of the ACM. 50 (4): 429–443. doi:10.1145/792538.792540. S2CID 13145079

Hisao Yamada (272 words) [view diff] no match in snippet view article find links to article

computer scientist, known for his influential contributions to theoretical computer science, as well as for the development of Japanese keyboard layouts

Error tolerance (PAC learning) (1,904 words) [view diff] no match in snippet view article

[www.cis.upenn.edu/~mkearns/papers/sq-journal.pdf Efficient noise-tolerant learning from statistical queries]. Journal of the ACM, 45(6), 983–1006. Kearns

Uwe Schöning (603 words) [view diff] no match in snippet view article find links to article

Hell (1995), MR1232421 Review of Gems of Theoretical Computer Science by Rohit Jivanlal Parikh (2000), Journal of Logic, Language and Information 9 (1):

David Wood (mathematician) (638 words) [view diff] no match in snippet view article

Melbourne, Australia. His research area is discrete mathematics and theoretical computer science, especially structural graph theory, extremal graph theory, geometric

International Conference on Logic Programming (183 words) [view diff] no match in snippet view article find links to article

Technical Communications are published as Electronic Proceedings in Theoretical Computer Science. The first ICLP was held in September 1982 in Marseille, France;

Formal semantics (natural language) (2,237 words) [view diff] no match in snippet view article

languages using formal concepts from logic, mathematics and theoretical computer science. It is an interdisciplinary field, sometimes regarded as a subfield

Circuit complexity (2,571 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according

Oded Regev (computer scientist) (815 words) [view diff] no match in snippet view article

Regev has also done work in a large number of other areas in theoretical computer science and mathematics. These include quantum computing, communication

Frontiers of Computer Science (149 words) [view diff] no match in snippet view article find links to article

including system architecture, software, artificial intelligence, theoretical computer science, networks and communication, information systems, multimedia

Actor model theory (1,545 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, Actor model theory concerns theoretical issues for the Actor model. Actors are the primitives that form the basis of the

List of PSPACE-complete problems (1,807 words) [view diff] no match in snippet view article find links to article

Complexity of Problems on Graphs Represented as OBDDs, Chicago Journal of Theoretical Computer Science, vol 5, no 5, 1999. C.H. Papadimitriou; M. Yannakakis (1989)

Recursive ascent parser (2,004 words) [view diff] no match in snippet view article find links to article

by Leermakers, Augusteijn, Kruseman Aretz in 1992 in the journal Theoretical Computer Science. An extremely readable description of the technique was written

List of computer science awards (859 words) [view diff] no match in snippet view article find links to article

2020-01-28 "About the Lovelace Medal". "Charles Babbage Premium". The Journal of the Brit.I.R.E. 19 (1). British Institution of Radio Engineers: 132

List of PSPACE-complete problems (1,807 words) [view diff] no match in snippet view article find links to article

Complexity of Problems on Graphs Represented as OBDDs, Chicago Journal of Theoretical Computer Science, vol 5, no 5, 1999. C.H. Papadimitriou; M. Yannakakis (1989)

Imre Simon (256 words) [view diff] no match in snippet view article find links to article

mathematician and computer scientist. His research mainly focused on theoretical computer science, automata theory, and tropical mathematics, a subject he founded

Ronald Fagin (1,179 words) [view diff] no match in snippet view article find links to article

Edgar F. Codd Innovations Award The European Association for Theoretical Computer Science (in conjunction with the ACM Special Interest Group for Logic

Giorgi Japaridze (2,628 words) [view diff] no match in snippet view article find links to article

Dzhaparidze) is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing

Turing machine (9,420 words) [view diff] no match in snippet view article find links to article

automaton Digital infinity The Emperor's New Mind Enumerator (in theoretical computer science) Genetix Gödel, Escher, Bach: An Eternal Golden Braid, a famous

LMCS (105 words) [view diff] no match in snippet view article find links to article

Support Logical Methods in Computer Science, a scientific journal in theoretical computer science IEEE 802, the LAN/MAN Standards Committee (LMCS) Search

Saidur Rahman (professor) (1,006 words) [view diff] no match in snippet view article

algorithms, computational geometry, and several other branches of theoretical computer science. Together with his student Md. Iqbal Hossain he defined an interesting

Ruy de Queiroz (1,250 words) [view diff] no match in snippet view article find links to article

Beklemishev) of Annals of Pure and Applied Logic, Theoretical Computer Science, Information and Computation, Journal of Computer System and Sciences, Fundamenta

Unrestricted algorithm (235 words) [view diff] no match in snippet view article find links to article

1980). "An unrestricted algorithm for the exponential function". SIAM Journal on Numerical Analysis. 17 (2): 310–331. Bibcode:1980SJNA...17..310C. doi:10

Bird–Meertens formalism (1,373 words) [view diff] no match in snippet view article find links to article

(1989). "Algebraic Identities for Program Calculation" (PDF). The Computer Journal. 32 (2): 122–126. doi:10.1093/comjnl/32.2.122. Cole, Murray (1993). "Parallel

In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines, analogous to a Turing machine and thus

Shai Evra (324 words) [view diff] no match in snippet view article find links to article

major implications even outside mathematics, extending into theoretical computer science, according to the citation." Shai Evra was born in Israel. He

Random-access stored-program machine (2,620 words) [view diff] no match in snippet view article find links to article

In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development

Daniel I. A. Cohen (282 words) [view diff] no match in snippet view article find links to article

College, the Daniel I.A. Cohen Prize for Academic Excellence in Theoretical Computer Science, was named after Cohen. Faculty in Hunter's Computer Science

Rényi entropy (3,526 words) [view diff] no match in snippet view article find links to article

with respect to a particular subgroup of the modular group. In theoretical computer science, the min-entropy is used in the context of randomness extractors

Ursula Martin (729 words) [view diff] no match in snippet view article find links to article

is a British computer scientist, with research interests in theoretical computer science and formal methods. She is also known for her activities aimed

Cobham's theorem (2,524 words) [view diff] no match in snippet view article find links to article

definability in Presburger arithmetic and its applications" (PDF). Theoretical Computer Science. 290 (3): 1433–1444. doi:10.1016/S0304-3975(02)00047-6. Eilenberg

Tree transducer (1,623 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and formal language theory, a tree transducer (TT) is an abstract machine taking as input a tree, and generating output

Manifold hypothesis (631 words) [view diff] no match in snippet view article find links to article

Narayanan, Hariharan (2016-02-09). "Testing the manifold hypothesis". Journal of the American Mathematical Society. 29 (4): 983–1049. arXiv:1310.0425

Natural computing (5,191 words) [view diff] no match in snippet view article find links to article

Computing include the journals Natural Computing (Springer Verlag), Theoretical Computer Science, Series C: Theory of Natural Computing (Elsevier), the Natural

TC (complexity) (384 words) [view diff] no match in snippet view article

In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC (Threshold Circuit) is a complexity class

Ashok K. Chandra (411 words) [view diff] no match in snippet view article find links to article

Almaden Research Center. Chandra co-authored several key papers in theoretical computer science. Among other contributions, he introduced alternating Turing

Graph traversal (1,492 words) [view diff] no match in snippet view article find links to article

"An improved lower bound for competitive graph exploration". Theoretical Computer Science. 868: 65–86. arXiv:2002.10958. doi:10.1016/j.tcs.2021.04.003

Pseudorandom generator (1,864 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps

Longest path problem (2,662 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph.

Representer theorem (2,800 words) [view diff] no match in snippet view article find links to article

"When Is There a Representer Theorem? Vector Versus Matrix Regularizers". Journal of Machine Learning Research. 10 (Dec): 2507–2529. Cucker, Felipe; Smale

Automata theory (3,851 words) [view diff] no match in snippet view article find links to article

computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical

NC (complexity) (2,880 words) [view diff] no match in snippet view article

Retrieved 2021-11-11. Leeuwen, J. van, ed. (1990). Handbook of theoretical computer science. Amsterdam ; New York : Cambridge, Mass: Elsevier ; MIT Press

Turing Award (3,581 words) [view diff] no match in snippet view article find links to article

Manchester. Turing is often credited as being the founder of theoretical computer science and artificial intelligence, and a key contributor to the Allied

Language equation (1,127 words) [view diff] no match in snippet view article find links to article

regular languages, finite automata, and sequential networks". Theoretical Computer Science. 10 (1): 19–35. doi:10.1016/0304-3975(80)90069-9. ISSN 0304-3975

Computational science (3,387 words) [view diff] no match in snippet view article find links to article

simulation and other forms of computation from numerical analysis and theoretical computer science to solve problems in various scientific disciplines. The field

Unary numeral system (1,251 words) [view diff] no match in snippet view article find links to article

calculations. It occurs in some decision problem descriptions in theoretical computer science (e.g. some P-complete problems), where it is used to "artificially"

Algebraic specification (643 words) [view diff] no match in snippet view article find links to article

Klint, J. (1985). Algebraic Specification. EATCS Monographs on Theoretical Computer Science. Vol. 6. Springer-Verlag. Wirsing, Martin (1990). Jan van Leeuwen

Nominal terms (computer science) (800 words) [view diff] no match in snippet view article

Fernandez (2008). "A polynomial nominal unification algorithm". Theoretical Computer Science. 403 (2–3): 285–306. doi:10.1016/j.tcs.2008.05.012. Christophe

Semantic spacetime (1,335 words) [view diff] no match in snippet view article find links to article

doi:10.13140/RG.2.2.17170.53444. S2CID 247922612. {{cite journal}}: Cite journal requires |journal= (help) "Semantic Spacetime and Promise Theory of Autonomous

Sun–Ni law (1,687 words) [view diff] no match in snippet view article find links to article

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

Danqi Chen (353 words) [view diff] no match in snippet view article find links to article

acronym. She is married to Huacheng Yu, an assistant professor in theoretical computer science at Princeton University. "Danqi Chen's Homepage". cs.stanford

Verónica Becher (308 words) [view diff] no match in snippet view article find links to article

Argentinian computer scientist known for her work in logic and theoretical computer science. She is Full Professor at the University of Buenos Aires and

Solomon Marcus (881 words) [view diff] no match in snippet view article find links to article

scientific journals covering all his domains of interest. Marcus is featured in the 1999 book People and Ideas in Theoretical Computer Science. and the

Cook–Levin theorem (2,354 words) [view diff] no match in snippet view article find links to article

still widely considered the most important unsolved problem in theoretical computer science. The concept of NP-completeness was developed in the late 1960s

Komei Fukuda (390 words) [view diff] no match in snippet view article find links to article

geometry in the Department of Mathematics and in the Institute of Theoretical Computer Science at ETH Zurich. Fukuda studied administration engineering at Keio

Komei Fukuda (390 words) [view diff] no match in snippet view article find links to article

geometry in the Department of Mathematics and in the Institute of Theoretical Computer Science at ETH Zurich. Fukuda studied administration engineering at Keio

Greta Panova (472 words) [view diff] no match in snippet view article find links to article

Her research interests include combinatorics, probability and theoretical computer science. Panova received her B.S. in 2005 from MIT. She received M.A

Heavy-light decomposition (1,017 words) [view diff] no match in snippet view article find links to article

In combinatorial mathematics and theoretical computer science, heavy-light decomposition (also called heavy path decomposition) is a technique for decomposing

Dines Bjørner (685 words) [view diff] no match in snippet view article find links to article

Foundation for Software Development, Bjørner, D. Monographs in Theoretical Computer Science, An EATCS Series, Springer Nature. Hardcover ISBN 978-3-030-73483-1;

Small-bias sample space (2,439 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, a small-bias sample space (also known as ϵ {\displaystyle \epsilon } -biased sample space, ϵ {\displaystyle \epsilon }

Star height (1,352 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, more precisely in the theory of formal languages, the star height is a measure for the structural complexity of regular

Alan M. Frieze (1,274 words) [view diff] no match in snippet view article find links to article

research interests lie in combinatorics, discrete optimisation and theoretical computer science. Currently, he focuses on the probabilistic aspects of these

Closest string (849 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the closest string is an NP-hard computational problem, which tries to find the geometrical center of a set of input strings

Abstract rewriting system (2,000 words) [view diff] no match in snippet view article find links to article

In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviated

GNRS conjecture (893 words) [view diff] no match in snippet view article find links to article

bounded distortion? More unsolved problems in mathematics In theoretical computer science and metric geometry, the GNRS conjecture connects the theory

Quantum computing (12,416 words) [view diff] no match in snippet view article find links to article

company Supercomputer – Type of extremely powerful computer Theoretical computer science – Subfield of computer science and mathematics Unconventional

Valuation (measure theory) (999 words) [view diff] no match in snippet view article

finds applications in measure theory, probability theory, and theoretical computer science. Let ( X , T ) {\displaystyle \scriptstyle (X,{\mathcal {T}})}

EXPSPACE (648 words) [view diff] no match in snippet view article find links to article

covering and boundedness problems for vector addition systems". Theoretical Computer Science: 223–231. Lipton, R. (1976). "The Reachability Problem Requires

Thierry Coquand (514 words) [view diff] no match in snippet view article find links to article

both French and English. In addition to his contributions to theoretical computer science, Coquand is also known for being the co-creator of the Rocq (previously

Lambda calculus (11,994 words) [view diff] no match in snippet view article find links to article

"(In)Efficiency and Reasonable Cost Models". Electronic Notes in Theoretical Computer Science. 338: 23–43. doi:10.1016/j.entcs.2018.10.003. Asperti, Andrea

María Manzano (283 words) [view diff] no match in snippet view article find links to article

(1996), Extensions of First Order Logic, Cambridge Tracts in Theoretical Computer Science, vol. 19, Cambridge University Press, ISBN 0521354358 Manzano

Solomonoff's theory of inductive inference (2,104 words) [view diff] no match in snippet view article find links to article

introduced by Ray Solomonoff, based on probability theory and theoretical computer science. In essence, Solomonoff's induction derives the posterior probability

Geometric complexity theory (472 words) [view diff] no match in snippet view article find links to article

program is pursued by several researchers in mathematics and theoretical computer science. Part of the reason for the interest in the program is the existence

Granular computing (5,242 words) [view diff] no match in snippet view article find links to article

"Information synthesis based on hierarchical maximum entropy discretization", Journal of Experimental and Theoretical Artificial Intelligence, 2 (2): 117–129

Algorithmica (180 words) [view diff] no match in snippet view article find links to article

Algorithms Algorithms (journal) Discrete Mathematics & Theoretical Computer Science Home page. Springer Science+Business Media. 2013 "Journal Rankings". CORE:

Recursion (computer science) (7,388 words) [view diff] no match in snippet view article

Algorithm". Dr. Dobb's Journal. Mueller, Oliver (2012). "Anatomy of a Stack Smashing Attack and How GCC Prevents It". Dr. Dobb's Journal. "StackOverflowException

Metric k-center (3,613 words) [view diff] no match in snippet view article find links to article

is a classical combinatorial optimization problem studied in theoretical computer science that is NP-hard. Given n cities with specified distances, one

Disjoint sets (1,291 words) [view diff] no match in snippet view article find links to article

Moll, Robert N. (1981), A Basis for Theoretical Computer Science, The AKM series in Theoretical Computer Science: Texts and monographs in computer science

Corecursion (4,184 words) [view diff] no match in snippet view article find links to article

Moss; Norman Danner (1997). "On the Foundations of Corecursion". Logic Journal of the IGPL. 5 (2): 231–257. CiteSeerX 10.1.1.40.4243. doi:10.1093/jigpal/5

Analysis of Boolean functions (5,379 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on { 0 , 1 } n {\displaystyle \{0

Nyquist–Shannon sampling theorem (6,721 words) [view diff] no match in snippet view article find links to article

1948). "A Mathematical Theory of Communication". Bell System Technical Journal. 27 (3): 379–423. doi:10.1002/j.1538-7305.1948.tb01338.x.

Extensions of First Order Logic (591 words) [view diff] no match in snippet view article find links to article

Press as volume 19 of their book series Cambridge Tracts in Theoretical Computer Science. The book concerns forms of logic that go beyond first-order

Vineet Bafna (358 words) [view diff] no match in snippet view article find links to article

post-doctoral researcher at Center for Discrete Mathematics and Theoretical Computer Science. From 1999 to 2002, he worked at Celera Genomics, ultimately

P versus NP problem (7,784 words) [view diff] no match in snippet view article find links to article

science The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can

Counter machine (4,660 words) [view diff] no match in snippet view article find links to article

automaton is an abstract machine used in a formal logic and theoretical computer science to model computation. It is the most primitive of the four types

Quantum machine learning (10,788 words) [view diff] no match in snippet view article find links to article

learning: Finding a N-bit Boolean function for a classification". New Journal of Physics. 16 (10): 103014. arXiv:1303.6055. Bibcode:2014NJPh...16j3014Y

Smoothed analysis (1,727 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis

Compressed data structure (471 words) [view diff] no match in snippet view article find links to article

computer science subfields of algorithms, data structures, and theoretical computer science. It refers to a data structure whose operations are roughly as

Alan Turing (15,053 words) [view diff] no match in snippet view article find links to article

theoretical biologist. He was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation

Monoid (4,462 words) [view diff] no match in snippet view article find links to article

foundation for process calculi and concurrent computing. In theoretical computer science, the study of monoids is fundamental for automata theory (Krohn–Rhodes

Pierre-Yves Oudeyer (294 words) [view diff] no match in snippet view article find links to article

Computer Science Laboratory for 8 years (1999-2007). He studied theoretical computer science at Ecole Normale Supérieure in Lyon, and received his Ph.D. degree

Conductance (graph theory) (1,407 words) [view diff] no match in snippet view article

In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its mixing time

NFA minimization (180 words) [view diff] no match in snippet view article find links to article

In automata theory (a branch of theoretical computer science), NFA minimization is the task of transforming a given nondeterministic finite automaton (NFA)

Colour refinement algorithm (899 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, the colour refinement algorithm also known as the naive vertex classification, or the 1-dimensional version

Michael J. Fischer (1,043 words) [view diff] no match in snippet view article find links to article

Soviet mathematicians. Fischer has done multifaceted work in theoretical computer science in general. Fischer's early work, including his PhD thesis, focused

Javier Esparza (803 words) [view diff] no match in snippet view article find links to article

Universität München (1994–2001). He was then successively Chair of Theoretical Computer Science at the University of Edinburgh (2001–2003) and Chair of Software

Antonio Monteiro (mathematician) (1,023 words) [view diff] no match in snippet view article

Nacional del Sur, Bahía Blanca, Argentina. His efforts to promote theoretical computer science research in Argentina were less successful. After his undergraduate

Regular tree grammar (1,300 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms

Ronen Eldan (441 words) [view diff] no match in snippet view article find links to article

Science working on probability theory, mathematical analysis, theoretical computer science and the theory of machine learning. He received the 2018 Erdős

List of NP-complete problems (2,746 words) [view diff] no match in snippet view article find links to article

(24 June 2020). "NP-completeness of the game KingdominoTM". Theoretical Computer Science. 822: 23–35. doi:10.1016/j.tcs.2020.04.007. ISSN 0304-3975. S2CID 218552723

Promise theory (2,212 words) [view diff] no match in snippet view article find links to article

118. Burgess, Mark (October 2014). "Promise theory - what is it?". Linux Journal. A static theory of promises (Report). 2014. arXiv:0810.3294. "Voluntary

Ted Hurley (1,428 words) [view diff] no match in snippet view article find links to article

Schellekens and Anthony Seda. Elsevier Science (Electronic Notes in Theoretical Computer Science, Vol 40) The Second Irish Conference on the Mathematical Foundations

Paritosh Pandya (410 words) [view diff] no match in snippet view article find links to article

TIFR, where he has spent most of his career. Pandya leads the Theoretical Computer Science Group there. Pandya's main research interest is in the area of

Informatics (2,870 words) [view diff] no match in snippet view article find links to article

Association Computability in Europe European Association for Theoretical Computer Science Raspberry Pi Foundation Information School at University of Washington

List of Israeli inventions and discoveries (5,682 words) [view diff] no match in snippet view article find links to article

Multiplexing over IP (TDMoIP)". doi:10.17487/RFC5087. {{cite journal}}: Cite journal requires |journal= (help) "A Historical Journey into the VoIP Industry with

One-way function (1,956 words) [view diff] no match in snippet view article find links to article

not equal, thus resolving the foremost unsolved question of theoretical computer science.: ex. 2.2, page 70 The converse is not known to be true, i.e

Knaster–Tarski theorem (2,426 words) [view diff] no match in snippet view article find links to article

dual theorem holds for the greatest fixpoint. For example, in theoretical computer science, least fixed points of monotonic functions are used to define

Gennady Simeonovich Osipov (1,034 words) [view diff] no match in snippet view article find links to article

2020) was a Russian scientist, holding a Ph.D. and a Dr. Sci. in theoretical computer science, information technologies and artificial intelligence. He was

Session type (898 words) [view diff] no match in snippet view article find links to article

Deadlock-free Sessions with Failure in Rust". Electronic Proceedings in Theoretical Computer Science. 304: 48–60. arXiv:1909.05970. doi:10.4204/EPTCS.304.4. ISSN 2075-2180

Graph isomorphism problem (4,214 words) [view diff] no match in snippet view article find links to article

polynomial-time computation". DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 11. Providence, Rhode Island: American Mathematical Society

Minimum description length (2,929 words) [view diff] no match in snippet view article find links to article

been further developed within the general fields of statistics, theoretical computer science and machine learning, and more narrowly computational learning

Allan Borodin (465 words) [view diff] no match in snippet view article find links to article

Association for Computing Machinery in 2014 "For contributions to theoretical computer science in complexity, on-line algorithms, resource tradeoffs, and models

Jasmin Blanchette (163 words) [view diff] no match in snippet view article find links to article

Blanchette is a computer scientist working as a professor of theoretical computer science at the Ludwig Maximilian University of Munich. Blanchette earned

Strong product of graphs (1,316 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR 2193130

Isolation lemma (1,903 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the term isolation lemma (or isolating lemma) refers to randomized algorithms that reduce the number of solutions to a

Independent set (graph theory) (3,561 words) [view diff] no match in snippet view article

approximation classes: Poly-(D)APX- and (D)PTAS-completeness". Theoretical Computer Science. 339 (2–3): 272–292. doi:10.1016/j.tcs.2005.03.007. S2CID 1418848

Formal grammar (3,472 words) [view diff] no match in snippet view article find links to article

branch of applied mathematics. Its applications are found in theoretical computer science, theoretical linguistics, formal semantics, mathematical logic

Canada/USA Mathcamp (692 words) [view diff] no match in snippet view article find links to article

classes cover advanced topics in abstract algebra, topology, theoretical computer science, category theory, and mathematical analysis. There are generally

Quantum image processing (2,780 words) [view diff] no match in snippet view article find links to article

designing geometric transformations on quantum images" (PDF). Theoretical Computer Science. 412 (15): 1406–1418. doi:10.1016/j.tcs.2010.11.029. Wang, J

NP-completeness (3,617 words) [view diff] no match in snippet view article find links to article

Handbook of Theoretical Computer Science. Elsevier. p. 84. ISBN 978-0-262-72014-4. J. van Leeuwen (1998). Handbook of Theoretical Computer Science. Elsevier

Occurs check (876 words) [view diff] no match in snippet view article find links to article

Science. 46: 141–158. doi:10.1016/0304-3975(86)90027-7. B. Courcelle (1983). "Fundamental Properties of Infinite Trees". Theoretical Computer Science

Juris Hartmanis (2,513 words) [view diff] no match in snippet view article find links to article

1977 (with L. Berman) "Observations about the development of theoretical computer science" 1981 "Gödel, von Neumann, and the P =? NP problem" 1989 Juris

Quasi-polynomial growth (727 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, a function f ( n ) {\displaystyle f(n)} is said to exhibit quasi-polynomial growth when it has an upper bound of the form

Pebble game (763 words) [view diff] no match in snippet view article find links to article

automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science. Basel: Birkhäuser. pp. 39–44. ISBN 3-7643-3719-2. Zbl 0816.68086

Gunther Schmidt (1,094 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science, Springer Verlag, ISBN 3-540-56254-0 2011: Relational Mathematics

Mihalis Yannakakis (1,448 words) [view diff] no match in snippet view article find links to article

was awarded the seventh Knuth prize for his contributions to theoretical computer science. He has also been awarded the Bell Labs Distinguished Member

Log-rank conjecture (469 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially

Glossary of quantum computing (5,490 words) [view diff] no match in snippet view article find links to article

doi:10.1038/s41586-021-03928-y. PMID 34608286. S2CID 238357892.{{cite journal}}: CS1 maint: multiple names: authors list (link) Michael Nielsen and Isaac

Induced subgraph isomorphism problem (624 words) [view diff] no match in snippet view article find links to article

"The subgraph isomorphism problem for outerplanar graphs", Theoretical Computer Science, 17 (1): 91–97, doi:10.1016/0304-3975(82)90133-5, MR 0644795

Zone theorem (1,041 words) [view diff] no match in snippet view article find links to article

from the DIMACS Special Year, DIMACS Ser. Discrete Math. and Theoretical Computer Science, vol. 6, Amer. Math. Soc., pp. 45–66, MR 1143288. Chazelle, B

S. Muthukrishnan (computer scientist) (286 words) [view diff] no match in snippet view article

the organizer of the Big Data Program at the Simons Center for Theoretical Computer Science. Muthukrishnan was inducted as an ACM Fellow in 2010 "For contributions

Atulya Nagar (2,428 words) [view diff] no match in snippet view article find links to article

University. Nagar's research spans nonlinear mathematical analysis, theoretical computer science, and systems engineering, and addressing complex problems across

Dominance-based rough set approach (4,321 words) [view diff] no match in snippet view article find links to article

R.: Rough sets theory for multi-criteria decision analysis. European Journal of Operational Research, 129, 1 (2001) 1–47 Greco, S., Matarazzo, B., Słowiński

PSPACE-complete (1,564 words) [view diff] no match in snippet view article find links to article

polynomial-time Turing and many-one completeness in PSPACE", Theoretical Computer Science, 97 (2): 199–215, doi:10.1016/0304-3975(92)90074-P, MR 1163815

Kleene algebra (2,213 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical computer science, a Kleene algebra (/ˈkleɪni/ KLAY-nee; named after Stephen Cole Kleene) is a semiring that generalizes

Oded Goldreich (1,378 words) [view diff] no match in snippet view article find links to article

prize in 2017 for "fundamental and lasting contributions to theoretical computer science in many areas including cryptography, randomness, probabilistically

Joseph S. B. Mitchell (414 words) [view diff] no match in snippet view article find links to article

the journals Discrete and Computational Geometry, Computational Geometry: Theory and Applications, Journal of Computational Geometry, and the Journal of

K-server problem (1,290 words) [view diff] no match in snippet view article find links to article

problems in computer science The k-server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems

Gonzalo Navarro (876 words) [view diff] no match in snippet view article find links to article

included in the Virtual Special Issue "40th Anniversary of Theoretical Computer Science -- Top Cited Articles: 1975–2014", which collects the most cited

ACM SIGLOG (470 words) [view diff] no match in snippet view article find links to article

ISSN 1079-8986. "Alonzo Church Award". European Association for Theoretical Computer Science. Retrieved 2022-04-23. "Previous Awards – EACSL". Retrieved 2021-11-13

Maximum common induced subgraph (951 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, a maximum common induced subgraph of two graphs G and H is a graph that is an induced subgraph of both

♯P-complete (849 words) [view diff] no match in snippet view article find links to article

Valiant (1979). "The Complexity of Computing the Permanent". Theoretical Computer Science. 8 (2). Elsevier: 189–201. doi:10.1016/0304-3975(79)90044-6.

Pushdown automaton (4,142 words) [view diff] no match in snippet view article find links to article

In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown

Deterministic finite automaton (3,736 words) [view diff] no match in snippet view article find links to article

In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor

Constantinos Daskalakis (811 words) [view diff] no match in snippet view article find links to article

He also received the Simons Foundation Investigator award in Theoretical Computer Science, an award designed for "outstanding scientists in their most

Cheeger constant (graph theory) (873 words) [view diff] no match in snippet view article

has "many" links between those two subsets. In applications to theoretical computer science, one wishes to devise network configurations for which the Cheeger

Outline of combinatorics (683 words) [view diff] no match in snippet view article find links to article

Mathematics & Theoretical Computer Science Discrete Optimization Discussiones Mathematicae Graph Theory Electronic Journal of Combinatorics European Journal of Combinatorics

Anatol Slissenko (1,869 words) [view diff] no match in snippet view article find links to article

D.; Matiyasevich, Yu. (2003). "Biography of A.O. Slissenko". Theoretical Computer Science. 303: 3–5. "Mathematics & Mechanics Faculty of St. Petersburg

Hadas Shachnai (289 words) [view diff] no match in snippet view article find links to article

Technology, and co-editor-in-chief of Discrete Mathematics & Theoretical Computer Science. Shachnai completed her Ph.D. in 1991 at the Technion. Her doctoral

Empirical algorithmics (1,220 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics and Theoretical Computer Science. Vol. 59. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. pp. 197–213. doi:10

Enumerations of specific permutation classes (1,372 words) [view diff] no match in snippet view article find links to article

{1243, 2134}-avoiding permutations", Discrete Mathematics & Theoretical Computer Science, arXiv:1303.3857, Bibcode:2013arXiv1303.3857C, doi:10.46298/dmtcs

Certifying algorithm (666 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, a certifying algorithm is an algorithm that outputs, together with a solution to the problem it solves, a proof that the

Rosi Sexton (2,244 words) [view diff] no match in snippet view article find links to article

2000 from the University of Manchester and eventually a PhD in theoretical computer science. She began her professional mixed martial arts (MMA) career in

Bron–Kerbosch algorithm (2,134 words) [view diff] no match in snippet view article find links to article

(2008), "A note on the problem of reporting maximal cliques", Theoretical Computer Science, 407 (1): 564–568, doi:10.1016/j.tcs.2008.05.010. Eppstein, David;

Semi-Thue system (3,406 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over

Exact cover (4,328 words) [view diff] no match in snippet view article find links to article

network-based biocomputation circuits for the exact cover problem". New Journal of Physics. 23 (8): 085004. Bibcode:2021NJPh...23h5004K. doi:10.1088/1367-2630/ac175d

Rough set (8,170 words) [view diff] no match in snippet view article find links to article

"Rough sets: Probabilistic versus deterministic approach". International Journal of Man-Machine Studies. 29 (1): 81–95. doi:10.1016/S0020-7373(88)80032-4

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] no match in snippet view article find links to article

conjecture. More unsolved problems in computer science In theoretical computer science, the Aanderaa–Karp–Rosenberg conjecture (also known as the Aanderaa–Rosenberg

Gordon Plotkin (786 words) [view diff] no match in snippet view article find links to article

Relations for Polymorphic and Recursive Types". Electronic Notes in Theoretical Computer Science. 172: 259. doi:10.1016/j.entcs.2007.02.010. Curien, Pierre-Louis

Baruch Schieber (835 words) [view diff] no match in snippet view article find links to article

Journal of Algorithms from 1998 to 2003. He was also a member of the executive board at the Center for Discrete Mathematics and Theoretical Computer Science

Patrick C. Fischer (1,072 words) [view diff] no match in snippet view article find links to article

the field of computational complexity, and helped establish theoretical computer science as a discipline separate from mathematics and electrical engineering

Stathis Zachos (601 words) [view diff] no match in snippet view article find links to article

Distrustful adversaries". Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 287. pp. 443–455. doi:10

Brzozowski derivative (1,362 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, in particular in formal language theory, the Brzozowski derivative u − 1 S {\displaystyle u^{-1}S} of a set S {\displaystyle

Premonoidal category (644 words) [view diff] no match in snippet view article find links to article

continuity in topology. Premonoidal categories naturally arise in theoretical computer science as the Kleisli categories of strong monads. They also have a

Dinic's algorithm (1,693 words) [view diff] no match in snippet view article find links to article

Oded Goldreich; Arnold L. Rosenberg; Alan L. Selman (eds.). Theoretical Computer Science: Essays in Memory of Shimon Even. Lecture Notes in Computer Science

Parikh's theorem (2,118 words) [view diff] no match in snippet view article find links to article

Parikh's theorem in theoretical computer science says that if one looks only at the number of occurrences of each terminal symbol in a context-free language

List of open-access journals (962 words) [view diff] no match in snippet view article find links to article

Contemporanea Australasian Journal of Combinatorics Discrete Analysis Discrete Mathematics & Theoretical Computer Science Documenta Mathematica Electronic

Nucleic acid design (2,110 words) [view diff] no match in snippet view article find links to article

Anne (2002). "Strand design for biomolecular computation". Theoretical Computer Science. 287: 39–58. doi:10.1016/S0304-3975(02)00135-4. Dirks, Robert

Giovanni Pighizzini (358 words) [view diff] no match in snippet view article find links to article

two-way nondeterministic unary automata into simpler automata". Theoretical Computer Science. 295 (1–3): 189–203. doi:10.1016/S0304-3975(02)00403-6. ISSN 0304-3975

Unavoidable pattern (2,906 words) [view diff] no match in snippet view article find links to article

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

Tag system (2,134 words) [view diff] no match in snippet view article find links to article

complexity of small universal Turing machines: A survey" (PDF). Theoretical Computer Science. Computational Paradigms from Nature. 410 (4): 443–450. doi:10

Planarity testing (1,818 words) [view diff] no match in snippet view article find links to article

Shimon; Tarjan, Robert E. (1976), "Computing an st-numbering", Theoretical Computer Science, 2 (3): 339–344, doi:10.1016/0304-3975(76)90086-4. Boyer & Myrvold

German Association for Mathematical Logic and for Basic Research in the Exact Sciences (900 words) [view diff] no match in snippet view article find links to article

researchers in Mathematical Logic, Philosophical Logic, and Theoretical Computer Science. Biannually, the DVMLG organises the Colloquium Logicum, an international

Square-free word (2,382 words) [view diff] no match in snippet view article find links to article

Arturo (1988). "Multidimensional unrepetitive configurations". Theoretical Computer Science. 56 (2): 233–241. doi:10.1016/0304-3975(88)90080-1. ISSN 0304-3975

Selman's theorem (1,201 words) [view diff] no match in snippet view article find links to article

Joseph S. (2004). "Degrees of Unsolvability of Continuous Functions" (PDF). Journal of Symbolic Logic. 69 (2): 555–584. doi:10.2178/jsl/1082418543. Retrieved

Jeffrey Vitter (1,415 words) [view diff] no match in snippet view article find links to article

Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008, ISBN 978-1-60198-106-6. J

William Gasarch (714 words) [view diff] no match in snippet view article find links to article

Problems with a Point, a book with a broad view on mathematics and theoretical computer science which he co-authored with Clyde Kruskal and includes works by

Interpretation (logic) (4,478 words) [view diff] no match in snippet view article

language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have

Regular expression (8,860 words) [view diff] no match in snippet view article find links to article

input validation. Regular expression techniques are developed in theoretical computer science and formal language theory. The concept of regular expressions

Gérard Huet (1,136 words) [view diff] no match in snippet view article find links to article

Unification Algorithm for Typed Lambda-Calculus", Gerard P. Huet, Theoretical Computer Science 1 (1975), 27-57 Gérard Huet (Sep 1976). Resolution d'Equations

Gérard Huet (1,136 words) [view diff] no match in snippet view article find links to article

Unification Algorithm for Typed Lambda-Calculus", Gerard P. Huet, Theoretical Computer Science 1 (1975), 27-57 Gérard Huet (Sep 1976). Resolution d'Equations

ZX-calculus (2,748 words) [view diff] no match in snippet view article find links to article

ZX-calculus complete for scalars". Electronic Proceedings in Theoretical Computer Science. 195: 17–32. arXiv:1507.03854. Bibcode:2015arXiv150703854B. doi:10

Pursuit–evasion (1,322 words) [view diff] no match in snippet view article find links to article

"An annotated bibliography on guaranteed graph searching". Theoretical Computer Science. 399 (3): 236–245. doi:10.1016/j.tcs.2008.02.040. Kirousis, M

Game complexity (2,837 words) [view diff] no match in snippet view article find links to article

an n × n {\displaystyle n\times n} board is PSPACE-complete". Theoretical Computer Science. 123 (2): 329–340. doi:10.1016/0304-3975(94)90131-7. MR 1256205

Categorical quantum mechanics (2,203 words) [view diff] no match in snippet view article find links to article

complete for dagger compact closed categories". Electronic Notes in Theoretical Computer Science. 270 (1): 113–9. CiteSeerX 10.1.1.749.4436. doi:10.1016/j.entcs

Stephen Cook (1,540 words) [view diff] no match in snippet view article find links to article

origin of SC". Theoretical Computer Science – Stack Exchange. "Who introduced the complexity class AC?". Theoretical Computer Science – Stack Exchange

Zvi Galil (2,080 words) [view diff] no match in snippet view article find links to article

research in theoretical computer science. He served as managing editor of SIAM Journal on Computing from 1991 to 1997 and editor in chief of Journal of Algorithms

Indian Statistical Institute (5,765 words) [view diff] no match in snippet view article find links to article

sciences. Key areas of research at ISI are statistics, mathematics, theoretical computer science and mathematical economics. It is one of the few research oriented

Alfred Aho (1,760 words) [view diff] no match in snippet view article find links to article

(1990). "Algorithms for Finding Patterns in Strings". Handbook of Theoretical Computer Science. MIT Press. pp. 255–300. "IT news, careers, business technology

Girth (graph theory) (903 words) [view diff] no match in snippet view article

Optimal algorithm for finding the girth of a sparse graph?". Theoretical Computer Science Stack Exchange. Retrieved 2023-02-22. Chang, Hsien-Chih; Lu,

Power of three (894 words) [view diff] no match in snippet view article find links to article

generating all maximal cliques and computational experiments", Theoretical Computer Science, 363 (1): 28–42, doi:10.1016/j.tcs.2006.06.015 For the Brouwer–Haemers

Quadratic unconstrained binary optimization (2,635 words) [view diff] no match in snippet view article find links to article

is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem,

Science (15,544 words) [view diff] no match in snippet view article find links to article

as the formal sciences, the study of logic, mathematics, and theoretical computer science (which study formal systems governed by axioms and rules) are

Robert M. Solovay (526 words) [view diff] no match in snippet view article find links to article

the P=?NP question over the reals (and other ordered rings)". Theoretical Computer Science. 133 (1): 15–22. doi:10.1016/0304-3975(94)00068-9. ISSN 0304-3975

Michael Fellows (1,630 words) [view diff] no match in snippet view article find links to article

one of ten inaugural fellows of the European Association for Theoretical Computer Science. Also in 2014, he was named an Honorary Fellow of the Royal Society

Warren Goldfarb (369 words) [view diff] no match in snippet view article find links to article

Undecidability of the Second-Order Unification Problem" (PDF). Theoretical Computer Science. 13: 225–230. 1981. doi:10.1016/0304-3975(81)90040-2. Harvard

Thomas Colcombet (297 words) [view diff] no match in snippet view article find links to article

Thomas (2006). "Tree-walking automata cannot be determinized". Theoretical Computer Science. 350 (2–3): 164–173. doi:10.1016/j.tcs.2005.10.031. ISSN 0304-3975

Abstract rewriting machine (545 words) [view diff] no match in snippet view article find links to article

and Context-Sensitive Rewriting" (PDF). Electronic Notes in Theoretical Computer Science. 64: 234–254. CiteSeerX 10.1.1.14.3470. doi:10.1016/S1571-0661(04)80353-0

Concurrency (computer science) (1,420 words) [view diff] no match in snippet view article

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

Kai Salomaa (370 words) [view diff] no match in snippet view article find links to article

Yu, Sheng (2007). "State complexity of combined operations". Theoretical Computer Science. 383 (2–3): 140–152. doi:10.1016/j.tcs.2007.04.015. ISSN 0304-3975

Communication complexity (6,853 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem

Joseph Halpern (284 words) [view diff] no match in snippet view article find links to article

Prize in theoretical computer science and the 2009 Dijkstra Prize in distributed computing. From 1997 to 2003, he was editor-in-chief of the Journal of the

Mehryar Mohri (330 words) [view diff] no match in snippet view article find links to article

Combinatorics. Foundations of Machine Learning, MIT Press. [1] Theoretical Computer Science at Courant. [2] Google Research's Learning Theory Team. [3] Mohri's

Donald Knuth (6,279 words) [view diff] no match in snippet view article find links to article

addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system

Gilles Brassard (807 words) [view diff] no match in snippet view article find links to article

"Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. arXiv:2003.06557. doi:10.1016/j.tcs.2014.05.025.

Indexed language (695 words) [view diff] no match in snippet view article find links to article

Robert H. (1996). "A Shrinking Lemma for Indexed Languages". Theoretical Computer Science. 163 (1–2): 277–281. arXiv:math/9509205. doi:10.1016/0304-3975(96)00244-7

Peter O'Hearn (1,087 words) [view diff] no match in snippet view article find links to article

July 2016). "2016 Gödel Prize". EATCS. European Association for Theoretical Computer Science. "Royal Academy Fellows 2016". Archived from the original on

Minimum evolution (2,437 words) [view diff] no match in snippet view article find links to article

Evolution Problem. Theoretical Computer Science, 596, 77–90. Chor, B., Hendy, M. D., & Snir, S. (2006). Minimum-entropy phylogenetic trees. Journal of Computational

Travelling salesman problem (11,621 words) [view diff] no match in snippet view article find links to article

NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem, the

PCP theorem (1,770 words) [view diff] no match in snippet view article find links to article

Larry (2012-07-30). "MIT News Release: 10-year-old problem in theoretical computer science falls". MIT News Office. Archived from the original on 2014-02-02

John V. Tucker (1,569 words) [view diff] no match in snippet view article find links to article

Computer Science at Swansea University in 1989. In addition to theoretical computer science, Tucker also lectures on the history of computing and on the

List of unsolved problems in mathematics (20,026 words) [view diff] no match in snippet view article find links to article

walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1): 129–156. doi:10.1016/S0304-3975(03)00080-X. S2CID 33806100

Currying (5,025 words) [view diff] no match in snippet view article find links to article

managing how arguments are passed to functions and exceptions. In theoretical computer science, it provides a way to study functions with multiple arguments

Deepak Kapur (1,921 words) [view diff] no match in snippet view article find links to article

Narendran, P.; Stillman, J. (1991). "Semi-unification". Journal of Theoretical Computer Science. 81 (2): 169–187. CiteSeerX 10.1.1.90.1272. doi:10

Hybrid automaton (917 words) [view diff] no match in snippet view article find links to article

1996. Alur, R. and Dill, D. L. "A Theory of Timed Automata". Theoretical Computer Science (TCS), 126(2), pages 183-235, 1995. Henzinger, Thomas A.; Kopke

Algorithmic Lovász local lemma (2,501 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the algorithmic Lovász local lemma gives an algorithmic way of constructing objects that obey a system of constraints

Multiparty communication complexity (1,175 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, multiparty communication complexity is the study of communication complexity in the setting where there are more than

Multiparty communication complexity (1,175 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, multiparty communication complexity is the study of communication complexity in the setting where there are more than

Computable number (3,269 words) [view diff] no match in snippet view article find links to article

Hoeven, Joris (2006). "Computations with effective real numbers". Theoretical Computer Science. 351 (1): 52–60. doi:10.1016/j.tcs.2005.09.060. Aberth, Oliver

Church–Turing thesis (6,820 words) [view diff] no match in snippet view article find links to article

Peter (1990). "Machine Models and Simulations". Handbook of Theoretical Computer Science A. Elsevier. p. 5. Slot, C.; van Emde Boas, P. (December 1984)

Type theory (8,246 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical computer science, a type theory is the formal presentation of a specific type system. Type theory is the academic study

Sergio Rajsbaum (1,049 words) [view diff] no match in snippet view article find links to article

Mexico) is a Mexican computer scientist, working in the field of Theoretical Computer Science, specifically concurrent and distributed computing. He is a Professor

Average-case complexity (2,834 words) [view diff] no match in snippet view article find links to article

Trevisan, "Average-Case Complexity," Foundations and Trends in Theoretical Computer Science, Vol. 2, No 1 (2006) 1–106. D. Knuth, The Art of Computer Programming

Busy beaver (7,914 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that (depending on definition) either produces

Alternating sign matrix (913 words) [view diff] no match in snippet view article find links to article

faces of alternating-sign matrices, Discrete Mathematics and Theoretical Computer Science, Special issue on Discrete Models: Combinatorics, Computation

Splay tree (4,628 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics and Theoretical Computer Science. Vol. 7. Center for Discrete Mathematics and Theoretical Computer Science. pp. 95–124. ISBN 0-8218-7111-0

Rotation distance (2,163 words) [view diff] no match in snippet view article find links to article

In discrete mathematics and theoretical computer science, the rotation distance between two binary trees with the same number of nodes is the minimum number

Quantum Turing machine (1,105 words) [view diff] no match in snippet view article find links to article

(2003). "One Complexity Theorist's View of Quantum Computing". Theoretical Computer Science. 292 (3): 597–610. arXiv:quant-ph/0003035. doi:10.1016/S0304-3975(01)00377-2

Noncommutative signal-flow graph (1,654 words) [view diff] no match in snippet view article find links to article

automata theory and control theory, branches of mathematics, theoretical computer science and systems engineering, a noncommutative signal-flow graph is

Symmetric Turing machine (610 words) [view diff] no match in snippet view article find links to article

space-bounded computation. Theoretical Computer Science. pp.161-187. 1982. Reingold, Omer (2008), "Undirected connectivity in log-space", Journal of the ACM, 55 (4):

Genetic algorithm (8,045 words) [view diff] no match in snippet view article find links to article

algorithms". Theoretical Computer Science. 208: 111–148. Schmitt, Lothar M. (2001). "Theory of Genetic Algorithms". Theoretical Computer Science. 259 (1–2):

Michael Barr (mathematician) (461 words) [view diff] no match in snippet view article

Computer Science and the electronic journal Homology, Homotopy and Applications, and is editor of the electronic journal Theory and Applications of Categories

LOOP (programming language) (2,096 words) [view diff] no match in snippet view article

Programming Languages and Restricted Classes of Turing Machines". Theoretical Computer Science. 26 (1–2): 197–220. doi:10.1016/0304-3975(83)90085-3. Kfoury

Linear search problem (735 words) [view diff] no match in snippet view article find links to article

Shmuel (September 2006), "Online searching with turn cost", Theoretical Computer Science, 361 (2–3): 342–355, arXiv:cs/0406045, doi:10.1016/j.tcs.2006

Graph algebra (622 words) [view diff] no match in snippet view article find links to article

"On congruences of automata defined by directed graphs" (PDF). Theoretical Computer Science. 301 (1–3): 31–43. doi:10.1016/S0304-3975(02)00544-3. ISSN 0304-3975

Flip distance (1,409 words) [view diff] no match in snippet view article find links to article

In discrete mathematics and theoretical computer science, the flip distance between two triangulations of the same point set is the number of flips required

King's graph (647 words) [view diff] no match in snippet view article find links to article

Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR 2193130

Logical framework (965 words) [view diff] no match in snippet view article find links to article

Pym. Proof-search in type-theoretic languages:an introduction. Theoretical Computer Science 232 (2000) 5-53. Philippa Gardner. Representing Logics in Type

Graph automorphism (1,343 words) [view diff] no match in snippet view article find links to article

Peter; Lin, Xuemin (2000), "Spring algorithms and symmetry", Theoretical Computer Science, 240 (2): 379–405, doi:10.1016/S0304-3975(99)00239-X. Hong, Seok-Hee

Wolfgang Haken (574 words) [view diff] no match in snippet view article find links to article

story Haken, Armin (1985), "The intractability of resolution", Theoretical Computer Science, 39: 297–308, doi:10.1016/0304-3975(85)90144-6 Appel, Kenneth;

Semantic Web Rule Language (1,031 words) [view diff] no match in snippet view article find links to article

"Interpreting SWRL Rules in RDF Graphs" (PDF). Electronic Notes in Theoretical Computer Science. 151 (2). Elsevier: 53–69. doi:10.1016/j.entcs.2005.07.036. S2CID 14325289

Common knowledge (887 words) [view diff] no match in snippet view article find links to article

and Artificial Intelligence, volume 41, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1995. ISBN 0-521-46014-X Stalnaker

Sanjeev Arora (433 words) [view diff] no match in snippet view article find links to article

(2009). "Expander flows, geometric embeddings and graph partitioning". Journal of the ACM. 56 (2): 1–37. CiteSeerX 10.1.1.310.2258. doi:10.1145/1502793

Computers and Intractability (779 words) [view diff] no match in snippet view article find links to article

received positive reviews by reputed researchers in the area of theoretical computer science. In his review, Ronald V. Book recommends the book to "anyone

List of pioneers in computer science (1,578 words) [view diff] no match in snippet view article find links to article

System Technical Journal". Bell System Technical Journal. Wilkinson, J. H. (1971). "Some Comments from a Numerical Analyst". Journal of the ACM. 18 (2):

Joseph Sifakis (1,101 words) [view diff] no match in snippet view article find links to article

February 1995). "The algorithmic analysis of hybrid systems". Theoretical Computer Science. 138 (1): 3–34. doi:10.1016/0304-3975(94)00202-T. ISSN 0304-3975

Health informatics (12,745 words) [view diff] no match in snippet view article find links to article

information engineering, bioinformatics, bio-inspired computing, theoretical computer science, information systems, data science, information technology, autonomic

Brooks' theorem (929 words) [view diff] no match in snippet view article find links to article

Theoretical Computer Science, 68 (1): 89–103, doi:10.1016/0304-3975(89)90121-7. Lovász, L. (1975), "Three short proofs in graph theory", Journal of Combinatorial

Turochamp (2,102 words) [view diff] no match in snippet view article find links to article

biologist. Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation

Substitution (logic) (2,938 words) [view diff] no match in snippet view article

Jan van Leeuwen (ed.). Algebraic Specification. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 675–788., here: p. 682. From a term algebra

Minimum relevant variables in linear system (1,053 words) [view diff] no match in snippet view article find links to article

nonzero variables or unsatisfied relations in linear systems". Theoretical Computer Science. 209 (1–2): 237–260. doi:10.1016/S0304-3975(97)00115-1. Garey

Thoralf Skolem (1,513 words) [view diff] no match in snippet view article find links to article

about the objects, Skolem can be seen as an unwitting pioneer of theoretical computer science. In 1929, Presburger proved that Peano arithmetic without multiplication

Peter Aczel (427 words) [view diff] no match in snippet view article find links to article

Dame Journal of Formal Logic and the Cambridge Tracts in Theoretical Computer Science, having previously served on the editorial boards of the Journal of

Sheila Greibach (1,353 words) [view diff] no match in snippet view article find links to article

(as of March 2014). Her areas of interest and research include Theoretical computer science, Computational complexity, Program schemes and semantics, Formal

Natural proof (767 words) [view diff] no match in snippet view article find links to article

to P vs. NP" (PDF). Bulletin of the European Association for Theoretical Computer Science. 78: 86–97. A. A. Razborov (2004). "Feasible Proofs and Computations:

Thoralf Skolem (1,513 words) [view diff] no match in snippet view article find links to article

about the objects, Skolem can be seen as an unwitting pioneer of theoretical computer science. In 1929, Presburger proved that Peano arithmetic without multiplication

Hilbert basis (linear programming) (471 words) [view diff] no match in snippet view article

computing the Hilbert bases via the Elliott—MacMahon algorithm". Theoretical Computer Science. 263 (1–2): 37–46. doi:10.1016/S0304-3975(00)00229-2. hdl:10220/8240

K-trivial set (1,837 words) [view diff] no match in snippet view article find links to article

"Information-Theoretic Characterizations of Recursive Infinite Strings", Theoretical Computer Science Volume 2, Issue 1, June 1976, Pages 45–48 Cristian Calude, Richard

Polygonal chain (1,005 words) [view diff] no match in snippet view article find links to article

Joseph (1998), Computational Geometry in C, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, p. 45, ISBN 9780521649766. Ramer

Nachum Dershowitz (1,040 words) [view diff] no match in snippet view article find links to article

of Theoretical Computer Science. Vol. B. Elsevier. pp. 243–320. N. Dershowitz & J.-P. Jouannaud (1990). "Notations for Rewriting". {{cite journal}}: Cite

Multiplicative weight update method (3,928 words) [view diff] no match in snippet view article find links to article

(AdaBoost, Winnow, Hedge), optimization (solving linear programs), theoretical computer science (devising fast algorithm for LPs and SDPs), and game theory.

Message Authenticator Algorithm (945 words) [view diff] no match in snippet view article find links to article

Systems (MARS'17), Uppsala, Sweden. Electronic Proceedings in Theoretical Computer Science. Vol. 244. pp. 129–183. arXiv:1703.06573. doi:10.4204/EPTCS.244

Carsten Lund (585 words) [view diff] no match in snippet view article find links to article

(1998), "Proof verification and the hardness of approximation problems", Journal of the ACM, 45 (3): 501–555, doi:10.1145/278298.278306, S2CID 8561542.

Giuseppe F. Italiano (469 words) [view diff] no match in snippet view article find links to article

"EATCS Fellows: Giuseppe F. Italiano". European Association for Theoretical Computer Science Giuseppe F. Italiano at DBLP Bibliography Server Giuseppe F.

Arithmetic combinatorics (956 words) [view diff] no match in snippet view article find links to article

doi:10.1090/S0273-0979-07-01189-5. Additive Combinatorics and Theoretical Computer Science Archived 2016-03-04 at the Wayback Machine, Luca Trevisan, SIGACT

Fibonacci word fractal (1,116 words) [view diff] no match in snippet view article find links to article

of the Fibonacci word fractal and the Fibonacci snowflake", Theoretical Computer Science, Vol. 528, p.40-56. [1] Blondin-Massé, Alexandre; Brlek, Srečko;

Sensitivity theorem (2,366 words) [view diff] no match in snippet view article find links to article

Symmetric Group and Beyond (Extended Abstract)". 12th Innovations in Theoretical Computer Science (ITCS) conference. p. 5 pages, 326343 bytes. doi:10.4230/LIPICS

Chiral polytope (628 words) [view diff] no match in snippet view article find links to article

Klee Festschrift), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, Providence, RI: American Mathematical Society, pp. 493–516

Tamar Ziegler (646 words) [view diff] no match in snippet view article find links to article

including combinatorics, number theory, algebraic geometry and theoretical computer science. One of her major contributions, in joint work with Ben Green

Congestion game (7,315 words) [view diff] no match in snippet view article find links to article

Spyros; Spirakis, Paul (2005-12-08). "Selfish unsplittable flows". Theoretical Computer Science. Automata, Languages and Programming: Algorithms and Complexity

E (theorem prover) (937 words) [view diff] no match in snippet view article

Debugging and Verifying Pointer Programs". Electronic Notes in Theoretical Computer Science. 86 (1). 4th International Workshop on First-Order Theorem Proving:

Peter Gacs (1,199 words) [view diff] no match in snippet view article find links to article

between descriptional complexity and algorithmic probability. Theoretical Computer Science, 22:71–93, 1983. Short version: Proc. 22nd IEEE FOCS (1981) 296-303

Post–Turing machine (2,767 words) [view diff] no match in snippet view article find links to article

appropriate. This language has played a fundamental role in theoretical computer science." (Davis et al. (1994) p. 129) This model allows for the printing

Tim Roughgarden (491 words) [view diff] no match in snippet view article find links to article

"The Gödel Prize 2012 - Laudatio". European Association for Theoretical Computer Science. 2012. Retrieved January 19, 2020. "ACM Gödel Prize for Seminal

♯P (944 words) [view diff] no match in snippet view article find links to article

Valiant (1979). "The Complexity of Computing the Permanent". Theoretical Computer Science. 8 (2). Elsevier: 189–201. doi:10.1016/0304-3975(79)90044-6.

Knapsack problem (7,770 words) [view diff] no match in snippet view article find links to article

Theoretical Computer Science Vol. 508, pp. 35–40. Chandra Chekuri and Sanjeev Khanna (2005). "A PTAS for the multiple knapsack problem". SIAM Journal

Subset sum problem (3,781 words) [view diff] no match in snippet view article find links to article

for counting all subsets that sum to below a certain number?". Theoretical Computer Science Stack Exchange. Note that Filmus' citation in support of the

Exponential time hypothesis (3,061 words) [view diff] no match in snippet view article find links to article

"On limited versus polynomial nondeterminism", Chicago Journal of Theoretical Computer Science, 1: 1–20, doi:10.4086/cjtcs.1997.001 Chen, Jianer; Huang

Impro-Visor (1,155 words) [view diff] no match in snippet view article find links to article

Abstractions for a Jazz Improvisation Assistant". Electronic Notes in Theoretical Computer Science. 193 (193): 47–60. doi:10.1016/j.entcs.2007.10.007. Keller, Robert

Yuri Matiyasevich (1,057 words) [view diff] no match in snippet view article find links to article

Personal Journal of Yuri Matiyasevich. Yuri Matiyasevich, A Polynomial related to Colourings of Triangulation of Sphere, Personal Journal of Yuri Matiyasevich

Strong pseudoprime (1,336 words) [view diff] no match in snippet view article find links to article

Algorithms". Theoretical Computer Science. 12: 97–108. doi:10.1016/0304-3975(80)90007-9. Rabin, Probabilistic Algorithm for Testing Primality. Journal of Number

Roland Carl Backhouse (757 words) [view diff] no match in snippet view article find links to article

1997). "A calculational approach to mathematical induction". Theoretical Computer Science. 179 (1–2): 103–135. doi:10.1016/s0304-3975(96)00154-5. Backhouse

Eugene Lawler (1,211 words) [view diff] no match in snippet view article find links to article

Berkeley, EECS Department, University of California, Berkeley. Theoretical computer science academic genealogy, Ian Parberry, 1996, retrieved 2010-09-17

Fulkerson Prize (1,965 words) [view diff] no match in snippet view article find links to article

Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 1, (American Mathematical Society, 1990) pp. 101-105

Hervé Moulin (1,582 words) [view diff] no match in snippet view article find links to article

Sharing mechanisms for Makespan and other Scheduling Problems". Theoretical Computer Science. 401 (1–3): 96–106. doi:10.1016/j.tcs.2008.03.025. Abdulkadiroğlu

Programming language theory (1,613 words) [view diff] no match in snippet view article find links to article

Tennent, Robert. D. (1997). ALGOL-like Languages. Progress in Theoretical Computer Science. Birkhauser, Boston. Pierce, Benjamin C. (2002). Types and Programming

Context-sensitive language (1,340 words) [view diff] no match in snippet view article find links to article

Rothe, Jörg (2005), Complexity theory and cryptology, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, p. 77, ISBN 978-3-540-22147-0

Normal number (4,302 words) [view diff] no match in snippet view article find links to article

"An example of a computable absolutely normal number" (PDF), Theoretical Computer Science, 270 (1–2): 947–958, doi:10.1016/S0304-3975(01)00170-0, hdl:20

Metric dimension (graph theory) (2,520 words) [view diff] no match in snippet view article

metric dimension on interval and permutation graphs. I. Bounds", Theoretical Computer Science, 68: 43–58, arXiv:1507.08164, doi:10.1016/j.tcs.2017.01.006,

Strahler number (2,065 words) [view diff] no match in snippet view article find links to article

of registers required for evaluating arithmetic expressions", Theoretical Computer Science, 9 (1): 99–125, doi:10.1016/0304-3975(79)90009-4. Gleyzer, A

SMAWK algorithm (706 words) [view diff] no match in snippet view article find links to article

Luís M. S. (2012), "Monge properties of sequence alignment", Theoretical Computer Science, 423: 30–49, doi:10.1016/j.tcs.2011.12.068, MR 2887979. Crochemore

Vijay Vazirani (860 words) [view diff] no match in snippet view article find links to article

generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970

Kolmogorov complexity (7,565 words) [view diff] no match in snippet view article find links to article

MR 0178484. Kolmogorov, Andrey (1998). "On Tables of Random Numbers". Theoretical Computer Science. 207 (2): 387–395. doi:10.1016/S0304-3975(98)00075-9. MR 1643414

Roger Lyndon (807 words) [view diff] no match in snippet view article find links to article

Schwichtenberg, Helmut (2000), Basic Proof Theory, Cambridge tracts in theoretical computer science, vol. 43 (2nd ed.), Cambridge University Press, p. 141, ISBN 978-0-521-77911-1

Miklós Simonovits (616 words) [view diff] no match in snippet view article find links to article

research interests are Combinatorics, Extremal Graph Theory, Theoretical Computer Science and Random Graphs. He discovered the method of progressive induction

Dana Ron (335 words) [view diff] no match in snippet view article find links to article

Analysis Techniques in Property Testing, Foundations and Trends in Theoretical Computer Science: vol. 5, no. 2, pages 73–205, 2009. D. Ron. Property Testing:

Andrzej Grzegorczyk (2,886 words) [view diff] no match in snippet view article find links to article

(2006): Density of truth in modal logics. Discrete Mathematics and Theoretical Computer Science Proceedings Volume AG Fourth Colloquium on Mathematics and Computer

Fixed point (mathematics) (1,696 words) [view diff] no match in snippet view article

postfixpoint. Prefixpoints and postfixpoints have applications in theoretical computer science. In order theory, the least fixed point of a function from a

Partial k-tree (498 words) [view diff] no match in snippet view article find links to article

(1998), "A partial k-arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4, hdl:1874/18312

P-adic analysis (1,043 words) [view diff] no match in snippet view article find links to article

Igor (2000). "Zero testing of p-adic and modular polynomials". Theoretical Computer Science. 233 (1–2): 309–317. CiteSeerX 10.1.1.131.6544. doi:10

Comparison of parser generators (1,110 words) [view diff] no match in snippet view article find links to article

Recursive Ascent-Descent Parser Generator". Electronic Notes in Theoretical Computer Science. Proceedings of the Ninth Workshop on Language Descriptions Tools

Proportion extend sort (1,124 words) [view diff] no match in snippet view article find links to article

"Efficient sample sort and the average case analysis of PEsort". Theoretical Computer Science. 369 (1–3): 44–66. doi:10.1016/j.tcs.2006.07.017. Chen, Jing-Chao

Graph coloring game (4,118 words) [view diff] no match in snippet view article find links to article

Walter (2004). "Note on the game chromatic index of trees". Theoretical Computer Science. 313 (3): 371–376. doi:10.1016/j.tcs.2002.10.002. Andres, Stephan

Mathematics (15,928 words) [view diff] no match in snippet view article find links to article

Computing is closely related to mathematics in several ways. Theoretical computer science is considered to be mathematical in nature. Communication technologies

Denotational semantics (3,784 words) [view diff] no match in snippet view article find links to article

(2007). "Definability and Full Abstraction". Electronic Notes in Theoretical Computer Science. 172: 301–310. doi:10.1016/j.entcs.2007.02.011. Milner, Robin

Chris Umans (594 words) [view diff] no match in snippet view article find links to article

"Matrix Multiplication via Matrix Groups". 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl - Leibniz-Zentrum für

Viliam Geffert (313 words) [view diff] no match in snippet view article find links to article

Viliam (2012). "An alternating hierarchy for finite automata". Theoretical Computer Science. 445: 1–24. doi:10.1016/j.tcs.2012.04.044. ISSN 0304-3975. Geffert

BB84 (1,111 words) [view diff] no match in snippet view article find links to article

"Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. Theoretical Aspects of Quantum Cryptography – celebrating 30

Otto von Guericke University Magdeburg (732 words) [view diff] no match in snippet view article find links to article

minister. Journal of Automata, Languages and Combinatorics, an international academic journal in the field of theoretical computer science published by

Elaine Weyuker (623 words) [view diff] no match in snippet view article find links to article

(1994). Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (2nd ed.). San Diego, California: Academic Press. ISBN 978-0-122-06382-4

Semantics (computer science) (1,671 words) [view diff] no match in snippet view article

for the semantics of computation: Part 3. Indexed categories". Theoretical Computer Science. 91 (2): 239–264. doi:10.1016/0304-3975(91)90085-G. Batty, Mark;

American Mathematical Society (2,491 words) [view diff] no match in snippet view article find links to article

Contemporary Mathematics IMACS: Series in Discrete Mathematics and Theoretical Computer Science Fields Institute Communications Proceedings of Symposia in Applied

Umesh Vazirani (547 words) [view diff] no match in snippet view article find links to article

Association for Computing Machinery, Umesh for "contributions to theoretical computer science and quantum computation" and Vijay for his work on approximation

Pancake sorting (2,201 words) [view diff] no match in snippet view article find links to article

"An (18/11)n upper bound for sorting by prefix reversals". Theoretical Computer Science. Graphs, Games and Computation: Dedicated to Professor Burkhard

Alternating-time temporal logic (520 words) [view diff] no match in snippet view article find links to article

"Alternating-time logic with imperfect recall". Electronic Notes in Theoretical Computer Science. LCMAS 2003, Logic and Communication in Multi-Agent Systems.

Prouhet–Thue–Morse constant (603 words) [view diff] no match in snippet view article find links to article

Ubiquitous Prouhet–Thue–Morse Sequence". Discrete Mathematics and Theoretical Computer Science: 11. Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic

Budget-additive valuation (850 words) [view diff] no match in snippet view article find links to article

"Online Matching and Ad Allocation". Foundations and Trends in Theoretical Computer Science. 8 (4): 265–368. doi:10.1561/0400000057. ISSN 1551-305X. Mehta

Duncan MacMillan (businessman) (521 words) [view diff] no match in snippet view article

Professorship of Genetics at Rutgers University and a Professorship in Theoretical Computer Science at The Institute for Advanced Study. He is also a generous supporter

Tomaž Pisanski (1,002 words) [view diff] no match in snippet view article find links to article

research projects. In 1991 he established the Department of Theoretical Computer Science at IMFM, of which he has served as both head and deputy head

Hans Zantema (342 words) [view diff] no match in snippet view article find links to article

Giesl. "Termination of term rewriting using dependency pairs." Theoretical Computer Science 236.1 (2000): 133-178. Ohlebusch, Enno. Advanced topics in term

Wagner graph (651 words) [view diff] no match in snippet view article find links to article

(1998). "A partial k-arboretum of graphs with bounded treewidth". Theoretical Computer Science. 209 (1–2): 1–45. doi:10.1016/S0304-3975(97)00228-4. hdl:1874/18312

Asynchronous cellular automaton (1,248 words) [view diff] no match in snippet view article find links to article

asynchronous behavior of double-quiescent elementary cellular automata, Theoretical Computer Science: Volume 362, pp. 1 - 16. Harvey I., and Bossomaier T.R.J, (1997)

Michel Talagrand (1,438 words) [view diff] no match in snippet view article find links to article

for instance in statistical mechanics (disordered systems), theoretical computer science, random matrices, and statistics (empirical processes). Talagrand

Polygon partition (2,579 words) [view diff] no match in snippet view article find links to article

binary search trees and minimum weight triangulation problems". Theoretical Computer Science. 66 (2): 181. doi:10.1016/0304-3975(89)90134-5. Hertel, Stefan;

Daina Taimiņa (1,574 words) [view diff] no match in snippet view article find links to article

the University of Latvia and completed her graduate work in Theoretical Computer Science (with thesis advisor Prof. Rūsiņš Mārtiņš Freivalds) in 1990

Distributed computing (6,666 words) [view diff] no match in snippet view article find links to article

ask a question and the computer should produce an answer. In theoretical computer science, such tasks are called computational problems. Formally, a computational

Deterministic acyclic finite state automaton (972 words) [view diff] no match in snippet view article find links to article

"The smallest automaton recognizing the subwords of a text", Theoretical Computer Science, 40: 31–55, doi:10.1016/0304-3975(85)90157-4 Appel, Andrew; Jacobsen

László Babai (1,022 words) [view diff] no match in snippet view article find links to article

Wiki (beta) Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange, asked Sep 25 2014 at 9:43 1993 Gödel Prize Archived

Robin Cockett (539 words) [view diff] no match in snippet view article find links to article

Science (FMCS) conference, an annual workshop for researchers in theoretical computer science and category theory supported by the Pacific Institute for the

Thomas Forster (mathematician) (472 words) [view diff] no match in snippet view article

Logique in Belgium, and the Centre for Discrete Mathematics and Theoretical Computer Science at the University of Auckland. Amongst his undergraduate supervisees

Minimum-weight triangulation (3,289 words) [view diff] no match in snippet view article find links to article

β-skeleton as a subgraph of the minimum weight triangulation", Theoretical Computer Science, 262 (1–2): 459–471, doi:10.1016/S0304-3975(00)00318-2. De Loera

Joris van der Hoeven (649 words) [view diff] no match in snippet view article find links to article

Hoeven, Joris (1999). "Fast evaluation of holonomic functions". Theoretical Computer Science. 210: 199–215. doi:10.1016/S0304-3975(98)00102-9. van der Hoeven

Forbidden graph characterization (1,224 words) [view diff] no match in snippet view article find links to article

(1998), "A partial k-arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1–2): 1–45, doi:10.1016/S0304-3975(97)00228-4, hdl:1874/18312

Selection bias (2,186 words) [view diff] no match in snippet view article find links to article

bias correction theory and algorithm for regression" (PDF). Theoretical Computer Science. 519: 103–126. CiteSeerX 10.1.1.367.6899. doi:10.1016/j.tcs.2013

Lexicographic breadth-first search (1,729 words) [view diff] no match in snippet view article find links to article

orientation, interval graph recognition and consecutive ones testing", Theoretical Computer Science, 234 (1–2): 59–84, doi:10.1016/S0304-3975(97)00241-7. Rose, D

Cyclic cellular automaton (1,224 words) [view diff] no match in snippet view article find links to article

Moreno, Eduardo (2004). "Dynamic of cyclic automata over Z^2". Theoretical Computer Science. 322 (2): 369–381. doi:10.1016/j.tcs.2004.03.018. hdl:10533/175114