Find link

language:

Find link is a tool written by Edward Betts.

searching for Journal of Computer and System Sciences 244 found (383 total)

alternate case: journal of Computer and System Sciences

Harold N. Gabow (530 words) [view diff] exact match in snippet view article find links to article

Journal of Computer and System Sciences 30, 2, 1985, 209-221. ``Scaling algorithms for network problems,'' H.N. Gabow, Journal of Computer and System

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

Naor. "Optimal aggregation algorithms for middleware." Journal of Computer and System Sciences 66 (2003): 614–656. (Special issue for selected papers

Completeness (order theory) (1,914 words) [view diff] exact match in snippet view article

ordered algebras Journal of Computer and System Sciences. October 1976. Michael Smyth. Power domains Journal of Computer and System Sciences. 1978. Daniel

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

"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, MR 1248864

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

threshold circuits for division and iterated multiplication". Journal of Computer and System Sciences. 65 (4): 695–716. doi:10.1016/S0022-0000(02)00025-9. Parberry

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

(1999). "Complexity Limitations on Quantum Computation". Journal of Computer and System Sciences. 59 (2): 240–252. arXiv:cs/9811023. doi:10.1006/JCSS.1999

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

recognition in real time by a multitape turing machine". Journal of Computer and System Sciences. 16 (2): 140–157. doi:10.1016/0022-0000(78)90042-9. ISSN 0022-0000

Sparse language (606 words) [view diff] exact match in snippet view article find links to article

NP: Solution of a conjecture by Berman and Hartmanis. Journal of Computer and System Sciences 25:130–143. 1982. M. Ogiwara and O. Watanabe. On polynomial

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

Christos Papadimitriou (1985). "Games against Nature". Journal of Computer and System Sciences. 31 (2): 288–301. doi:10.1016/0022-0000(85)90045-5. A.P

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

"Vertex cover might be hard to approximate to within 2−ε". Journal of Computer and System Sciences. Computational Complexity 2003. 74 (3): 335–349. doi:10

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

Queiroz. Volume 255, Part 2, Pages 193–334 (August 2017). Journal of Computer and System Sciences, 20th Workshop on Logic, Language, Information and Computation

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

(2001). "Integer Circuit Evaluation Is PSPACE-Complete". Journal of Computer and System Sciences. 63 (2, September 2001): 288–303. doi:10.1006/jcss.2001

Semantic security (1,435 words) [view diff] exact match in snippet view article find links to article

Micali, Silvio (1984-04-01). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270–299. doi:10.1016/0022-0000(84)90070-9. ISSN 0022-0000

Computational learning theory (865 words) [view diff] exact match in snippet view article find links to article

Warmuth, M. K. (1990). "Prediction-Preserving Reducibility". Journal of Computer and System Sciences. 41 (3): 430–467. doi:10.1016/0022-0000(90)90028-J. Basics

CC (complexity) (830 words) [view diff] exact match in snippet view article

"The complexity of circuit value and network stability". Journal of Computer and System Sciences. 44 (2): 302–323. doi:10.1016/0022-0000(92)90024-d. S.

Boosting (machine learning) (2,178 words) [view diff] exact match in snippet view article

Generalization of On-Line Learning and an Application to Boosting, Journal of Computer and System Sciences, 55(1):119-139 Schapire, Robert E. (1990). "The Strength

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

algorithm for embedding planar graphs using PQ–trees", Journal of Computer and System Sciences, 30 (1): 54–76, doi:10.1016/0022-0000(85)90004-2. Shih

Shlomi Dolev (2,390 words) [view diff] exact match in snippet view article find links to article

(2010-12-01). "When consensus meets self-stabilization". Journal of Computer and System Sciences. 76 (8): 884–900. doi:10.1016/j.jcss.2010.05.005. ISSN 0022-0000

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

"The complexity of elementary algebra and geometry". Journal of Computer and System Sciences. 32 (2): 251–264. doi:10.1016/0022-0000(86)90029-2. ISSN 0022-0000

Tree stack automaton (876 words) [view diff] exact match in snippet view article find links to article

(1967). Some Definitional Suggestions for Automata Theory. Journal of Computer and System Sciences, Vol. 1(2), pages 187–212, doi:10.1016/s0022-0000(67)80014-x

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

(June 1974). "A generalized approach to formal languages". Journal of Computer and System Sciences. 8 (3): 409–439. doi:10.1016/s0022-0000(74)80031-0. Hayashi

2-EXPTIME (960 words) [view diff] exact match in snippet view article find links to article

"The complexity of elementary algebra and geometry". Journal of Computer and System Sciences. 32 (2): 251–264. doi:10.1016/0022-0000(86)90029-2. ISSN 0022-0000

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

1137/0201019. Book, R. (1974), "Comparing complexity classes", Journal of Computer and System Sciences, 3 (9): 213–229, doi:10.1016/s0022-0000(74)80008-5. Impagliazzo

VMAC (742 words) [view diff] exact match in snippet view article find links to article

functions and their use in authentication and set equality". Journal of Computer and System Sciences. 22 (3): 265–279. doi:10.1016/0022-0000(81)90033-7. T.

List of PPAD-complete problems (167 words) [view diff] exact match in snippet view article find links to article

Parity Argument and Other Inefficient Proofs of Existence". Journal of Computer and System Sciences. 48 (3): 498–532. CiteSeerX 10.1.1.321.7008. doi:10

Randomized algorithm (4,256 words) [view diff] exact match in snippet view article find links to article

Robert E. (August 1973). "Time bounds for selection". Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. Williams

Ming Li (511 words) [view diff] exact match in snippet view article find links to article

Vitanyi, Inductive reasoning and Kolmogorov complexity. Journal of Computer and System Sciences, (special issue for Structure’89) 44:2(1992), 343-384.

Steven Rudich (430 words) [view diff] exact match in snippet view article find links to article

Complexity: An Isomorphism Theorem and a Gap Theorem". Journal of Computer and System Sciences. 57 (2). Boston, MA: Academic Press: 127–143. doi:10.1006/jcss

Homeomorphism (graph theory) (932 words) [view diff] exact match in snippet view article

Ronald L. (1980), "The subgraph homeomorphism problem", Journal of Computer and System Sciences, 20 (2): 133–149, doi:10.1016/0022-0000(80)90057-4, hdl:1721

Manuel Blum (740 words) [view diff] exact match in snippet view article find links to article

E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. Blum

ML (programming language) (1,461 words) [view diff] exact match in snippet view article

Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348–375, 1978. Milner, Robin; Tofte, Mads (1991)

Nested stack automaton (748 words) [view diff] exact match in snippet view article find links to article

stack automata are equivalent to two-way stack automata". Journal of Computer and System Sciences. 10 (3): 317–339. doi:10.1016/s0022-0000(75)80004-3. Shapiro

Amos Fiat (906 words) [view diff] exact match in snippet view article find links to article

"Competitive algorithms for distributed data management", Journal of Computer and System Sciences, 51 (3): 341–358, doi:10.1006/jcss.1995.1073, MR 1368903

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

of bounded valence can be tested in polynomial time", Journal of Computer and System Sciences, 25 (1): 42–65, doi:10.1016/0022-0000(82)90009-5. Köbler

Norman Margolus (822 words) [view diff] exact match in snippet view article find links to article

construction universality of reversible cellular automata" (PDF), Journal of Computer and System Sciences, 15 (2): 213–231, doi:10.1016/s0022-0000(77)80007-x. De

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

"Which problems have strongly exponential complexity?", Journal of Computer and System Sciences, 63 (4): 512–530, CiteSeerX 10.1.1.66.3717, doi:10.1006/jcss

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

Probabilistic Algorithms for Hamiltonian Circuits and Matchings", Journal of Computer and System Sciences 18 (1979) 155-193. Yuri Gurevich (1988), On Kolmogorov

Candidate key (1,380 words) [view diff] exact match in snippet view article find links to article

Sylvia L. (October 1978). "Candidate keys for relations". Journal of Computer and System Sciences. 17 (2): 270–279. doi:10.1016/0022-0000(78)90009-0. Date

Timeline of machine learning (1,847 words) [view diff] exact match in snippet view article find links to article

(February 1995). "On the Computational Power of Neural Nets". Journal of Computer and System Sciences. 50 (1): 132–150. doi:10.1006/jcss.1995.1013. Siegelmann

Vaughan Pratt (934 words) [view diff] exact match in snippet view article find links to article

E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. Pratt

Mahaney's theorem (162 words) [view diff] exact match in snippet view article find links to article

NP: Solution of a conjecture of Berman and Hartmanis". Journal of Computer and System Sciences. 25 (2): 130–143. doi:10.1016/0022-0000(82)90002-2. hdl:1813/6257

Three-phase commit protocol (577 words) [view diff] exact match in snippet view article find links to article

Resilience of Distributed and Replicated Database Systems". Journal of Computer and System Sciences. 57 (3): 309–324. doi:10.1006/jcss.1998.1566. Two-phase

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

A. A. Razborov and S. Rudich (1997). "Natural proofs". Journal of Computer and System Sciences. 55: 24–35. doi:10.1006/jcss.1997.1494. (Draft) Razborov+Rudich

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

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

Russell Impagliazzo (820 words) [view diff] exact match in snippet view article find links to article

Ramamohan (2001-03-01). "On the Complexity of k-SAT". Journal of Computer and System Sciences. 62 (2): 367–375. doi:10.1006/jcss.2000.1727. ISSN 0022-0000

AF-heap (163 words) [view diff] exact match in snippet view article find links to article

Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48, 533-551 (1994) v t e v t e

Unbounded nondeterminism (2,718 words) [view diff] exact match in snippet view article find links to article

Computer Science. Smyth, Michael (1978). "Power domains". Journal of Computer and System Sciences. 16: 23–36. doi:10.1016/0022-0000(78)90048-X. Milne, George;

Goldwasser–Micali cryptosystem (976 words) [view diff] exact match in snippet view article find links to article

Goldwasser, S. Micali (1984). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270–299. doi:10.1016/0022-0000(84)90070-9. Blum–Goldwasser

Chris Umans (594 words) [view diff] exact match in snippet view article find links to article

2011). "The complexity of Boolean formula minimization". Journal of Computer and System Sciences. 77 (1): 142–153. doi:10.1016/j.jcss.2010.06.011. This

