Find link

language:

Find link is a tool written by Edward Betts.

searching for Theoretical computer science 75 found (2006 total)

alternate case: theoretical computer science

Finite-state machine (4,523 words) [view diff] case mismatch in snippet view article find links to article

(1992). "Minimization of Acyclic automata in Linear Time". Theoretical Computer Science. 92: 181–189. doi:10.1016/0304-3975(92)90142-3. Kaeslin, Hubert

Claude E. Shannon Award (572 words) [view diff] exact match in snippet view article find links to article

intersection of mathematics, communication engineering, and theoretical computer science. It is the highest honor given by the IEEE Information Theory

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

In information theory, the Shannon–Hartley theorem tells the maximum rate at which information can be transmitted over a communications channel of a specified

Seymour Ginsburg (1,435 words) [view diff] case mismatch 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

Yoram Moses (106 words) [view diff] exact match in snippet view article find links to article

About Knowledge, and is a winner of the 1997 Gödel Prize in theoretical computer science and the 2009 Dijkstra Prize in Distributed Computing. His major

Cheung–Marks theorem (578 words) [view diff] no match in snippet view article find links to article

In information theory, the Cheung–Marks theorem, named after K. F. Cheung and Robert J. Marks II, specifies conditions where restoration of a signal by

Jaikumar Radhakrishnan (223 words) [view diff] case mismatch in snippet view article find links to article

Institute of Technology, Kharagpur in 1985 and his Ph.D. in Theoretical Computer Science from Rutgers University, NJ, USA, in 1991 under the guidance

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

In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the statistical limits to possible data compression for

Hypercomputation (3,368 words) [view diff] case mismatch 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

Evolution strategy (2,054 words) [view diff] case mismatch 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

Tata Institute of Fundamental Research (1,443 words) [view diff] exact 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

Mark Jerrum (285 words) [view diff] exact 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

Indian Association for Research in Computing Science (262 words) [view diff] case mismatch in snippet view article find links to article

International Conference on Foundations of Software Technology and Theoretical Computer Science. The FSTTCS conference is in its 26th year. Since its inception

Alistair Sinclair (290 words) [view diff] exact 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

László Kalmár (708 words) [view diff] exact match in snippet view article find links to article

Kalmár is considered the founder of mathematical logic and theoretical computer science in Hungary. Kalmár was of Jewish ancestry. His early life mixed

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

In computational complexity theory, the Immerman–Szelepcsényi theorem states that nondeterministic space complexity classes are closed under complementation

Hartmut Ehrig (710 words) [view diff] exact match in snippet view article find links to article

March 2016) was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification

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

2021, the editor-in-chief is Jasmin Blanchette, a professor of theoretical computer science at the Ludwig-Maximilians-Universität München. The journal's

DisCoCat (1,503 words) [view diff] case mismatch 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

Daniel Gorenstein (424 words) [view diff] case mismatch in snippet view article find links to article

founding director of the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers in 1989, and remained at this post until

Vincent Blondel (715 words) [view diff] exact 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

Nir Shavit (386 words) [view diff] exact match in snippet view article find links to article

Multiprocessor Programming, is a winner of the 2004 Gödel Prize in theoretical computer science for his work on applying tools from algebraic topology to model

Michael Dinneen (292 words) [view diff] case mismatch in snippet view article find links to article

is deputy director of the Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial optimization, distributed

Karl Svozil (201 words) [view diff] case mismatch in snippet view article find links to article

External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland. Research in quantum theory, applications

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

In mathematics, the Schwartz–Zippel lemma (also called the DeMillo–Lipton–Schwartz–Zippel lemma) is a tool commonly used in probabilistic polynomial identity

Franz Aurenhammer (119 words) [view diff] case mismatch in snippet view article find links to article

and related structures. He is a professor in the Institute for Theoretical Computer Science of Graz University of Technology. Aurenhammer earned a diploma

Information Processing Letters (520 words) [view diff] exact 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

Rüdiger Valk (848 words) [view diff] case mismatch in snippet view article find links to article

