Find link

language:

Find link is a tool written by Edward Betts.

searching for Theory of Computing Systems 65 found (82 total)

alternate case: theory of Computing Systems

Trivial measure (311 words) [view diff] exact match in snippet view article find links to article

Christopher P. (2015-04-01). "Trivial Measures are not so Trivial". Theory of Computing Systems. 56 (3): 487–512. arXiv:1503.06332. doi:10.1007/s00224-015-9614-8

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

Mosca, R. (2005), "New graph classes of bounded clique-width", Theory of Computing Systems, 38 (5): 623–645, CiteSeerX 10.1.1.3.5994, doi:10.1007/s00224-004-1154-6

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

(2016). "Upper Bounds on Number of Steals in Rooted Trees". Theory of Computing Systems. 58 (2): 223–240. arXiv:1706.08219. doi:10.1007/s00224-015-9613-9

Ludwig Staiger (445 words) [view diff] exact match in snippet view article find links to article

Liouville numbers, Borel normality and algorithmic randomness, Theory of Computing Systems, First online 27 April 2017, doi:10.1007/s00224-017-9767-8. Staiger

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

Christian (2006), "The effect of faults on network expansion", Theory of Computing Systems, 39 (6): 903–928, arXiv:cs/0404029, doi:10.1007/s00224-006-1349-0

Entanglement (graph measure) (369 words) [view diff] exact match in snippet view article

Lenzi, The variable hierarchy of the mu-calculus is strict, Theory of Computing Systems, vol. 40, pp. 437–466 (2007) You can play the entanglement game

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

Stephen A. (2003). "PP-lowness and a simple definition of AWPP". Theory of Computing Systems. 36 (2): 199–212. doi:10.1007/s00224-002-1089-8. MR 1950277.

Jeff Edmonds (382 words) [view diff] exact match in snippet view article find links to article

Processes with Arbitrary Speedup Curves on a Multiprocessor", Theory of Computing Systems, 49 (4): 817–833, doi:10.1007/s00224-011-9349-0. Edmonds, Jeff;

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

(2000). "On multidimensional curves with Hilbert property". Theory of Computing Systems. 33 (4): 295–312. CiteSeerX 10.1.1.7.2039. doi:10.1007/s002240010003

Bend minimization (733 words) [view diff] exact match in snippet view article find links to article

complexity, and crossing resolution of non-planar graph drawings", Theory of Computing Systems, 49 (3): 565–575, doi:10.1007/s00224-010-9275-6, MR 2822838.

Paul Vitányi (571 words) [view diff] exact match in snippet view article find links to article

Distributed Computing (1987–2003), Information Processing Letters; the Theory of Computing Systems; the Parallel Processing Letters; the International journal of

Poset game (803 words) [view diff] exact match in snippet view article find links to article

complexity of computing winning strategies for finite poset games", Theory of Computing Systems, 48 (3): 680–692, CiteSeerX 10.1.1.150.3656, doi:10.1007/s00224-010-9254-y

Logical depth (300 words) [view diff] exact match in snippet view article find links to article

Teixeira, Andreia (2017-02-01). "Sophistication vs Logical Depth". Theory of Computing Systems. 60 (2): 280–298. arXiv:1304.8046. doi:10.1007/s00224-016-9672-6

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

parameters: an illustration using bounded max leaf number", Theory of Computing Systems, 45 (4): 822–848, doi:10.1007/s00224-009-9167-9, S2CID 4053586

Edith Hemaspaandra (264 words) [view diff] exact match in snippet view article find links to article

retrieved 2022-08-02 "In Memoriam – Alan Selman (1941 – 2021)", Theory of Computing Systems, 67 (3): 413–414, March 2021, doi:10.1007/s00224-021-10036-x

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

Thierrin, Gabriel (March 1968). "Permutation automata". Theory of Computing Systems. 2 (1): 83–90. doi:10.1007/BF01691347. Janusz A. Brzozowski:

Stefan Langerman (575 words) [view diff] exact match in snippet view article find links to article

Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413,

Roger Wattenhofer (362 words) [view diff] exact match in snippet view article find links to article

"Dynamic Analysis of the Arrow Distributed Protocol" (PDF). Theory of Computing Systems. 39 (6): 875–901. doi:10.1007/s00224-006-1251-9. hdl:20.500.11850/24309

Cristian Calude (1,309 words) [view diff] exact match in snippet view article find links to article

"Liouville, Computable, Borel Normal and Martin-Löf Random Numbers". Theory of Computing Systems. 62 (7): 1573–1585. doi:10.1007/s00224-017-9767-8. ISSN 1432-4350

Insertion sort (2,921 words) [view diff] exact match in snippet view article find links to article

Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z

Sophistication (complexity theory) (230 words) [view diff] exact match in snippet view article

Lance (August 30, 2007). "Sophistication Revisited" (PDF). Theory of Computing Systems. 45: 150–161. doi:10.1007/s00224-007-9095-5. S2CID 2020289. Luís

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

and W.-C. Ni, Dynamic Generation of Discrete Random Variates, Theory of Computing Systems, 36(4), 2003, 329-358. J. S. Vitter and P. Krishnan, Optimal