Non-repudiation (1,263 words) [view diff] exact match in snippet view article find links to article

of origin with privacy protection in cloud computing". Journal of Computer and System Sciences. 79 (8): 1200–1213. doi:10.1016/j.jcss.2013.03.001. "What

Shellsort (3,456 words) [view diff] exact match in snippet view article find links to article

Robert (1985). "Improved Upper Bounds on Shellsort" (PDF). Journal of Computer and System Sciences. 31 (2): 210–224. doi:10.1016/0022-0000(85)90042-x. Sedgewick

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

Alina; Langford, John (2009). "Agnostic active learning". Journal of Computer and System Sciences. 75 (1): 78–89. doi:10.1016/j.jcss.2008.07.003. ISSN 0022-0000

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

1988). "Parallel computation with threshold functions". Journal of Computer and System Sciences. 36 (3): 278–302. doi:10.1016/0022-0000(88)90030-X. Furst

Eugene M. Luks (355 words) [view diff] exact match in snippet view article find links to article

of bounded valence can be tested in polynomial time", Journal of Computer and System Sciences, 25 (1): 42–65, doi:10.1016/0022-0000(82)90009-5, S2CID 2572728

Short division (1,073 words) [view diff] exact match in snippet view article find links to article

September 2004). "Minimal DFA for testing divisibility". Journal of Computer and System Sciences. 69 (2): 235. arXiv:cs/0309052. doi:10.1016/j.jcss.2004

Unsatisfiable core (347 words) [view diff] exact match in snippet view article find links to article

clause-variable difference are fixed-parameter tractable". Journal of Computer and System Sciences. 69 (4): 656–674. CiteSeerX 10.1.1.634.5311. doi:10.1016/j

Ray Solomonoff (3,038 words) [view diff] exact match in snippet view article find links to article

1997 is in "The Discovery of Algorithmic Probability", Journal of Computer and System Sciences, Vol 55, No. 1, pp 73–88, August 1997. The paper, as well

Polygon covering (2,229 words) [view diff] exact match in snippet view article find links to article

convex coverings of orthogonal polygons without holes". Journal of Computer and System Sciences. 39 (2): 166. doi:10.1016/0022-0000(89)90043-3. Motwani

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

(1973-08-01). "Time bounded random access machines". Journal of Computer and System Sciences. 7 (4): 354–375. doi:10.1016/S0022-0000(73)80029-7. ISSN 0022-0000

Operator-precedence grammar (1,283 words) [view diff] exact match in snippet view article find links to article

"Operator precedence and the visibly pushdown property". Journal of Computer and System Sciences. 78 (6): 1837–1867. doi:10.1016/j.jcss.2011.12.006. Crespi

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

1982). "Tree constructions of free continuous algebras". Journal of Computer and System Sciences. 24 (1): 114–146. doi:10.1016/0022-0000(82)90059-9. Mekler

Function problem (1,174 words) [view diff] exact match in snippet view article find links to article

(1983). "On self-reducibility and weak P-selectivity". Journal of Computer and System Sciences. 26 (2): 209–221. doi:10.1016/0022-0000(83)90013-2. Schnorr

Thomas Jerome Schaefer (177 words) [view diff] exact match in snippet view article find links to article

Complexity of Some Two-Person Perfect-Information Games". Journal of Computer and System Sciences. 16 (2): 185–225. doi:10.1016/0022-0000(78)90045-4. MR 0490917

S2P (complexity) (575 words) [view diff] exact match in snippet view article

{S} _{2}^{p}\subseteq \mathrm {{ZPP}^{NP}} } " (PDF), Journal of Computer and System Sciences, 73 (1): 25–35, doi:10.1016/j.jcss.2003.07.015, MR 2279029

Liquid state machine (531 words) [view diff] exact match in snippet view article find links to article

Computational Power of Recurrent Circuits of Spiking Neurons", Journal of Computer and System Sciences, 69 (4): 593–616, doi:10.1016/j.jcss.2004.04.001 Hananel

PPAD (complexity) (1,003 words) [view diff] exact match in snippet view article

argument and other inefficient proofs of existence" (PDF). Journal of Computer and System Sciences. 48 (3): 498–532. doi:10.1016/S0022-0000(05)80063-7. Archived