German mathematician. From 1976 to 2010 he was Professor for Theoretical Computer Science (Informatics) at the Institut für Informatik (later Fachbereich

Graph traversal (1,492 words) [view diff] case mismatch 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

Oded Regev (computer scientist) (815 words) [view diff] exact 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

Ravindran Kannan (445 words) [view diff] case mismatch in snippet view article find links to article

Earl Trotter, Jr. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has

Abbas Edalat (790 words) [view diff] exact match in snippet view article find links to article

making fundamental contributions to mathematical logic and theoretical computer science" Edalat also founded SAF and CASMII, a campaign against sanctions

Queue number (2,715 words) [view diff] case mismatch 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

Dines Bjørner (685 words) [view diff] case mismatch 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;

Eduardo D. Sontag (1,180 words) [view diff] exact 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

Institute for Logic, Language and Computation (520 words) [view diff] case mismatch in snippet view article find links to article

organised according to four themes: Mathematics, Philosophy, Theoretical Computer Science, and Computational Linguistics and AI. The ILLC started off in

Strong monad (496 words) [view diff] exact match in snippet view article find links to article

the monoidal product. Strong monads play an important role in theoretical computer science where they are used to model computation with side effects. A

Jordan Pollack (203 words) [view diff] exact match in snippet view article find links to article

was highly acclaimed by Marvin Minsky. His contributions to theoretical computer science include the demonstration of a neural network implementation

Jordan Pollack (203 words) [view diff] exact match in snippet view article find links to article

was highly acclaimed by Marvin Minsky. His contributions to theoretical computer science include the demonstration of a neural network implementation

Strong monad (496 words) [view diff] exact match in snippet view article find links to article

the monoidal product. Strong monads play an important role in theoretical computer science where they are used to model computation with side effects. A

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

of Theoretical Computer Science by Danny Krizanc (2000), SIGACT News 31 (2): 2–5, doi:10.1145/348210.1042072 Review of Gems of Theoretical Computer Science

Eric Goles (165 words) [view diff] exact match in snippet view article find links to article

Grenoble in France. His research focuses on discrete mathematics, theoretical computer science, complex systems, and cellular automata. Goles is currently a

Thierry Coquand (514 words) [view diff] exact 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

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

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

Komei Fukuda (390 words) [view diff] case mismatch 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

Imre Simon (179 words) [view diff] exact 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

One-way function (1,956 words) [view diff] exact 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

IMU Abacus Medal (598 words) [view diff] exact match in snippet view article find links to article

explained Jacob Schwartz, who spoke on Tarjan's work. "By contrast, theoretical computer science must ultimately concern itself with computing engines which operate

Complexity theory (119 words) [view diff] exact match in snippet view article find links to article

theory may refer to: Computational complexity theory, a field in theoretical computer science and mathematics Complex systems theory, the study of the complexity

Daniel I. A. Cohen (282 words) [view diff] case mismatch 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

Disjoint sets (1,286 words) [view diff] case mismatch 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

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

The Nyquist–Shannon sampling theorem is an essential principle for digital signal processing linking the frequency range of a signal and the sample rate

Ronald Fagin (1,179 words) [view diff] case mismatch 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

Algebraic specification (643 words) [view diff] case mismatch 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

EXPSPACE (648 words) [view diff] case mismatch 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

Ashok K. Chandra (411 words) [view diff] exact 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

Geometric complexity theory (472 words) [view diff] exact 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

Shai Evra (324 words) [view diff] exact 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

Fast Analog Computing with Emergent Transient States (198 words) [view diff] case mismatch in snippet view article find links to article

of Debrecen, the University of Dresden and the Institute for Theoretical Computer Science at Technische Universitat Graz. FACETS website a quick introduction

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

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

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

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

Vineet Bafna (358 words) [view diff] case mismatch 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

Alexander Meduna (265 words) [view diff] exact match in snippet view article find links to article

Science at the Brno University of Technology. Formerly, he taught theoretical computer science at various European and American universities, including the

Machtey Award (179 words) [view diff] exact match in snippet view article find links to article

is named after Michael Machtey, who was a researcher in the theoretical computer science community in the 1970s. The counterpart of this award at the

Maike Buchin (169 words) [view diff] exact match in snippet view article find links to article

professor at Ruhr University Bochum, and head of the chair in theoretical computer science there. Buchin earned a diploma in mathematics from the University

John E. Savage (265 words) [view diff] exact match in snippet view article find links to article

Savage was named an ACM Fellow for "fundamental contributions to theoretical computer science, information theory, and VLSI design, analysis and synthesis"

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

Schwoon (February 2004). "Assembling molecules in ATOMIX is hard". Theoretical Computer Science. 313 (3): 447–462. doi:10.1016/j.tcs.2002.11.002. Aviezri S.

NC (complexity) (2,605 words) [view diff] case mismatch in snippet view article

and I. Oitavem (2004). "Separating NC along the delta axis". Theoretical Computer Science. 318 (1–2): 57–78. doi:10.1016/j.tcs.2003.10.021. Allender, Eric;

Solomonoff's theory of inductive inference (2,104 words) [view diff] exact 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

María Manzano (283 words) [view diff] case mismatch 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

Ronen Eldan (437 words) [view diff] exact 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

Entropy compression (1,387 words) [view diff] exact match in snippet view article find links to article

In mathematics and theoretical computer science, entropy compression is an information theoretic method for proving that a random process terminates, originally

Connected dominating set (1,239 words) [view diff] case mismatch in snippet view article find links to article

exact algorithm for the maximum leaf spanning tree problem", Theoretical Computer Science, 412 (45): 6290–6302, doi:10.1016/j.tcs.2011.07.011, MR 2883043

Language equation (1,127 words) [view diff] case mismatch 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

AC (complexity) (328 words) [view diff] case mismatch in snippet view article

Evangelos (2002), Boolean functions and computation models, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, ISBN 3-540-59436-1