Library sort (927 words) [view diff] exact match in snippet view article find links to article

Miguel A. (June 2006). "Insertion Sort is O(n log n)" (PDF). Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z

Join five (930 words) [view diff] exact match in snippet view article find links to article

Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413,

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

Upper Bounds for the Complexity of Canonical Colour Refinement". Theory of Computing Systems. 60 (4): 581–614. arXiv:1509.08251. doi:10.1007/s00224-016-9686-0

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

(2007). "The Power of Commuting with Finite Sets of Words". Theory of Computing Systems. 40 (4): 521–551. doi:10.1007/s00224-006-1321-z. ISSN 1432-4350

Skew binary number system (1,117 words) [view diff] exact match in snippet view article find links to article

"Two Skew-Binary Numeral Systems and One Application" (PDF). Theory of Computing Systems. 50: 185–211. doi:10.1007/s00224-011-9357-0. S2CID 253736860

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

"Exact Complexity of the Winner Problem for Young Elections". Theory of Computing Systems. 36 (4): 375–386. arXiv:cs/0112021. doi:10.1007/s00224-002-1093-z

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

Arkady (2005), "Efficient data storage in large nanoarrays", Theory of Computing Systems, 38 (4): 503–536, doi:10.1007/s00224-004-1196-9, S2CID 5844939

Distance-hereditary graph (2,290 words) [view diff] exact match in snippet view article find links to article

solvable optimization problems on graphs on bounded clique width", Theory of Computing Systems, 33 (2): 125–150, doi:10.1007/s002249910009, S2CID 15402031.

Cem Say (491 words) [view diff] exact match in snippet view article find links to article

Say, Abuzer Yakaryılmaz, "The complexity of debate checking," Theory of Computing Systems, Vol. 57, pp. 36-80. "Prof. Dr. Cem Say, Özden Örnek'in anısına

Fair cake-cutting (4,016 words) [view diff] exact match in snippet view article find links to article

; Kyropoulou, M. (2011). "The Efficiency of Fair Division". Theory of Computing Systems. 50 (4): 589. CiteSeerX 10.1.1.475.9976. doi:10.1007/s00224-011-9359-y

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

solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, doi:10.1007/s002249910009, MR 1739644, S2CID 15402031

Uzi Vishkin (1,882 words) [view diff] exact match in snippet view article find links to article

Extremely Fine-Grained Parallel Programming Approach" (PDF), Theory of Computing Systems, 36 (5): 551–552, doi:10.1007/s00224-003-1086-6, S2CID 1929495

Consensus (computer science) (4,770 words) [view diff] exact match in snippet view article

Votes: n/4-resilient Distributed Consensus in t + 1 rounds". Theory of Computing Systems. 2. 26: 3–19. doi:10.1007/BF01187072. S2CID 6102847. Burrows

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

Christos A. (2014). "Two-Way Automata Versus Logarithmic Space". Theory of Computing Systems. 55 (2): 421–447. doi:10.1007/s00224-013-9465-0. Sipser, Michael

Matrix mortality problem (233 words) [view diff] exact match in snippet view article find links to article

"The Mortality Problem for Matrices of Low Dimensions" (PDF). Theory of Computing Systems. 35 (4): 433–448. doi:10.1007/s00224-002-1010-5. Heckman, Christopher

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

on exact algorithms for vertex ordering problems on graphs", Theory of Computing Systems, 50 (3): 420–432, doi:10.1007/s00224-011-9312-0, hdl:1956/4556

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

on computable probability spaces - a dynamical point of view. Theory of Computing Systems, 48:465–485, 2011. 10.1007/s00224-010-9263-x, arXiv:0902.1939

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

A Survey and a New Algorithm for a Distributed Environment", Theory of Computing Systems, 37 (3): 441–456, CiteSeerX 10.1.1.76.5973, doi:10.1007/s00224-004-1155-5

Sorting algorithm (6,477 words) [view diff] exact match in snippet view article find links to article

Stably, in Place, with O(n log n) Comparisons and O(n) Moves". Theory of Computing Systems. 40 (4): 327–353. doi:10.1007/s00224-006-1311-1. Thorup, M. (February

Courcelle's theorem (3,146 words) [view diff] exact match in snippet view article find links to article

solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, CiteSeerX 10.1.1.414.1845, doi:10.1007/s002249910009

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

"Why computational complexity requires stricter martingales". Theory of Computing Systems. Jack H. Lutz (2003). "Dimension in complexity classes". SIAM

Double compare-and-swap (822 words) [view diff] exact match in snippet view article find links to article

Shavit, and Guy L. Steele Jr. "DCAS-Based Concurrent Deques." Theory of Computing Systems 35, no. 3 (2002): 349-386. Keir Fraser (2004), "Practical lock-freedom"

Heapsort (5,718 words) [view diff] exact match in snippet view article find links to article

2016). "QuickHeapsort: Modifications and improved analysis". Theory of Computing Systems. 59 (2): 209–230. arXiv:1209.4214. doi:10.1007/s00224-015-9656-y