Tree automaton (2,672 words) [view diff] exact match in snippet view article find links to article

1970). "Tree Acceptors and Some of Their Applications". Journal of Computer and System Sciences. 4 (5): 406–451. Engelfriet, Joost (1975). "Tree Automata

Serge Abiteboul (831 words) [view diff] exact match in snippet view article find links to article

Vianu, V. (1995). "Computing with First-Order Logic". Journal of Computer and System Sciences. 50 (2): 309. doi:10.1006/jcss.1995.1025. Serge Abiteboul

APX (997 words) [view diff] exact match in snippet view article find links to article

Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43:425–440, 1991. Pierluigi Crescenzi, Viggo Kann, Magnús

Kayles (907 words) [view diff] exact match in snippet view article find links to article

complexity of some two-person perfect-information games". Journal of Computer and System Sciences. 16 (2): 185–225. doi:10.1016/0022-0000(78)90045-4.

Pancake sorting (2,201 words) [view diff] exact match in snippet view article find links to article

Guillaume; Rusu, Irena (2015). "Pancake Flipping Is Hard". Journal of Computer and System Sciences. 81 (8): 1556–1574. arXiv:1111.0434. doi:10.1016/j.jcss

Hybrid system (1,407 words) [view diff] exact match in snippet view article find links to article

Pravin Varaiya: What's Decidable about Hybrid Automata, Journal of Computer and System Sciences, 1998 Martin Fränzle: Analysis of Hybrid Systems: An ounce

Quadratic residuosity problem (1,204 words) [view diff] exact match in snippet view article find links to article

Goldwasser, S. Micali (1984). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270–299. doi:10.1016/0022-0000(84)90070-9.

SL (complexity) (1,793 words) [view diff] exact match in snippet view article

nondeterministic and deterministic tape complexities", Journal of Computer and System Sciences, 4: 177–192, doi:10.1016/S0022-0000(70)80006-X, hdl:10338

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

Stathis (1988). "Probabilistic quantifiers and games". Journal of Computer and System Sciences. 36 (3): 433–451. doi:10.1016/0022-0000(88)90037-2. Profile

Disjoint-set data structure (4,910 words) [view diff] exact match in snippet view article find links to article

which require non-linear time to maintain disjoint sets". Journal of Computer and System Sciences. 18 (2): 110–127. doi:10.1016/0022-0000(79)90042-4. Fredman

Savitch's theorem (1,094 words) [view diff] exact match in snippet view article find links to article

nondeterministic and deterministic tape complexities", Journal of Computer and System Sciences, 4 (2): 177–192, doi:10.1016/S0022-0000(70)80006-X, hdl:10338

Context-free language (2,152 words) [view diff] exact match in snippet view article find links to article

context-free recognition in less than cubic time" (PDF). Journal of Computer and System Sciences. 10 (2): 308–315. doi:10.1016/s0022-0000(75)80046-8. Lee

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

"Lower bounds for the transition complexity of NFAs". Journal of Computer and System Sciences. 74 (7): 1116–1130. doi:10.1016/j.jcss.2008.02.007. ISSN 0022-0000

Vijay Vaishnavi (2,078 words) [view diff] exact match in snippet view article find links to article

Vaishnavi, V. K. "On k-Dimensional Balanced Binary Trees." Journal of Computer and System Sciences (Academic Press), Vol. 52, No. 2, 1996, pp. 328–348. Fraser

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

(1980). "Computable Queries for Relational Data Bases". Journal of Computer and System Sciences. 21 (2): 156–178. doi:10.1016/0022-0000(80)90032-X. Chadra

Deadlock (computer science) (2,530 words) [view diff] exact match in snippet view article

(1975). "Proving assertions about parallel programs". Journal of Computer and System Sciences. 10: 110–135. doi:10.1016/S0022-0000(75)80018-3. Kwong

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

of bounded valence can be tested in polynomial time". Journal of Computer and System Sciences. 25 (1): 42–65. doi:10.1016/0022-0000(82)90009-5. "U of

Yossi Matias (968 words) [view diff] exact match in snippet view article find links to article

Space Complexity of Approximating the Frequency Moments". Journal of Computer and System Sciences. 58 (1): 137–147. doi:10.1006/jcss.1997.1545. ISSN 0022-0000

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

Uwe (1988). "Graph isomorphism is in the low hierarchy". Journal of Computer and System Sciences. 37 (3): 312–323. doi:10.1016/0022-0000(88)90010-4. Babai

John Hershberger (646 words) [view diff] exact match in snippet view article find links to article

"Optimal shortest path queries in a simple polygon", Journal of Computer and System Sciences, 39 (2): 126–152, doi:10.1016/0022-0000(89)90041-x. Hershberger

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

(1998-08-01). "What's Decidable about Hybrid Automata?". Journal of Computer and System Sciences. 57 (1): 94–124. doi:10.1006/jcss.1998.1581. hdl:1813/7198

Shafi Goldwasser (1,479 words) [view diff] exact match in snippet view article find links to article

Goldwasser, S.; Micali, S. (1984). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270. doi:10.1016/0022-0000(84)90070-9. Shafi Goldwasser

Oracle machine (2,046 words) [view diff] exact match in snippet view article find links to article

1994). "The random oracle hypothesis is false" (PDF). Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/S0022-0000(05)80084-4. ISSN 0022-0000

P-complete (1,973 words) [view diff] exact match in snippet view article find links to article

sets for P: resolution of a conjecture of Hartmanis", Journal of Computer and System Sciences, 58 (2): 280–296, doi:10.1006/jcss.1998.1615 Greenlaw,

Random oracle (1,786 words) [view diff] exact match in snippet view article find links to article

(August 1994). "The Random Oracle Hypothesis is False". Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/S0022-0000(05)80084-4. ISSN 0022-0000

David E. Muller (658 words) [view diff] exact match in snippet view article find links to article

"Groups, the Theory of ends, and context-free languages". Journal of Computer and System Sciences. 26 (3): 295–310. doi:10.1016/0022-0000(83)90003-X. Green

Unary language (588 words) [view diff] exact match in snippet view article find links to article

NP: Solution of a conjecture by Berman and Hartmanis. Journal of Computer and System Sciences 25:130-143. 1982. "Kleene star of an infinite unary language

Actor model and process calculi (3,260 words) [view diff] exact match in snippet view article find links to article

Dissertation. December 1977. Michael Smyth. Power domains Journal of Computer and System Sciences. 1978. George Milne and Robin Milner. Concurrent processes

Interval union-split-find (528 words) [view diff] exact match in snippet view article find links to article

bounds for the predecessor problem and related problems". Journal of Computer and System Sciences. 65 (1): 38–72. Mehlhorn, Kurt; Näher, Stefan (1990). "Dynamic

Relational transducer (537 words) [view diff] exact match in snippet view article find links to article

(2000). "Relational Transducers for Electronic Commerce". Journal of Computer and System Sciences. 61 (2): 236–269. doi:10.1006/jcss.2000.1708. Kohli, Madhur

IP (complexity) (5,599 words) [view diff] exact match in snippet view article

et al. (1994). "The random oracle hypothesis is false". Journal of Computer and System Sciences. 49 (1): 24–39. doi:10.1016/s0022-0000(05)80084-4. Furer

Graph embedding (1,744 words) [view diff] exact match in snippet view article find links to article

(March 1, 2011). "Errors in Graph Embedding Algorithms". Journal of Computer and System Sciences. 2 (77): 430–438. doi:10.1016/j.jcss.2010.06.002. Mohar

Edit distance (2,445 words) [view diff] exact match in snippet view article find links to article

"A faster algorithm computing string edit distances". Journal of Computer and System Sciences. 20 (1): 18–31. doi:10.1016/0022-0000(80)90002-1. hdl:1721

Quantum neural network (2,555 words) [view diff] exact match in snippet view article find links to article

Sanjay; Zia, R.K.P. (2001). "Quantum Neural Networks". Journal of Computer and System Sciences. 63 (3): 355–383. arXiv:quant-ph/0201144. doi:10.1006/jcss

Single-minded agent (551 words) [view diff] exact match in snippet view article find links to article

(2004-12-01). "On complexity of single-minded auction". Journal of Computer and System Sciences. 69 (4): 675–687. doi:10.1016/j.jcss.2004.04.012. ISSN 0022-0000

Quickselect (1,163 words) [view diff] exact match in snippet view article find links to article

for the running time of a selection algorithm" (PDF). Journal of Computer and System Sciences. 29 (1): 1–7. doi:10.1016/0022-0000(84)90009-6. MR 0761047

Graph bandwidth (1,517 words) [view diff] exact match in snippet view article find links to article

(2010). "Hardness results for approximating the bandwidth". Journal of Computer and System Sciences. 77: 62–90. doi:10.1016/j.jcss.2010.06.006. Garey, M.R

Closed-world assumption (1,512 words) [view diff] exact match in snippet view article find links to article

propositional closed world reasoning and circumscription". Journal of Computer and System Sciences. 48 (2): 255–310. doi:10.1016/S0022-0000(05)80004-2. ISSN

Growing context-sensitive grammar (410 words) [view diff] exact match in snippet view article find links to article

for growing context-sensitive grammars is polynomial". Journal of Computer and System Sciences. 33 (3): 456–472. doi:10.1016/0022-0000(86)90062-0. G.

Bipartite graph (4,086 words) [view diff] exact match in snippet view article find links to article

algorithms for feedback vertex set and edge bipartization", Journal of Computer and System Sciences, 72 (8): 1386–1396, doi:10.1016/j.jcss.2006.02.001 Ahuja

Poly1305 (2,537 words) [view diff] exact match in snippet view article find links to article

Functions and Their Use in Authentication and Set Equality". Journal of Computer and System Sciences. 22 (3): 265–279. doi:10.1016/0022-0000(81)90033-7. Boneh

NP-intermediate (1,547 words) [view diff] exact match in snippet view article find links to article

nondeterminism and the complexity of the V-C dimension". Journal of Computer and System Sciences. 53 (2, part 1): 161–170. doi:10.1006/jcss.1996.0058. MR 1418886

Kuroda normal form (532 words) [view diff] exact match in snippet view article find links to article

"Comment on the paper 'Error detection in formal languages,'" Journal of Computer and System Sciences, vol. 8, no. 2, pp. 238–242, Apr. 1974. doi:10.1016/S0022-0000(74)80057-7

Indexed grammar (2,718 words) [view diff] exact match in snippet view article find links to article

(1974). "A Generalized Approach to Formal Languages". Journal of Computer and System Sciences. 8 (3): 409–439. doi:10.1016/s0022-0000(74)80031-0. Robert

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

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

Grammar induction (2,166 words) [view diff] exact match in snippet view article find links to article

(1980). "Finding Patterns Common to a Set of Strings". Journal of Computer and System Sciences. 21: 46–62. doi:10.1016/0022-0000(80)90041-0. T. Erlebach;

HyperLogLog (1,874 words) [view diff] exact match in snippet view article find links to article

counting algorithms for data base applications" (PDF). Journal of Computer and System Sciences. 31 (2): 182–209. doi:10.1016/0022-0000(85)90041-8. S Heule;

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

Complexity: An Isomorphism Theorem and a Gap Theorem". Journal of Computer and System Sciences. 57 (2): 127–143. doi:10.1006/jcss.1998.1583. ISSN 1090-2724

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

counting algorithms for data base applications" (PDF). Journal of Computer and System Sciences. 31 (2): 182–209. doi:10.1016/0022-0000(85)90041-8. Durand

Nicola Leone (436 words) [view diff] exact match in snippet view article find links to article

"Conjunctive-Query Containment and Constraint Satisfaction". Journal of Computer and System Sciences. 61 (2): 302–332. doi:10.1006/jcss.2000.1713. "Fellows"

Binary decision diagram (3,109 words) [view diff] exact match in snippet view article find links to article

OBDD-size of integer multiplication via universal hashing". Journal of Computer and System Sciences. 71 (4): 520–534. CiteSeerX 10.1.1.138.6771. doi:10.1016/j

String graph (1,532 words) [view diff] exact match in snippet view article find links to article

Štefankovič, Daniel (2003), "Recognizing string graphs in NP", Journal of Computer and System Sciences, 67 (2): 365–380, doi:10.1016/S0022-0000(03)00045-X. Sinden

Interactive proof system (2,746 words) [view diff] exact match in snippet view article find links to article

randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36: p.254–276. 1988. O. Goldreich, S. Micali, A. Wigderson

Canonical correlation (3,645 words) [view diff] exact match in snippet view article find links to article

spectral algorithm for learning Hidden Markov Models" (PDF). Journal of Computer and System Sciences. 78 (5): 1460. arXiv:0811.4413. doi:10.1016/j.jcss.2011

Reversible computing (3,014 words) [view diff] exact match in snippet view article find links to article

2000). "Reversible Space Equals Deterministic Space". Journal of Computer and System Sciences. 60 (2): 354–367. doi:10.1006/jcss.1999.1672. Perumalla

Curtis–Hedlund–Lyndon theorem (1,607 words) [view diff] exact match in snippet view article find links to article

Daniel (1972), "Tessellations with local transformations", Journal of Computer and System Sciences, 6 (5): 373–388, doi:10.1016/S0022-0000(72)80009-6, MR 0319678

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

Alexander (2010). "Decision problems for language equations". Journal of Computer and System Sciences. 76 (3–4): 251–266. doi:10.1016/j.jcss.2009.08.002. ISSN 0022-0000

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

Daniel (September 2003). "Recognizing string graphs in NP". Journal of Computer and System Sciences. 67 (2): 365–380. doi:10.1016/S0022-0000(03)00045-X. Lanctot

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

1987, 486-502. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences 42:3, 1991, 346-398. Y. Gurevich. Toward logic tailored

Abraham Ginzburg (840 words) [view diff] exact match in snippet view article find links to article

1980). "Vector addition systems and regular languages". Journal of Computer and System Sciences. 20 (3): 277–284. doi:10.1016/0022-0000(80)90009-4. Yoeli

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

Alexander; Rudich, Steven (August 1997). "Natural Proofs". Journal of Computer and System Sciences. 55 (1): 24–35. doi:10.1006/jcss.1997.1494. Sanjeev Arora

Type inference (3,674 words) [view diff] exact match in snippet view article find links to article