Arthur Langerman (1,573 words) [view diff] exact match in snippet view article find links to article

Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413,

Automatic sequence (3,157 words) [view diff] exact match in snippet view article find links to article

Point, F.; Bruyère, V. (1997). "On the Cobham-Semenov theorem". Theory of Computing Systems. 30 (2): 197–220. doi:10.1007/BF02679449. S2CID 31270341. Lothaire

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

Ivan (2019). "Cascade heap: towards time-optimal extractions". Theory of Computing Systems. 63 (4): 637–646. doi:10.1007/s00224-018-9866-1. MR 3942251.

Price of fairness (1,805 words) [view diff] exact match in snippet view article find links to article

; Kyropoulou, M. (2011). "The Efficiency of Fair Division". Theory of Computing Systems. 50 (4): 589. CiteSeerX 10.1.1.475.9976. doi:10.1007/s00224-011-9359-y

Hopcroft–Karp algorithm (3,746 words) [view diff] exact match in snippet view article find links to article

(2006), "Matching algorithms are fast in sparse random graphs", Theory of Computing Systems, 39 (1): 3–14, CiteSeerX 10.1.1.395.6643, doi:10.1007/s00224-005-1254-y

Explicit multi-threading (1,572 words) [view diff] exact match in snippet view article find links to article

Extremely Fine-Grained Parallel Programming Approach" (PDF), Theory of Computing Systems, 36 (5): 551–552, doi:10.1007/s00224-003-1086-6, S2CID 1929495

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

Existence of Potential Functions in Weighted Congestion Games". Theory of Computing Systems. 49 (1): 46–70. doi:10.1007/s00224-011-9315-x. ISSN 1433-0490

Steiner tree problem (4,434 words) [view diff] exact match in snippet view article find links to article

(2007). "Dynamic Programming for Minimum Steiner Trees" (PDF). Theory of Computing Systems. 41 (3): 493–500. doi:10.1007/s00224-007-1324-4. S2CID 7478978

Catalytic computing (679 words) [view diff] exact match in snippet view article find links to article

(2018-01-01). "Catalytic Space: Non-determinism and Hierarchy". Theory of Computing Systems. 62 (1): 116–135. doi:10.1007/s00224-017-9784-7. ISSN 1433-0490

List of unsolved problems in fair division (3,593 words) [view diff] exact match in snippet view article find links to article

Warut (2021). "The Price of Fairness for Indivisible Goods". Theory of Computing Systems. 65 (7): 1069–1093. arXiv:1905.04910. doi:10.1007/s00224-021-10039-8

Parallel task scheduling (2,520 words) [view diff] exact match in snippet view article find links to article

Inapproximability Results for Parallel Task Scheduling and Strip Packing". Theory of Computing Systems. 64 (1): 120–140. arXiv:1705.04587. doi:10.1007/s00224-019-09910-6

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

Christos A. (2014). "Two-Way Automata Versus Logarithmic Space". Theory of Computing Systems. 55 (2): 421–447. doi:10.1007/s00224-013-9465-0. S2CID 14808151

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

on exact algorithms for vertex ordering problems on graphs". Theory of Computing Systems. 50 (3): 420–432. doi:10.1007/s00224-011-9312-0. hdl:1956/4556

Diameter (graph theory) (1,082 words) [view diff] exact match in snippet view article

algorithm for the diameter and all eccentricities on median graphs", Theory of Computing Systems, 68 (1): 144–193, arXiv:2110.02709, doi:10.1007/s00224-023-10153-9

Range mode query (2,948 words) [view diff] exact match in snippet view article find links to article

"Linear-Space Data Structures for Range Mode Query in Arrays" (PDF). Theory of Computing Systems. Springer: 1–23. Krizanc, Danny; Morin, Pat; Smid, Michiel H

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

Shortest Paths and Non-Linear Objectives with Applications". Theory of Computing Systems. 45 (1): 162–186. doi:10.1007/s00224-007-9096-4. ISSN 1433-0490

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

"Linear-Space Data Structures for Range Mode Query in Arrays". Theory of Computing Systems. 55 (4): 719–741. doi:10.1007/s00224-013-9455-2. ISSN 1432-4350

LCP array (4,379 words) [view diff] exact match in snippet view article find links to article

(2007). "Compressed Suffix Trees with Full Functionality". Theory of Computing Systems. 41 (4): 589–607. CiteSeerX 10.1.1.224.4152. doi:10.1007/s00224-006-1198-x

Strip packing problem (7,808 words) [view diff] exact match in snippet view article find links to article

Inapproximability Results for Parallel Task Scheduling and Strip Packing". Theory of Computing Systems. 64: 120–140. arXiv:1705.04587. doi:10.1007/s00224-019-09910-6

Price of anarchy in congestion games (3,839 words) [view diff] exact match in snippet view article find links to article

Linearly Independent Paths: Convergence Time and Price of Anarchy". Theory of Computing Systems. 47 (1): 113–136. doi:10.1007/s00224-009-9205-7. ISSN 1433-0490