(1978), "A Theory of Type Polymorphism in Programming", Journal of Computer and System Sciences, 17 (3): 348–375, doi:10.1016/0022-0000(78)90014-4, hdl:20

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

(1980). "Finding Patterns Common to a Set of Strings". Journal of Computer and System Sciences. 21: 46–62. doi:10.1016/0022-0000(80)90041-0. Theorem 3

Metrical task system (805 words) [view diff] exact match in snippet view article find links to article

for metric spaces with applications to online problems". Journal of Computer and System Sciences. 72 (5): 890–921. arXiv:cs/0406028. doi:10.1016/j.jcss

Order polynomial (1,273 words) [view diff] exact match in snippet view article find links to article

1137/0213049. Kahn, Jeff; Kim, Jeong Han (1995). "Entropy and sorting". Journal of Computer and System Sciences. 51 (3): 390–399. doi:10.1006/jcss.1995.1077.

Adrian Walker (computer scientist) (776 words) [view diff] exact match in snippet view article

and the regeneration capability of biological systems. Journal of Computer and System Sciences Volume 11, Issue 2, October 1975. On the inference of stochastic

Maximum satisfiability problem (1,509 words) [view diff] exact match in snippet view article find links to article

Krentel (1988). "The complexity of optimization problems". Journal of Computer and System Sciences. 36 (3): 490–509. doi:10.1016/0022-0000(88)90039-6. hdl:1813/6559

Assignment problem (2,960 words) [view diff] exact match in snippet view article find links to article

constant time and the single source shortest paths problem". Journal of Computer and System Sciences. Special Issue on STOC 2003. 69 (3): 330–353. doi:10.1016/j

K-d tree (3,770 words) [view diff] exact match in snippet view article find links to article

E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. Cormen

Denotational semantics (3,767 words) [view diff] exact match in snippet view article find links to article

"Semantics of nondeterminism, concurrency, and communication", Journal of Computer and System Sciences. December 1979. Cattani, Gian Luca; Winskel, Glynn (2005)

Needleman–Wunsch algorithm (3,217 words) [view diff] exact match in snippet view article find links to article

"A faster algorithm computing string edit distances". Journal of Computer and System Sciences. 20: 18–31. doi:10.1016/0022-0000(80)90002-1. hdl:1721

Vapnik–Chervonenkis dimension (2,861 words) [view diff] exact match in snippet view article find links to article

VC Dimension of Sigmoidal and General Pfaffian Neural Networks". Journal of Computer and System Sciences. 54 (1): 169–176. doi:10.1006/jcss.1997.1477.

Clique-width (2,058 words) [view diff] exact match in snippet view article find links to article

Grzegorz (1993), "Handle-rewriting hypergraph grammars", Journal of Computer and System Sciences, 46 (2): 218–270, doi:10.1016/0022-0000(93)90004-G, MR 1217156

Flajolet–Martin algorithm (1,235 words) [view diff] exact match in snippet view article find links to article

counting algorithms for data base applications" (PDF). Journal of Computer and System Sciences. 31 (2): 182–209. doi:10.1016/0022-0000(85)90041-8. Retrieved

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

Approximate Optima in Lattices, Codes, and Systems of Linear Equations". Journal of Computer and System Sciences. 54 (2): 317–331. doi:10.1006/jcss.1997.1472.

Type safety (3,647 words) [view diff] exact match in snippet view article find links to article

(1978), "A Theory of Type Polymorphism in Programming", Journal of Computer and System Sciences, 17 (3): 348–375, doi:10.1016/0022-0000(78)90014-4, hdl:20

Average-case complexity (3,057 words) [view diff] exact match in snippet view article find links to article

204–216. Gurevich, Yuri (1991), "Average case completeness", Journal of Computer and System Sciences, 42 (3): 346–398, doi:10.1016/0022-0000(91)90007-R, hdl:2027

Conjunctive query (1,922 words) [view diff] exact match in snippet view article find links to article

"Conjunctive-Query Containment and Constraint Satisfaction", Journal of Computer and System Sciences, 61 (2): 302–332, doi:10.1006/jcss.2000.1713 Mihalis Yannakakis:

NC (complexity) (3,081 words) [view diff] exact match in snippet view article

Straubing, Howard (1990-12-01). "On uniformity within NC1". Journal of Computer and System Sciences. 41 (3): 274–306. doi:10.1016/0022-0000(90)90022-D. ISSN 0022-0000

Pairing function (2,488 words) [view diff] exact match in snippet view article find links to article

(December 1992). "Minimum-Complexity Pairing Functions". Journal of Computer and System Sciences. 45 (3): 285–295. doi:10.1016/0022-0000(92)90027-G. ISSN 0022-0000

Bulk synchronous parallel (2,108 words) [view diff] exact match in snippet view article find links to article

G. (2011). A bridging model for multi-core computing. Journal of Computer and System Sciences, 77(1), 154-166 [5] A Bridging Model for High Performance

Michael Kearns (computer scientist) (1,133 words) [view diff] exact match in snippet view article

(European Conference on Computational Learning Theory 1995, Journal of Computer and System Sciences 1997), an adaptive boosting algorithm that won the prestigious

Hash table (6,166 words) [view diff] exact match in snippet view article find links to article

functions and their use in authentication and set equality". Journal of Computer and System Sciences. 22 (3): 265–279. doi:10.1016/0022-0000(81)90033-7. Donald

David Shmoys (1,787 words) [view diff] exact match in snippet view article find links to article

Constant-Factor Approximation Algorithm for the k-Median Problem". Journal of Computer and System Sciences. 65: 129–149. doi:10.1006/jcss.2002.1882. Chudak, F. N

Consensus clustering (2,951 words) [view diff] exact match in snippet view article find links to article

Approximation of Correlation Clustering and Consensus Clustering". Journal of Computer and System Sciences. 74 (5): 671–696. doi:10.1016/j.jcss.2007.06.024. Monti

Intrusion detection system (5,501 words) [view diff] exact match in snippet view article find links to article

(2014). "Algorithms for a distributed IDS in MANETs". Journal of Computer and System Sciences. 80 (3): 554–570. doi:10.1016/j.jcss.2013.06.011. Hansen

Nested word (3,063 words) [view diff] exact match in snippet view article find links to article

"Operator precedence and the visibly pushdown property". Journal of Computer and System Sciences. 78 (6): 1837–1867. doi:10.1016/j.jcss.2011.12.006. Lonati

Maximum cut (3,111 words) [view diff] exact match in snippet view article find links to article

"Optimization, approximation, and complexity classes", Journal of Computer and System Sciences, 43 (3): 425–440, doi:10.1016/0022-0000(91)90023-X. Poljak

Set cover problem (3,011 words) [view diff] exact match in snippet view article find links to article

approximate to within 2− ϵ {\displaystyle \epsilon } , Journal of Computer and System Sciences, pp. 335–349, doi:10.1016/j.jcss.2007.06.019 Trevisan,

PLS (complexity) (5,471 words) [view diff] exact match in snippet view article

Yannakakis, Mihalis (1988). "How easy is local search?". Journal of Computer and System Sciences. 37 (1): 79–100. doi:10.1016/0022-0000(88)90046-3. Mulzer

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

polynomial approximation scheme for the Subset-Sum Problem". Journal of Computer and System Sciences. 66 (2): 349–370. doi:10.1016/S0022-0000(03)00006-0. ISSN 0022-0000

Vector addition system (1,181 words) [view diff] exact match in snippet view article find links to article

Miller, Raymond E. (May 1969). "Parallel program schemata". Journal of Computer and System Sciences. 3 (2): 147–195. doi:10.1016/S0022-0000(69)80011-5. Hopcroft

Splicing language (1,280 words) [view diff] exact match in snippet view article find links to article

a regular language is generated by a splicing system". Journal of Computer and System Sciences. 84: 263–287. doi:10.1016/j.jcss.2016.10.001. ISSN 0022-0000

Coffman–Graham algorithm (1,946 words) [view diff] exact match in snippet view article find links to article

linear-time algorithm for a special case of disjoint set union", Journal of Computer and System Sciences, 30 (2): 209–221, doi:10.1016/0022-0000(85)90014-5, MR 0801823

Multiset (4,983 words) [view diff] exact match in snippet view article find links to article

Milo, T (1996). "Towards tractable algebras for bags". Journal of Computer and System Sciences. 52 (3): 570–588. doi:10.1006/jcss.1996.0042. Libkin, L

Algorithmic probability (2,734 words) [view diff] exact match in snippet view article find links to article

Solomonoff, R., "The Discovery of Algorithmic Probability", Journal of Computer and System Sciences, Vol. 55, No. 1, pp. 73-88, August 1997. Solomonoff, R

S-algol (3,053 words) [view diff] exact match in snippet view article find links to article

R. (1975), "Recursive data structures", International Journal of Computer and System Sciences, 4 (2): 105–132, doi:10.1007/bf00976239, S2CID 24022888

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

Uwe (1988), "Graph Isomorphism is in the Low Hierarchy", Journal of Computer and System Sciences, 37 (3): 312–323, doi:10.1016/0022-0000(88)90010-4 Babai

Decision tree model (3,229 words) [view diff] exact match in snippet view article find links to article

(1972-12-01). "Proving simultaneous positivity of linear forms". Journal of Computer and System Sciences. 6 (6): 639–650. doi:10.1016/S0022-0000(72)80034-5. ISSN 0022-0000

Two-way finite automaton (1,619 words) [view diff] exact match in snippet view article find links to article

(1980). "Lower Bounds on the Size of Sweeping Automata". Journal of Computer and System Sciences. 21 (2): 195–202. doi:10.1016/0022-0000(80)90034-3. John

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

approach to data stream and communication complexity" (PDF). Journal of Computer and System Sciences. 68 (4): 702–732. doi:10.1016/j.jcss.2003.11.006. Retrieved

K-independent hashing (2,001 words) [view diff] exact match in snippet view article find links to article

and their use in authentication and set equality" (PDF). Journal of Computer and System Sciences. 22 (3): 265–279. doi:10.1016/0022-0000(81)90033-7. Conference

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

Jeffrey D. Ullman (1967). "Nonerasing Stack Automata". Journal of Computer and System Sciences. 1 (2): 166–186. doi:10.1016/s0022-0000(67)80013-8. Hopcroft

Kemeny method (2,877 words) [view diff] exact match in snippet view article find links to article

hardness of voting with a constant number of voters". Journal of Computer and System Sciences. 105: 130–157. arXiv:1704.06304. doi:10.1016/j.jcss.2019

Commitment scheme (7,695 words) [view diff] exact match in snippet view article find links to article

Claude Crépeau, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, pp. 156–189, 1988. Goldreich, Oded; Micali, Silvio;

Normalized compression distance (1,970 words) [view diff] exact match in snippet view article find links to article

"Nonapproximability of the normalized information distance". Journal of Computer and System Sciences. 77 (4): 738–742. doi:10.1016/j.jcss.2010.06.018. hdl:2066/92129

Priority queue (5,009 words) [view diff] exact match in snippet view article find links to article

Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 48(3):533-551, 1994 Cormen, Thomas H.; Leiserson, Charles

David Chaum (3,450 words) [view diff] exact match in snippet view article find links to article

Knowledge Archived 2011-09-27 at the Wayback Machine, Journal of Computer and System Sciences, vol. 37, pp. 156–189, 1988. David Chaum and Torben P.

Halting problem (7,350 words) [view diff] exact match in snippet view article find links to article

1974). "Approximations to the halting problem" (PDF). Journal of Computer and System Sciences. 9 (2): 143–150. doi:10.1016/S0022-0000(74)80003-6. Bienvenu

Dominating set (4,082 words) [view diff] exact match in snippet view article find links to article

"Optimization, Approximation, and Complexity Classes", Journal of Computer and System Sciences, 43 (3): 425–440, doi:10.1016/0022-0000(91)90023-X Parekh

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

(2012-05-01). "Fixed-point tile sets and their applications". Journal of Computer and System Sciences. In Commemoration of Amir Pnueli. 78 (3): 731–764. arXiv:0910

Seidel's algorithm (797 words) [view diff] exact match in snippet view article find links to article

All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs". Journal of Computer and System Sciences. 51 (3): 400–403. doi:10.1006/jcss.1995.1078. Zwick, U

Partially observable Markov decision process (3,306 words) [view diff] exact match in snippet view article find links to article

Markov decision processes with ω-regular objectives". Journal of Computer and System Sciences. 82 (5): 878–911. doi:10.1016/j.jcss.2016.02.009. ISSN 0022-0000

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

complexity of Unique k-SAT: An Isolation Lemma for k-CNFs". Journal of Computer and System Sciences. 74 (3): 386. doi:10.1016/j.jcss.2007.06.015. Chari, S

Point location (2,223 words) [view diff] exact match in snippet view article find links to article

Marshall (1990). "Hidden surface removal for rectangles". Journal of Computer and System Sciences. 40 (1): 49–69. doi:10.1016/0022-0000(90)90018-G. MR 1047289

Generalized geography (1,908 words) [view diff] exact match in snippet view article find links to article

complexity of some two-person perfect-information games". Journal of Computer and System Sciences. 16 (2): 185–225. doi:10.1016/0022-0000(78)90045-4. Fraenkel

Classification of finite simple groups (3,961 words) [view diff] exact match in snippet view article find links to article

of bounded valence can be tested in polynomial time". Journal of Computer and System Sciences. 25 (1): 42–65. doi:10.1016/0022-0000(82)90009-5. ISSN 0022-0000

Longest common subsequence (4,355 words) [view diff] exact match in snippet view article find links to article

"A faster algorithm computing string edit distances", Journal of Computer and System Sciences, 20 (1): 18–31, doi:10.1016/0022-0000(80)90002-1, hdl:1721

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

Matching for Highly Compressed Two-Dimensional Texts" (ps). Journal of Computer and System Sciences. 65 (2): 332–350. doi:10.1006/jcss.2002.1852. Retrieved

Quantum cryptography (9,126 words) [view diff] exact match in snippet view article find links to article

protocol and lower bounds for quantum coin flipping". Journal of Computer and System Sciences. 68 (2): 398–416. arXiv:quant-ph/0204022. doi:10.1016/j

Root of unity (5,950 words) [view diff] exact match in snippet view article find links to article

(1985). "Solvability by radicals is in polynomial time". Journal of Computer and System Sciences. 30 (2): 179–208. doi:10.1016/0022-0000(85)90013-3. Gauss

Chvátal–Sankoff constants (1,602 words) [view diff] exact match in snippet view article find links to article

"A faster algorithm computing string edit distances", Journal of Computer and System Sciences, 20 (1): 18–31, doi:10.1016/0022-0000(80)90002-1, hdl:1721

Actor model and process calculi history (2,420 words) [view diff] exact match in snippet view article find links to article

Semantics of nondetermiism, concurrency, and communication Journal of Computer and System Sciences. December 1979. Nancy Lynch and Michael Fischer. On describing

Michel Raynal (1,499 words) [view diff] exact match in snippet view article find links to article

Consistency of Asynchronous Distributed Computations". Journal of Computer and System Sciences. 64 (2): 329–349. doi:10.1006/jcss.2001.1819. GARG, VIJAY

Formal concept analysis (5,372 words) [view diff] exact match in snippet view article find links to article

data via a novel method of matrix decomposition" (PDF). Journal of Computer and System Sciences. 76 (1): 3–20. doi:10.1016/j.jcss.2009.05.002. S2CID 15659185

Rule 90 (3,317 words) [view diff] exact match in snippet view article find links to article

"Tessellation structures for reproduction of arbitrary patterns", Journal of Computer and System Sciences, 5 (5): 455–464, doi:10.1016/S0022-0000(71)80009-0. Wolfram

Effective dimension (1,956 words) [view diff] exact match in snippet view article find links to article

Dimensions of the Kolmogorov Complexity of the Real Line". Journal of Computer and System Sciences. 49 (3): 605–619. doi:10.1016/S0022-0000(05)80073-X. Ludwig

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

(1973). "Time-bounded random access machines" (PDF). Journal of Computer and System Sciences. 7 (4): 354–375. doi:10.1016/S0022-0000(73)80029-7. Davis

Actor model (7,145 words) [view diff] exact match in snippet view article find links to article

Semantics of nondeterminism, concurrency, and communication Journal of Computer and System Sciences. December 1979. George Milne and Robin Milner. Concurrent

Context-free grammar (6,138 words) [view diff] exact match in snippet view article find links to article

"General context-free recognition in less than cubic time". Journal of Computer and System Sciences. 10 (2): 308–315. doi:10.1016/s0022-0000(75)80046-8. Lillian

Structured program theorem (2,912 words) [view diff] exact match in snippet view article find links to article

ACM. pp. 240–252.,"Analysis of Structured Programs". Journal of Computer and System Sciences. 9 (3): 232–255. 1974 [1973]. doi:10.1016/S0022-0000(74)80043-7

Miller–Rabin primality test (5,637 words) [view diff] exact match in snippet view article find links to article

(1976), "Riemann's Hypothesis and Tests for Primality", Journal of Computer and System Sciences, 13 (3): 300–317, doi:10.1145/800116.803773, S2CID 10690396

TFNP (2,698 words) [view diff] exact match in snippet view article find links to article

Rahul (December 2020). "Unique end of potential line". Journal of Computer and System Sciences. 114: 1–35. arXiv:1811.03841. doi:10.1016/j.jcss.2020.05

AdaBoost (4,882 words) [view diff] exact match in snippet view article find links to article

generalization of on-line learning and an application to boosting". Journal of Computer and System Sciences. 55: 119–139. CiteSeerX 10.1.1.32.8918. doi:10.1006/jcss

Metric space (11,436 words) [view diff] exact match in snippet view article find links to article

bound on approximating arbitrary metrics by tree metrics". Journal of Computer and System Sciences. 69 (3): 485–497. doi:10.1016/j.jcss.2004.04.011. Ó Searcóid

Geometric separator (2,388 words) [view diff] exact match in snippet view article find links to article

and application of width bounded geometric separators". Journal of Computer and System Sciences. 77 (2): 379–392. doi:10.1016/j.jcss.2010.05.003. Fu, B

Quadratic residue (5,575 words) [view diff] exact match in snippet view article find links to article

"NP-Complete Decision Problems for Binary Quadratics", Journal of Computer and System Sciences, 16 (2): 168–184, doi:10.1016/0022-0000(78)90044-2. Weisstein

Universal approximation theorem (5,249 words) [view diff] exact match in snippet view article find links to article

computational power of circuits of spiking neurons" (PDF). Journal of Computer and System Sciences. 69 (4): 593–616. doi:10.1016/j.jcss.2004.04.001. Monzani

Language identification in the limit (2,594 words) [view diff] exact match in snippet view article find links to article

(1980). "Finding Patterns Common to a Set of Strings". Journal of Computer and System Sciences. 21: 46–62. doi:10.1016/0022-0000(80)90041-0. p.123 mid

General semantics (6,619 words) [view diff] exact match in snippet view article find links to article

Therapy". "The Discovery of Algorithmic Probability," Journal of Computer and System Sciences, Vol 55, No. 1, pp. 73–88 (pdf version) "Van Vogt moves

Count sketch (1,466 words) [view diff] case mismatch in snippet view article find links to article

space complexity of approximating the frequency moments." Journal of Computer and system sciences 58.1 (1999): 137-147. Moody, John. "Fast learning in multi-resolution

Parallel computation thesis (1,363 words) [view diff] exact match in snippet view article find links to article

(1988-06-01). "Parallel computation with threshold functions". Journal of Computer and System Sciences. 36 (3): 278–302. doi:10.1016/0022-0000(88)90030-X. ISSN 0022-0000

Circumscription (logic) (3,464 words) [view diff] exact match in snippet view article

propositional closed world reasoning and circumscription". Journal of Computer and System Sciences. 48 (2): 255–310. doi:10.1016/S0022-0000(05)80004-2. Lifschitz

Random-sampling mechanism (2,239 words) [view diff] exact match in snippet view article find links to article

mechanism design to algorithm design via machine learning". Journal of Computer and System Sciences. 74 (8): 1245. doi:10.1016/j.jcss.2007.08.002. Edith Elkind

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

½n2 on linear search programs for the Knapsack problem". Journal of Computer and System Sciences. 16 (3): 413–417. doi:10.1016/0022-0000(78)90026-0. In

Arun Sharma (computer scientist) (1,596 words) [view diff] exact match in snippet view article

1998). "A Note on Batch and Incremental Learnability". Journal of Computer and System Sciences. 56 (3): 272–276. doi:10.1006/jcss.1998.1568. Osherson

Median of medians (2,608 words) [view diff] exact match in snippet view article find links to article

E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. "Lecture

Hindley–Milner type system (8,530 words) [view diff] exact match in snippet view article find links to article

(1978). "A Theory of Type Polymorphism in Programming". Journal of Computer and System Sciences. 17 (3): 348–374. CiteSeerX 10.1.1.67.5276. doi:10

Universal hashing (4,886 words) [view diff] exact match in snippet view article find links to article

Mark N. (1979). "Universal Classes of Hash Functions". Journal of Computer and System Sciences. 18 (2): 143–154. doi:10.1016/0022-0000(79)90044-8. Conference

Division algorithm (5,897 words) [view diff] exact match in snippet view article find links to article

parametric error analysis of Goldschmidt's division algorithm". Journal of Computer and System Sciences. 70 (1): 118–139. doi:10.1016/j.jcss.2004.08.004. Hasselström

Point-surjective morphism (758 words) [view diff] exact match in snippet view article find links to article

Interactive forms of diagonalization and self-reference". Journal of Computer and System Sciences. 81 (5): 799–812. arXiv:1006.0992. doi:10.1016/j.jcss.2014

Quantum key distribution (11,929 words) [view diff] exact match in snippet view article find links to article

functions and their use in authentication and set equality". Journal of Computer and System Sciences. 22 (3). Elsevier BV: 265–279. doi:10.1016/0022-0000(81)90033-7

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

Schmied, R. (2015), "New Inapproximability bounds for TSP", Journal of Computer and System Sciences, 81 (8): 1665–1677, arXiv:1303.6437, doi:10.1016/j.jcss

Spaced seed (2,123 words) [view diff] exact match in snippet view article find links to article

efficient method for identifying optimal spaced seeds". Journal of Computer and System Sciences. 68 (1): 22–40. doi:10.1016/j.jcss.2003.04.002. ISSN 0022-0000

Maximum flow problem (5,243 words) [view diff] exact match in snippet view article find links to article

Tarjan (1983). "A data structure for dynamic trees" (PDF). Journal of Computer and System Sciences. 26 (3): 362–391. doi:10.1016/0022-0000(83)90006-5. ISSN 0022-0000

Maker-Breaker game (3,397 words) [view diff] exact match in snippet view article find links to article

complexity of some two-person perfect-information games". Journal of Computer and System Sciences. 16 (2): 185–225. doi:10.1016/0022-0000(78)90045-4. ISSN 0022-0000

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

pseudorandom generators for logspace, and time-space trade-offs", Journal of Computer and System Sciences, 45 (2): 204–232, doi:10.1016/0022-0000(92)90047-M, MR 1186884

Entropic vector (2,469 words) [view diff] exact match in snippet view article find links to article

"Inequalities for Shannon Entropy and Kolmogorov Complexity". Journal of Computer and System Sciences. 60 (2): 442–464. doi:10.1006/jcss.1999.1677. Thomas M

Pancake graph (1,957 words) [view diff] exact match in snippet view article find links to article

Guillaume; Rusu, Irena (2015). "Pancake Flipping Is Hard". Journal of Computer and System Sciences. 81 (8): 1556–1574. arXiv:1111.0434. doi:10.1016/j.jcss

Algorithmically random sequence (4,904 words) [view diff] exact match in snippet view article find links to article

(1973). "Process complexity and effective random tests". Journal of Computer and System Sciences. 7 (4): 376–388. doi:10.1016/s0022-0000(73)80030-3. Chaitin

José Luis González Velarde (1,037 words) [view diff] exact match in snippet view article find links to article

Computational Tool for Optimizing the Urban Public Transport. Journal of Computer and System Sciences International, (2010), Vol. 49, No. 2, pp. 78–86 Co-Autores:

Paris Kanellakis (3,747 words) [view diff] exact match in snippet view article find links to article

Libraries. 1 (1). Fagin, Ronald (1997). "Editor's forward". Journal of Computer and System Sciences. 54 (1): 1. doi:10.1006/jcss.1997.1448. Gaede, Volker;

Fisher market (2,899 words) [view diff] exact match in snippet view article find links to article

(2003-09-01). "On the complexity of price equilibria". Journal of Computer and System Sciences. 67 (2): 311–324. doi:10.1016/S0022-0000(03)00011-4. ISSN 0022-0000

Multi-armed bandit (7,668 words) [view diff] exact match in snippet view article find links to article

Thorsten (2012), "The K-armed dueling bandits problem", Journal of Computer and System Sciences, 78 (5): 1538–1556, CiteSeerX 10.1.1.162.2764, doi:10.1016/j

C-element (3,000 words) [view diff] exact match in snippet view article find links to article

extensions and the delay problem of the second kind". Journal of Computer and System Sciences. 5 (2): 129–162. doi:10.1016/S0022-0000(71)80031-4. Kushnerov

Rice–Shapiro theorem (3,450 words) [view diff] exact match in snippet view article find links to article

Models for Type-2 Polynomial-Time Bounded Functionals". Journal of Computer and System Sciences. 54 (3): 424–436. doi:10.1006/jcss.1997.1487. Longley,

Multiplicative weight update method (3,696 words) [view diff] case mismatch in snippet view article find links to article

On-Line Learning and an Application to Boosting*, p. 55. journal of computer and system sciences. "Online Learning from Experts: Weighed Majority and Hedge"

Essential complexity (1,133 words) [view diff] exact match in snippet view article find links to article

Kosaraju (December 1974). "Analysis of structured programs". Journal of Computer and System Sciences. 9 (3): 232–255. doi:10.1016/S0022-0000(74)80043-7. For

Dynamic connectivity (3,684 words) [view diff] exact match in snippet view article find links to article

which require non-linear time to maintain disjoint sets". Journal of Computer and System Sciences. 18 (2): 110–127. doi:10.1016/0022-0000(79)90042-4. Shiloach

Belief revision (7,935 words) [view diff] exact match in snippet view article find links to article

counterfactuals and iterated knowledge base revisions. Journal of Computer and System Sciences, 53(3):497–512. R. Fagin, J. D. Ullman, and M. Y. Vardi

Graph removal lemma (5,077 words) [view diff] exact match in snippet view article find links to article

Asaf (2004), "Testing subgraphs in directed graphs", Journal of Computer and System Sciences, 69 (3): 353–382, doi:10.1016/j.jcss.2004.04.008, MR 2087940

Parameterized approximation algorithm (3,440 words) [view diff] exact match in snippet view article find links to article

schemes for clustering in low highway dimension graphs". Journal of Computer and System Sciences. 122: 72–93. doi:10.1016/j.jcss.2021.06.002. ISSN 0022-0000

Fully polynomial-time approximation scheme (5,030 words) [view diff] exact match in snippet view article find links to article

Tractability and Approximability of NP Optimization Problems". Journal of Computer and System Sciences. 54 (3): 465–474. doi:10.1006/jcss.1997.1490. Vazirani

Range query (computer science) (5,468 words) [view diff] exact match in snippet view article

E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9. Gfeller

Consensus splitting (5,985 words) [view diff] exact match in snippet view article find links to article

solutions of consensus halving and the Borsuk-Ulam theorem". Journal of Computer and System Sciences. 117: 75–98. arXiv:1903.03101. doi:10.1016/j.jcss.2020

Maximum disjoint set (4,745 words) [view diff] exact match in snippet view article find links to article

and application of width bounded geometric separators". Journal of Computer and System Sciences. 77 (2): 379–392. doi:10.1016/j.jcss.2010.05.003. Chan

Highway dimension (3,144 words) [view diff] exact match in snippet view article find links to article

schemes for clustering in low highway dimension graphs". Journal of Computer and System Sciences. 122: 72–93. doi:10.1016/j.jcss.2021.06.002. ISSN 0022-0000

Characteristic samples (2,769 words) [view diff] exact match in snippet view article find links to article

Mathias, H.David (April 1996). "Teaching a Smarter Learner". Journal of Computer and System Sciences. 52 (2): 255–267. doi:10.1006/jcss.1996.0020. ISSN 0022-0000