Find link

language:

Find link is a tool written by Edward Betts.

searching for Information Processing Letters 250 found (377 total)

alternate case: information Processing Letters

Rectilinear minimum spanning tree (332 words) [view diff] exact match in snippet view article find links to article

computing all northeast nearest neighbors in the L1 metric", Information Processing Letters, 17 (1983), pp. 219--223 Hai Zhou, Narendra Shenoy, William

Minimum-weight triangulation (3,289 words) [view diff] exact match in snippet view article find links to article

Franz; Hainz, Reinhard (1999), "New results on MWT subgraphs", Information Processing Letters, 69 (5): 215–219, doi:10.1016/S0020-0190(99)00018-6. Anagnostou

Acyclic coloring (720 words) [view diff] exact match in snippet view article find links to article

of graphs of maximum degree five: Nine colors are enough", Information Processing Letters, 105 (2): 65–72, CiteSeerX 10.1.1.78.5369, doi:10.1016/j.ipl

Path-based strong component algorithm (612 words) [view diff] exact match in snippet view article find links to article

depth-first search for strong and biconnected components" (PDF), Information Processing Letters, 74 (3–4): 107–114, doi:10.1016/S0020-0190(00)00051-X, MR 1761551

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

Endre (1974), "A note on finding the bridges of a graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9, MR 0349483

Strongly connected component (1,639 words) [view diff] exact match in snippet view article find links to article

finding the strongly connected components in a directed graph", Information Processing Letters, 49 (1): 9–14, doi:10.1016/0020-0190(94)90047-7 Thomas H. Cormen

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

Williams, Ryan (2009), "Finding paths of length k in O*(2k) time", Information Processing Letters, 109 (6): 315–318, arXiv:0807.3026, doi:10.1016/j.ipl.2008.11

Metric tree (557 words) [view diff] exact match in snippet view article find links to article

"Satisfying General Proximity/Similarity Queries with Metric Trees". Information Processing Letters. 40 (4): 175–179. doi:10.1016/0020-0190(91)90074-r. Yianilos

Edge-matching puzzle (908 words) [view diff] exact match in snippet view article find links to article

September 2006). "TetraVex is NP-complete". Information Processing Letters. 99 (5). Information Processing Letters, Volume 99, Issue 5, Pages 171–174: 171–174

Graham scan (1,738 words) [view diff] exact match in snippet view article find links to article

Determining the Convex Hull of a Finite Planar Set" (PDF). Information Processing Letters. 1 (4): 132–133. doi:10.1016/0020-0190(72)90045-2. Andrew, A

Tarjan's strongly connected components algorithm (1,711 words) [view diff] exact match in snippet view article find links to article

Finding the Strongly Connected Components in a Directed Graph", Information Processing Letters, 49 (1): 9–14, doi:10.1016/0020-0190(94)90047-7 Pearce, David

Naccache–Stern knapsack cryptosystem (565 words) [view diff] exact match in snippet view article find links to article

type attacks to the Naccache–Stern knapsack cryptosystem". Information Processing Letters. 138: 39–43. doi:10.1016/j.ipl.2018.06.002. Original Paper Recent

Prefix grammar (278 words) [view diff] exact match in snippet view article find links to article

Frazier and C. D. Page. Prefix grammars: An alternative characterization of the regular languages. Information Processing Letters, 51(2):67–71, 1994.

SEED (731 words) [view diff] exact match in snippet view article find links to article

Jaechul (2011). "Differential cryptanalysis of eight-round SEED". Information Processing Letters. 111 (10): 474–478. doi:10.1016/j.ipl.2011.02.004. Gen Kanai

Jeffrey Uhlmann (769 words) [view diff] exact match in snippet view article find links to article

"Satisfying General Proximity/Similarity Queries with Metric Trees". Information Processing Letters. 40 (4): 175–179. doi:10.1016/0020-0190(91)90074-r. Jeffrey

Hamiltonian completion (449 words) [view diff] exact match in snippet view article find links to article

tree and the Hamiltonian completion number of its line graph", Information Processing Letters, 56 (6): 299–306, doi:10.1016/0020-0190(95)00163-8, MR 1366337

Sardinas–Patterson algorithm (1,375 words) [view diff] exact match in snippet view article find links to article

implementation of a fast test for unique decipherability". Information Processing Letters. 18 (3): 155–158. doi:10.1016/0020-0190(84)90020-6.. Rytter

Five color theorem (1,923 words) [view diff] exact match in snippet view article find links to article

E. (1978), "A batching method for coloring planar graphs", Information Processing Letters, 7 (4): 185–188, doi:10.1016/0020-0190(78)90065-0, MR 0497394

Streebog (854 words) [view diff] exact match in snippet view article find links to article

Wang (2013-09-10). "Cryptanalysis of GOST R hash function". Information Processing Letters. 114 (12): 655–662. doi:10.1016/j.ipl.2014.07.007. Biryukov

Vantage-point tree (1,148 words) [view diff] exact match in snippet view article find links to article

"Satisfying General Proximity/Similarity Queries with Metric Trees". Information Processing Letters. 40 (4): 175–179. doi:10.1016/0020-0190(91)90074-r. Nielsen

Y-fast trie (1,418 words) [view diff] exact match in snippet view article find links to article

"Log-logarithmic worst-case range queries are possible in space Θ(N)". Information Processing Letters. 17 (2). Elsevier: 81–84. doi:10.1016/0020-0190(83)90075-3.

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

improved upper bound on the queuenumber of the hypercube", Information Processing Letters, 104 (2): 41–44, doi:10.1016/j.ipl.2007.05.006, MR 2343263.

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

search for strong and biconnected components,'' H.N. Gabow, Information Processing Letters 74, 2000, 107-114. "The weighted matching approach to maximum

Cube-connected cycles (619 words) [view diff] exact match in snippet view article find links to article

Petr (1997), "The diameter of the cube-connected cycles", Information Processing Letters, 61 (3): 157–160, doi:10.1016/S0020-0190(97)00013-6. Germa,

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

Space-filling curves for domains with unequal side lengths". Information Processing Letters. 105 (5): 155–163. doi:10.1016/j.ipl.2007.08.034. Alber, J.;

Implication graph (270 words) [view diff] exact match in snippet view article find links to article

testing the truth of certain quantified boolean formulas". Information Processing Letters. 8 (3): 121–123. doi:10.1016/0020-0190(79)90002-4. Paul Beame;

Szymanski's conjecture (254 words) [view diff] exact match in snippet view article find links to article

"Counterexample to a conjecture of Szymanski on hypercube routing", Information Processing Letters, 35 (2): 57–61, doi:10.1016/0020-0190(90)90106-8. Szymanski

Waldemar W. Koczkodaj (1,183 words) [view diff] exact match in snippet view article find links to article

Michael W. (1996). "A Monte Carlo study of pairwise comparison". Information Processing Letters. 57: 25–29. doi:10.1016/0020-0190(95)00185-9. Koczkodaj, Waldemar

Impossible differential cryptanalysis (850 words) [view diff] exact match in snippet view article find links to article

2004). "Impossible Differential Cryptanalysis of 7-round AES". Information Processing Letters. 91 (1): 29–32. doi:10.1016/j.ipl.2004.03.006. Retrieved 2007-07-19

Dancing Links (1,035 words) [view diff] exact match in snippet view article find links to article

for Implementing Backtrack Algorithms and its Application". Information Processing Letters. 8 (4): 174–175. doi:10.1016/0020-0190(79)90016-4.(subscription

Modular product of graphs (328 words) [view diff] exact match in snippet view article find links to article

isomorphism, matching relational structures and maximal cliques", Information Processing Letters, 4 (4): 83–84, doi:10.1016/0020-0190(76)90049-1. Levi, G. (1973)

X-fast trie (1,405 words) [view diff] exact match in snippet view article find links to article

"Log-logarithmic worst-case range queries are possible in space Θ(N)". Information Processing Letters. 17 (2). Elsevier: 81–84. doi:10.1016/0020-0190(83)90075-3.

NL-complete (659 words) [view diff] exact match in snippet view article find links to article

"The space complexity of the unique decipherability problem", Information Processing Letters, 23 (1): 1–3, doi:10.1016/0020-0190(86)90121-3, MR 0853618.

Range tree (1,250 words) [view diff] exact match in snippet view article find links to article

Bentley, J. L. (1979). "Decomposable searching problems" (PDF). Information Processing Letters. 8 (5): 244–251. doi:10.1016/0020-0190(79)90117-0. Archived

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

Yongge (1999). "A separation of two randomness concepts". Information Processing Letters. 69 (3): 115–118. CiteSeerX 10.1.1.46.199. doi:10.1016/S0020-0190(98)00202-6

Lexicographically minimal string rotation (782 words) [view diff] exact match in snippet view article find links to article

Booth (1980). "Lexicographically least circular substrings". Information Processing Letters. 10 (4–5). Elsevier: 240–242. doi:10.1016/0020-0190(80)90149-0

Kinetic heap (1,097 words) [view diff] exact match in snippet view article find links to article

heap-ordered trees: Tight analysis and improved algorithms" (PDF). Information Processing Letters. pp. 165–169. Archived from the original (PDF) on May 24, 2015

Jean Vuillemin (364 words) [view diff] exact match in snippet view article find links to article

"Linear-time construction of treaps and Cartesian trees", Information Processing Letters, 52 (5): 253–257, doi:10.1016/0020-0190(94)00150-2 Tarjan, Robert

Single-machine scheduling (2,762 words) [view diff] exact match in snippet view article find links to article

scheduling starting time dependent tasks with release times". Information Processing Letters. 65 (2): 75–79. doi:10.1016/S0020-0190(97)00195-6. ISSN 0020-0190

Depth-first search (2,447 words) [view diff] exact match in snippet view article find links to article

John H. (1985). "Depth-first search is inherently sequential". Information Processing Letters. 20 (5): 229–234. doi:10.1016/0020-0190(85)90024-9. Mehlhorn

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

approximation algorithms of k-tuple domination in graphs", Information Processing Letters, 89 (2): 75–83, doi:10.1016/j.ipl.2003.10.004. Papadimitriou

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

Robert E. (1974), "A Note on Finding the Bridges of a Graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9 Tarjan, Robert

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

Takenaga, Yasuhiko (2020-07-02). "QUIXO is EXPTIME-complete". Information Processing Letters. 162: 105995. doi:10.1016/j.ipl.2020.105995. ISSN 0020-0190

List ranking (471 words) [view diff] exact match in snippet view article find links to article

"A simple randomized parallel algorithm for list-ranking", Information Processing Letters, 33 (5): 269–273, doi:10.1016/0020-0190(90)90196-5. Cole, Richard;

Emo Welzl (689 words) [view diff] exact match in snippet view article find links to article

"Constructing the visibility graph for n line segments in O(n2) time", Information Processing Letters, 20 (4): 167–171, doi:10.1016/0020-0190(85)90044-4, MR 0801812

David Plaisted (616 words) [view diff] exact match in snippet view article find links to article

of journals, including the Journal of Symbolic Computation, Information Processing Letters, Mathematical Systems Theory, and Fundamenta Informaticae. Plaisted

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

A., Haussler, D., & Warmuth, M. K. (1987). Occam's razor. Information processing letters, 24(6), 377-380. Kearns, M. J., & Vazirani, U. V. (1994). An

Guillotine partition (1,283 words) [view diff] exact match in snippet view article find links to article

(2006-05-31). "The number of guillotine partitions in d dimensions". Information Processing Letters. 98 (4): 162–167. doi:10.1016/j.ipl.2006.01.011. ISSN 0020-0190

Computational complexity of mathematical operations (1,576 words) [view diff] exact match in snippet view article find links to article

improved parallel processor bound in fast matrix inversion". Information Processing Letters. 7 (3): 148–150. doi:10.1016/0020-0190(78)90079-0. Galil, Zvi;

Strahler number (2,065 words) [view diff] exact match in snippet view article find links to article

(1995), "A note on the Horton–Strahler number for random trees", Information Processing Letters, 56 (2): 95–99, doi:10.1016/0020-0190(95)00114-R. Devroye, L

Hashiwokakero (782 words) [view diff] exact match in snippet view article find links to article

(link) Andersson, Daniel (2009), "Hashiwokakero is NP-complete", Information Processing Letters, 109 (19): 1145–1146, doi:10.1016/j.ipl.2009.07.017, MR 2552932

Competitions and prizes in artificial intelligence (2,218 words) [view diff] exact match in snippet view article find links to article

Takenaga, Yasuhiko; Walsh, Toby (2006). "Tetravex is NP-complete". Information Processing Letters. 99 (5): 171–174. arXiv:0903.1147. doi:10.1016/j.ipl.2006.04

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

routing in the star and pancake interconnection networks". Information Processing Letters. 45 (6): 315–320. CiteSeerX 10.1.1.35.9056. doi:10.1016/0020-0190(93)90043-9

Diffie–Hellman problem (954 words) [view diff] exact match in snippet view article find links to article

Diffie–Hellman modulo a composite is no easier than factoring". Information Processing Letters. 70 (2): 83–87. CiteSeerX 10.1.1.39.110. doi:10.1016/S0020-0190(99)00047-2

Tree rotation (1,443 words) [view diff] exact match in snippet view article find links to article

(2003), "Right-arm rotation distance between binary trees", Information Processing Letters, 87 (4), Elsevier BV: 173–177, doi:10.1016/s0020-0190(03)00283-7

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

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

Tree (graph theory) (3,383 words) [view diff] exact match in snippet view article

Jerrum, Mark (1994), "Counting trees in a graph is #P-complete", Information Processing Letters, 51 (3): 111–116, doi:10.1016/0020-0190(94)00085-9, ISSN 0020-0190

Dijkstra–Scholten algorithm (752 words) [view diff] exact match in snippet view article find links to article

"Termination detection for diffusing computations" (PDF), Information Processing Letters, 11 (1): 1–4, doi:10.1016/0020-0190(80)90021-6, MR 0585394.

Prim's algorithm (2,079 words) [view diff] exact match in snippet view article find links to article

"Priority queues with update and finding minimum spanning trees", Information Processing Letters, 4 (3): 53–57, doi:10.1016/0020-0190(75)90001-0. Grama, Ananth;

Word RAM (560 words) [view diff] exact match in snippet view article find links to article

"Log-logarithmic worst-case range queries are possible in space Θ (N)". Information Processing Letters. 17 (2): 81–84. doi:10.1016/0020-0190(83)90075-3. Andersson

Hamiltonian path (2,043 words) [view diff] exact match in snippet view article find links to article

(April 2005). "On Hamiltonian cycles and Hamiltonian paths". Information Processing Letters. 94: 37–41. doi:10.1016/j.ipl.2004.12.002. Moon, J.; Moser,

Biconnected component (1,389 words) [view diff] exact match in snippet view article find links to article

(2013), "A Simple Test on 2-Vertex- and 2-Edge-Connectivity", Information Processing Letters, 113 (7): 241–244, arXiv:1209.0700, doi:10.1016/j.ipl.2013.01

Gavin Lowe (computer scientist) (577 words) [view diff] exact match in snippet view article

the Needham-Schroeder public key authentication protocol". Information Processing Letters. 56 (3): 131–136. CiteSeerX 10.1.1.394.6094. doi:10.1016/0020-0190(95)00144-2

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

complexity characterization of constructive Hausdorff dimension". Information Processing Letters. 84: 1–3. doi:10.1016/S0020-0190(02)00343-5. Ludwig Staiger

Queue (abstract data type) (2,130 words) [view diff] exact match in snippet view article

(November 1981). "Real-time queue operations in pure Lisp". Information Processing Letters. 13 (2): 50–54. doi:10.1016/0020-0190(81)90030-2. hdl:1813/6273

Camellia (cipher) (1,805 words) [view diff] exact match in snippet view article

"Impossible differential attack on 13-round Camellia-192". Information Processing Letters. 115 (9): 660–666. doi:10.1016/j.ipl.2015.03.008. Retrieved

Hash function security summary (1,063 words) [view diff] exact match in snippet view article find links to article

Wang (2013-09-10). "Cryptanalysis of GOST R hash function". Information Processing Letters. 114 (12): 655–662. doi:10.1016/j.ipl.2014.07.007. Florian Mendel;

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

"Log-logarithmic worst-case range queries are possible in space O(n)". Information Processing Letters. 17 (2): 81–84. doi:10.1016/0020-0190(83)90075-3. Sartaj Sahni

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

Frank M. (1980). "A lower bound for on-line bin packing". Information Processing Letters. 10 (2): 76–79. doi:10.1016/S0020-0190(80)90077-0. van Vliet

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

Ran (1996). "More on BPP and the polynomial-time hierarchy". Information Processing Letters. 57 (5). Elsevier: 237–241. doi:10.1016/0020-0190(96)00016-6

Aho–Corasick algorithm (1,255 words) [view diff] exact match in snippet view article find links to article

Meyer, Bertrand (1985). "Incremental string matching" (PDF). Information Processing Letters. 21 (5): 219–227. doi:10.1016/0020-0190(85)90088-2. Wikimedia

Cellular evolutionary algorithm (1,099 words) [view diff] exact match in snippet view article find links to article

Best-So-Far Solutions for Capacitated VRP with a Cellular GA, Information Processing Letters, Elsevier, 98(6):225-230, 30 June 2006 M. Giacobini, M. Tomassini

Merge-insertion sort (1,788 words) [view diff] exact match in snippet view article find links to article

Ford-Johnson algorithm still unbeaten for less than 47 elements", Information Processing Letters, 101 (3): 126–128, doi:10.1016/j.ipl.2006.09.001, MR 2287331

Flow network (3,081 words) [view diff] exact match in snippet view article find links to article

O(|V|^{3})} algorithm for finding maximum flows in networks" (PDF). Information Processing Letters. 7 (6): 277–278. doi:10.1016/0020-0190(78)90016-9. Archived

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

Joseph (Seffi) (1999). "The budgeted maximum coverage problem". Information Processing Letters. 70: 39–45. CiteSeerX 10.1.1.49.5784. doi:10.1016/S0020-0190(99)00031-9

Feedback arc set (6,130 words) [view diff] exact match in snippet view article find links to article

and effective heuristic for the feedback arc set problem", Information Processing Letters, 47 (6): 319–323, doi:10.1016/0020-0190(93)90079-O, MR 1256786

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

approximability of the maximum leaves spanning tree problem", Information Processing Letters, 52 (1): 45–49, doi:10.1016/0020-0190(94)90139-2. Solis-Oba

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

(6 May 1987). "Does co-NP have short interactive proofs?". Information Processing Letters. 25 (2): 127–132. doi:10.1016/0020-0190(87)90232-8. Papadimitriou

Peterson's algorithm (1,119 words) [view diff] exact match in snippet view article find links to article

G. L. Peterson: "Myths About the Mutual Exclusion Problem", Information Processing Letters 12(3) 1981, 115–116 As discussed in Operating Systems Review

Boyce–Codd normal form (1,682 words) [view diff] exact match in snippet view article find links to article

Note on Relational Schemes Which Are in 3NF But Not in BCNF". Information Processing Letters 48(6), 1993, pp. 281–283. Beeri, Catriel and Bernstein, Philip

Theoretical computer science (4,803 words) [view diff] exact match in snippet view article find links to article

Complexity Journal of Complexity ACM Transactions on Algorithms Information Processing Letters Open Computer Science (open access journal) Annual ACM Symposium

Graph coloring game (4,118 words) [view diff] exact match in snippet view article find links to article

chromatic number and the game colouring number of cactuses". Information Processing Letters. 102 (4): 147–151. doi:10.1016/j.ipl.2006.12.003. Bartnicki

Repeated median regression (568 words) [view diff] exact match in snippet view article find links to article

the repeated median regression line in linear time" (PDF). Information Processing Letters. 88 (3): 111–117. doi:10.1016/s0020-0190(03)00350-8. hdl:2003/5224

Skip list (2,423 words) [view diff] exact match in snippet view article find links to article

Sen, Sandeep (1991). "Some observations on skip lists". Information Processing Letters. 39 (4): 173–176. doi:10.1016/0020-0190(91)90175-H. Shah, Gauri

Rectangle packing (949 words) [view diff] exact match in snippet view article find links to article

"Optimal packing and covering in the plane are NP-complete". Information Processing Letters. 12 (3): 133–137. doi:10.1016/0020-0190(81)90111-3. ISSN 0020-0190

Nested dissection (504 words) [view diff] exact match in snippet view article find links to article

(1988), "Some nested dissection order is nearly optimal", Information Processing Letters, 26 (6): 325–328, doi:10.1016/0020-0190(88)90191-3, hdl:1813/6607

Transitive closure (2,306 words) [view diff] exact match in snippet view article find links to article

determination of the transitive closure of a directed graph". Information Processing Letters. 1 (2): 56–58. doi:10.1016/0020-0190(71)90006-8. Nuutila, Esko

Selim Akl (724 words) [view diff] exact match in snippet view article find links to article

editor of Journal of Cryptology (Springer-Verlag; 1988–1991), Information Processing Letters (North-Holland; 1989–1999), and Parallel Algorithms and Applications

Polynomial delay (242 words) [view diff] exact match in snippet view article find links to article

C. H. (1988), "On generating all maximal independent sets", Information Processing Letters, 27 (3): 119–123, doi:10.1016/0020-0190(88)90065-8, MR 0933271

3-dimensional matching (1,550 words) [view diff] exact match in snippet view article find links to article

"Maximum bounded 3-dimensional matching is MAX SNP-complete", Information Processing Letters, 37 (1): 27–35, doi:10.1016/0020-0190(91)90246-E. Karp, Richard

3-dimensional matching (1,550 words) [view diff] exact match in snippet view article find links to article

"Maximum bounded 3-dimensional matching is MAX SNP-complete", Information Processing Letters, 37 (1): 27–35, doi:10.1016/0020-0190(91)90246-E. Karp, Richard

Donald B. Johnson (357 words) [view diff] exact match in snippet view article find links to article

"Priority queues with update and finding minimum spanning trees", Information Processing Letters, 4 (3): 53–57, doi:10.1016/0020-0190(75)90001-0. Tarjan, R.

Spanning tree (3,280 words) [view diff] exact match in snippet view article find links to article

John H. (1985), "Depth-first search is inherently sequential", Information Processing Letters, 20 (5): 229–234, doi:10.1016/0020-0190(85)90024-9, MR 0801987

Floyd–Warshall algorithm (3,017 words) [view diff] exact match in snippet view article find links to article

"The Floyd–Warshall algorithm on graphs with negative cycles". Information Processing Letters. 110 (8–9): 279–281. doi:10.1016/j.ipl.2010.02.001. "Free Algorithms

Signcryption (918 words) [view diff] exact match in snippet view article find links to article

construct efficient signcryption schemes on elliptic curves". Information Processing Letters. 68 (5): 227–233. doi:10.1016/S0020-0190(98)00167-7. Toorani

Generalized assignment problem (1,054 words) [view diff] exact match in snippet view article find links to article

efficient approximation for the Generalized Assignment Problem". Information Processing Letters. 100 (4): 162–166. CiteSeerX 10.1.1.159.1947. doi:10.1016/j

HCS clustering algorithm (1,154 words) [view diff] exact match in snippet view article find links to article

(2000), "A clustering algorithm based on graph connectivity", Information Processing Letters, 76 (4–6): 175–181, doi:10.1016/S0020-0190(00)00142-3 E Hartuv

Aviv Regev (1,749 words) [view diff] exact match in snippet view article find links to article

representation and simulation of molecular processes" (PDF). Information Processing Letters. 80: 25–31. doi:10.1016/S0020-0190(01)00214-9. Study provides

Neuman–Stubblebine protocol (649 words) [view diff] exact match in snippet view article find links to article

"Two attacks on Neuman-Stubblebine authentication protocols", Information Processing Letters, 53 (2), Tainan, Taiwan: 103–107, doi:10.1016/0020-0190(95)00177-E

Killian documents authenticity issues (3,280 words) [view diff] exact match in snippet view article find links to article

Hardcopy Scan Line Graphics System for Document Generation". Information Processing Letters. 1 (6): 246–251. doi:10.1016/0020-0190(72)90021-X. Jonathan

Layered graph drawing (2,246 words) [view diff] exact match in snippet view article find links to article

and effective heuristic for the feedback arc set problem", Information Processing Letters, 47 (6): 319–323, doi:10.1016/0020-0190(93)90079-O. Eades, P

Carving width (880 words) [view diff] exact match in snippet view article find links to article

Neal (April 1994), "Designing multi-commodity flow trees", Information Processing Letters, 50 (1): 49–55, arXiv:cs/0205077, doi:10.1016/0020-0190(94)90044-2

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

"On the serializability theorem for nested transactions". Information Processing Letters. 50 (4): 177–183. CiteSeerX 10.1.1.43.6470. doi:10.1016/0020-0190(94)00033-6

Kinetic heater (489 words) [view diff] exact match in snippet view article find links to article

Celina M. H. and Carvalho, Paulo C. P. "Kinetic hanger" (PDF). Information Processing Letters. pp. 151–157. Archived from the original (PDF) on May 24, 2015

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

O(|V|^{3})} algorithm for finding maximum flows in networks" (PDF). Information Processing Letters. 7 (6): 277–278. doi:10.1016/0020-0190(78)90016-9. Goldberg

Godfried Toussaint (1,217 words) [view diff] exact match in snippet view article find links to article

and Godfried T. Toussaint, "A fast convex hull algorithm," Information Processing Letters, Vol. 7, August 1978, pp. 219-222. A. Adamatzky, "Developing

Kinetic priority queue (622 words) [view diff] exact match in snippet view article find links to article

Celina M. H.; Carvalho, Paulo C. P. "Kinetic hanger" (PDF). Information Processing Letters. pp. 151–157. Archived from the original (PDF) on May 24, 2015

Sipser–Lautemann theorem (1,005 words) [view diff] exact match in snippet view article find links to article

Ran (1996). "More on BPP and the polynomial-time hierarchy". Information Processing Letters. 57 (5): 237–241. doi:10.1016/0020-0190(96)00016-6. Russell

Sorting network (2,159 words) [view diff] exact match in snippet view article find links to article

2017). "Merging almost sorted sequences yields a 24-sorter". Information Processing Letters. 118: 17–20. doi:10.1016/j.ipl.2016.08.005. Dobbelaere, Bert

Weak Büchi automaton (297 words) [view diff] exact match in snippet view article find links to article

"Efficient Minimization of Deterministic Weak ω-Automata". Information Processing Letters. 79 (3): 105–109. doi:10.1016/S0020-0190(00)00183-6. Boigelot

Kolakoski sequence (1,483 words) [view diff] exact match in snippet view article find links to article

repeated factors in C ∞ {\displaystyle C^{\infty }} -words". Information Processing Letters. 52 (6): 289–294. doi:10.1016/0020-0190(94)00162-6. ISSN 0020-0190

Force-directed graph drawing (2,224 words) [view diff] exact match in snippet view article find links to article

(1989), "An algorithm for drawing general undirected graphs", Information Processing Letters, 31 (1), Elsevier: 7–15, doi:10.1016/0020-0190(89)90102-6. Fruchterman

Direct Anonymous Attestation (1,189 words) [view diff] exact match in snippet view article find links to article

Li (2010). "A note on the Chen-Morrissey-Smart DAA scheme". Information Processing Letters. 110 (12–13): 485–488. doi:10.1016/j.ipl.2010.04.017. Chen;

D-ary heap (1,747 words) [view diff] exact match in snippet view article find links to article

"Priority queues with update and finding minimum spanning trees", Information Processing Letters, 4 (3): 53–57, doi:10.1016/0020-0190(75)90001-0. Tarjan, R.

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

Knuth, D.E. (1977). "A Generalization of Dijkstra's Algorithm". Information Processing Letters. 6 (1): 1–5. doi:10.1016/0020-0190(77)90002-3. Regular tree

Tshilidzi Marwala (1,622 words) [view diff] no match in snippet view article find links to article

in human EEG signals using Bayesian neural networks". Neural Information Processing-Letters and Reviews. 10 (1). B.B. Leke; T. Marwala (2006). "Autoencoder

Identical-machines scheduling (1,487 words) [view diff] exact match in snippet view article find links to article

Y-T. (1989-05-08). "Bin packing with restricted piece sizes". Information Processing Letters. 31 (3): 145–149. doi:10.1016/0020-0190(89)90223-8. ISSN 0020-0190

M-ary tree (2,762 words) [view diff] exact match in snippet view article find links to article

James F (1994). "Loopless generation of k-ary tree sequences". Information Processing Letters. 52 (5). Elsevier: 243–247. doi:10.1016/0020-0190(94)00149-9

Multi-key quicksort (700 words) [view diff] exact match in snippet view article find links to article

multikey Quicksort for sorting strings with many equal elements". Information Processing Letters. 109 (9): 454–459. doi:10.1016/j.ipl.2009.01.007. Bentley, Jon;

Eternity II puzzle (1,746 words) [view diff] exact match in snippet view article find links to article

Walsh, Toby (15 September 2006). "Tetravex is NP-complete". Information Processing Letters. 99 (5): 171–174. doi:10.1016/j.ipl.2006.04.010. ISSN 0020-0190

Ron Shamir (2,040 words) [view diff] exact match in snippet view article find links to article

(2000), "A clustering algorithm based on graph connectivity", Information Processing Letters, 76 (4–6): 175–181, CiteSeerX 10.1.1.17.1450, doi:10

Kinetic hanger (613 words) [view diff] exact match in snippet view article find links to article

Celina M. H. and Carvalho, Paulo C. P. "Kinetic hanger" (PDF). Information Processing Letters. pp. 151–157. Archived from the original (PDF) on May 24, 2015

Freddy II (1,128 words) [view diff] exact match in snippet view article find links to article

isomorphism, matching relational structures and maximal cliques, Information Processing Letters 4(4): pp 83-84, 1976. R. J. Popplestone, A. P. Ambler, I. Bellos

Quasi-bipartite graph (523 words) [view diff] exact match in snippet view article find links to article

Jürgen (2002), "Steiner trees in uniformly quasi-bipartite graphs", Information Processing Letters, 83 (4): 195–200, doi:10.1016/S0020-0190(01)00335-0.

Dutch national flag problem (656 words) [view diff] exact match in snippet view article find links to article

multikey Quicksort for sorting strings with many equal elements". Information Processing Letters. 109 (9): 454–459. doi:10.1016/j.ipl.2009.01.007. This article

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

on the reduction of two-way automata to one-way automata". Information Processing Letters. 30 (5): 261–264. CiteSeerX 10.1.1.60.464. doi:10.1016/0020-0190(89)90205-6

Voronoi diagram (5,504 words) [view diff] exact match in snippet view article find links to article

simple algorithm for computing the smallest enclosing circle". Information Processing Letters. 37 (3): 121–125. doi:10.1016/0020-0190(91)90030-L., contains

Stack (abstract data type) (4,727 words) [view diff] exact match in snippet view article

for Determining the Convex Hull of a Finite Planar Set (PDF). Information Processing Letters 1. Vol. 1. pp. 132–133. Archived (PDF) from the original on

Pareto front (1,553 words) [view diff] exact match in snippet view article find links to article

(1996). "Output-sensitive peeling of convex and maximal layers". Information Processing Letters. 59 (5): 255–9. CiteSeerX 10.1.1.259.1042. doi:10.1016/0020-0190(96)00116-0

Automatic label placement (1,569 words) [view diff] exact match in snippet view article find links to article

"A polynomial time solution for labeling a rectilinear map", Information Processing Letters, 65 (4): 201–207, doi:10.1016/S0020-0190(98)00002-7; Wagner

Program slicing (1,417 words) [view diff] exact match in snippet view article find links to article

Korel, Bogdan; Laski, Janusz (1988). "Dynamic Program Slicing". Information Processing Letters. 29 (3): 155–163. CiteSeerX 10.1.1.158.9078. doi:10.1016/0020-0190(88)90054-3

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

(2021), "Zone theorem for arrangements in dimension three", Information Processing Letters, 172: 106161, arXiv:2006.01428, doi:10.1016/j.ipl.2021.106161

Eulerian path (3,459 words) [view diff] exact match in snippet view article find links to article

Endre (1974), "A note on finding the bridges of a graph", Information Processing Letters, 2 (6): 160–161, doi:10.1016/0020-0190(74)90003-9, MR 0349483

Maximal independent set (5,451 words) [view diff] exact match in snippet view article find links to article

C. H. (1988), "On generating all maximal independent sets", Information Processing Letters, 27 (3): 119–123, doi:10.1016/0020-0190(88)90065-8. Lawler,

PageRank (8,808 words) [view diff] exact match in snippet view article find links to article

Grolmusz (2015). "A Note on the PageRank of Undirected Graphs". Information Processing Letters. 115 (6–8): 633–634. arXiv:1205.1960. doi:10.1016/j.ipl.2015

Complexity function (1,313 words) [view diff] exact match in snippet view article find links to article

Aldo (1995). "A division property of the Fibonacci word". Information Processing Letters. 54 (6): 307–312. doi:10.1016/0020-0190(95)00067-M. Pytheas

Radio coloring (638 words) [view diff] exact match in snippet view article find links to article

complexity of exact algorithm for L(2,1)-labeling of graphs", Information Processing Letters, 111 (14): 697–701, doi:10.1016/j.ipl.2011.04.010, MR 2840535

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

"Stream VByte: Faster Byte-Oriented Integer Compression". Information Processing Letters. 130. First International Symposium on Web Algorithms (published

Sturmian word (1,939 words) [view diff] exact match in snippet view article find links to article

Aldo (1995). "A division property of the Fibonacci word". Information Processing Letters. 54 (6): 307–312. doi:10.1016/0020-0190(95)00067-M. Lothaire

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

n/\log \log n)} upper bound on the price of stability for undirected Shapely network design games. Information Processing Letters 109 (15), 876-878, 2009.

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

Algebra Volume 37 Issue 1 (2009) 193-208 Barrington and Corbett, Information Processing Letters 32 (1989) 251-256 Dyck language at PlanetMath. A proof of the

Summation generator (304 words) [view diff] exact match in snippet view article find links to article

attack on the improved summation generator with 2-bit memory" Information Processing Letters, Volume 93, Issue 1, (January 2005) Pages: 43 - 46 ISSN 0020-0190

Standard RAID levels (4,552 words) [view diff] exact match in snippet view article find links to article

(February 2005). "Reconstruct versus read-modify writes in RAID". Information Processing Letters. 93 (4): 163–168. doi:10.1016/j.ipl.2004.10.009. Park, Chanhyun;

Las Vegas algorithm (2,523 words) [view diff] exact match in snippet view article find links to article

September 1993). "Optimal Speedup of Las Vegas algorithms". Information Processing Letters. 47 (4): 173–180. doi:10.1016/0020-0190(93)90029-9. Goodrich

Smallest grammar problem (464 words) [view diff] exact match in snippet view article find links to article

(2002). "Simulating finite automata with context-free grammars". Information Processing Letters. 84 (6): 339–344. doi:10.1016/S0020-0190(02)00316-2. MR 1937222

Minimum routing cost spanning tree (595 words) [view diff] exact match in snippet view article find links to article

linear-time algorithm to compute a MAD tree of an interval graph". Information Processing Letters. 89 (5): 255–259. doi:10.1016/j.ipl.2003.11.009. MR 2032568

Particle swarm optimization (5,222 words) [view diff] exact match in snippet view article find links to article

Optimization Algorithm: convergence analysis and parameter selection". Information Processing Letters. 85 (6): 317–325. doi:10.1016/S0020-0190(02)00447-7. Bratton

Quantum Byzantine agreement (2,088 words) [view diff] exact match in snippet view article find links to article

I.; Nayak, A. (2004). "Weak coin flipping with small bias". Information Processing Letters. 89 (3): 131–135. arXiv:quant-ph/0206121. doi:10.1016/j.ipl

Bit-reversal permutation (1,557 words) [view diff] exact match in snippet view article find links to article

"In-place permuting and perfect shuffling using involutions", Information Processing Letters, 113 (10–11): 386–391, arXiv:1204.1958, doi:10.1016/j.ipl.2013

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

classes of functions for which No Free Lunch results hold". Information Processing Letters. 86 (6): 317–321. arXiv:cs/0108011. doi:10.1016/S0020-0190(03)00222-9

Sylvester's sequence (2,708 words) [view diff] exact match in snippet view article find links to article

Frank M. (1980). "A lower bound for on-line bin packing". Information Processing Letters. 10 (2): 76–79. doi:10.1016/S0020-0190(80)90077-0. MR 0564503

Decision tree learning (6,542 words) [view diff] exact match in snippet view article find links to article

"Constructing Optimal Binary Decision Trees is NP-complete". Information Processing Letters. 5 (1): 15–17. doi:10.1016/0020-0190(76)90095-8. Murthy S. (1998)

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

Myers, Eugene W. (1983). "An applicative random-access stack". Information Processing Letters. 17 (5): 241–248. doi:10.1016/0020-0190(83)90106-0. MR 0741239

Sieve of Pritchard (2,912 words) [view diff] exact match in snippet view article find links to article

Jonathan (1996). "A Space-Efficient Fast Prime Number Sieve". Information Processing Letters. 59 (2): 79–84. CiteSeerX 10.1.1.31.3936. doi:10.1016/0020-0190(96)00099-3

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

(1982). "Multidimensional tries used for associative searching". Information Processing Letters. 14 (4). Elsevier: 150–157. doi:10.1016/0020-0190(82)90027-8

Bloom filter (10,788 words) [view diff] exact match in snippet view article find links to article

Nuno; Hutchison, David (2007), "Scalable Bloom Filters" (PDF), Information Processing Letters, 101 (6): 255–261, doi:10.1016/j.ipl.2006.10.007, hdl:1822/6627

Hajós construction (1,470 words) [view diff] exact match in snippet view article find links to article

"Exponential lower bounds for the tree-like Hajós calculus", Information Processing Letters, 54 (5): 289–294, doi:10.1016/0020-0190(95)00035-B, MR 1336013

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

propositional formulas represent nondeterministic computations" (PDF). Information Processing Letters. 26 (5): 269–270. doi:10.1016/0020-0190(88)90152-4. Gary L.

Skew-symmetric graph (2,318 words) [view diff] exact match in snippet view article find links to article

testing the truth of certain quantified boolean formulas", Information Processing Letters, 8 (3): 121–123, doi:10.1016/0020-0190(79)90002-4. Babenko,

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

performance of algorithms for the satisfiability problem", Information Processing Letters, 23 (2): 103–106, doi:10.1016/0020-0190(86)90051-7.. Flajolet

Eitan Zemel (1,212 words) [view diff] exact match in snippet view article find links to article

the Multiple Choice Knapsack and Related Problems. Vol. 18. Information Processing Letters. pp. 123–128. Zemel, E. (1981). On Search Over Rationals. Vol

List of knapsack problems (1,082 words) [view diff] exact match in snippet view article find links to article

Liran (2008). "The Generalized Maximum Coverage Problem". Information Processing Letters. 108: 15–22. CiteSeerX 10.1.1.156.2073. doi:10.1016/j.ipl.2008

Minkowski's theorem (2,350 words) [view diff] exact match in snippet view article find links to article

Christos-Alexandros; Rubinstein, Aviad (2019-05-01). "Reductions in PPP". Information Processing Letters. 145: 48–52. doi:10.1016/j.ipl.2018.12.009. ISSN 0020-0190.

Samuelson–Berkowitz algorithm (665 words) [view diff] exact match in snippet view article find links to article

in small parallel time using a small number of processors". Information Processing Letters. 18 (3): 147–150. doi:10.1016/0020-0190(84)90018-8. Soltys,

Richard T. Snodgrass (1,590 words) [view diff] exact match in snippet view article find links to article

Snodgrass, "Optimal Block Size for Set-valued Attributes," Information Processing Letters 45(3), March 1993, pp. 153–158. Michael Böhlen, Christian S

Needham–Schroeder protocol (2,192 words) [view diff] exact match in snippet view article find links to article

the Needham–Schroeder public key authentication protocol". Information Processing Letters. 56 (3): 131–136. CiteSeerX 10.1.1.394.6094. doi:10.1016/0020-0190(95)00144-2

Ear decomposition (1,904 words) [view diff] exact match in snippet view article find links to article

(2013a), "A Simple Test on 2-Vertex- and 2-Edge-Connectivity", Information Processing Letters, 113 (7): 241–244, arXiv:1209.0700, doi:10.1016/j.ipl.2013.01

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

"Reconstructing hv-convex polyominoes from orthogonal projections", Information Processing Letters, 69 (6): 283–289, arXiv:cs/9906021, Bibcode:1999cs........6021D

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

Hennell, M.R.Woodward and D.Hedley, "On program analysis", Information Processing Letters, 5(5), pp. 136 – 140, 1976 John Binder, Testing software: The

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

(2017-10-01). "An FPTAS for the parametric knapsack problem". Information Processing Letters. 126: 43–47. arXiv:1701.07822. doi:10.1016/j.ipl.2017.06.006

Combinatory logic (5,301 words) [view diff] exact match in snippet view article find links to article

construction of one-point bases in extended lambda calculi". Information Processing Letters. 89 (6): 281–286. doi:10.1016/j.ipl.2003.12.005. Hindley, J

Locality-sensitive hashing (4,202 words) [view diff] exact match in snippet view article find links to article

yield approximate min-wise independent permutation families". Information Processing Letters. 73 (1–2): 29–32. CiteSeerX 10.1.1.20.8264. doi:10.1016/S0020-0190(99)00163-5

Adjacent-vertex-distinguishing-total coloring (777 words) [view diff] exact match in snippet view article find links to article

vertex-distinguishing edge and total chromatic numbers of hypercubes". Information Processing Letters. 109 (12): 599–602. doi:10.1016/j.ipl.2009.02.006. Wang, Yiqiao;

Hidden subgroup problem (2,031 words) [view diff] exact match in snippet view article find links to article

query complexity of the hidden subgroup problem is polynomial". Information Processing Letters. 91: 43–48. arXiv:quant-ph/0401083. Bibcode:2004quant.ph..1083E

Matching wildcards (1,534 words) [view diff] exact match in snippet view article find links to article

Raphaël (January 2007). "Simple deterministic wildcard matching". Information Processing Letters. 101 (2): 53–54. doi:10.1016/j.ipl.2006.08.002. Wu, Xindong;

Visibility polygon (1,859 words) [view diff] exact match in snippet view article find links to article

segments in O ( n log ⁡ n ) {\displaystyle O(n\log n)} time". Information Processing Letters. 33 (4): 169–174. doi:10.1016/0020-0190(89)90136-1. http://web

Straight skeleton (2,179 words) [view diff] exact match in snippet view article find links to article

Positively Weighted Straight Skeletons of Monotone Polygons" (PDF). Information Processing Letters. 115 (2): 243–247. doi:10.1016/j.ipl.2014.09.021. PMC 4308025

Cluster analysis (9,513 words) [view diff] exact match in snippet view article find links to article

(2000-12-31). "A clustering algorithm based on graph connectivity". Information Processing Letters. 76 (4): 175–181. doi:10.1016/S0020-0190(00)00142-3. ISSN 0020-0190

Bitmap index (2,612 words) [view diff] exact match in snippet view article find links to article

2010). "Concise: Compressed 'n' Composable Integer Set" (PDF). Information Processing Letters. 110 (16): 644–50. arXiv:1004.0403. doi:10.1016/j.ipl.2010.05

Parity game (1,905 words) [view diff] exact match in snippet view article find links to article

"Deciding the winner in parity games is in UP∩ co-UP" (PDF), Information Processing Letters, 68 (3), Elsevier: 119–124, doi:10.1016/S0020-0190(98)00150-1

Tower of Hanoi (7,075 words) [view diff] exact match in snippet view article find links to article

of Hanoi revisited: moving the rings by counting the moves, Information Processing Letters, 1982, Vol.15, 64-67. Netherlands. Miller, Charles D. (2000)

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

heapsort with almost optimal number of comparisons" (PDF). Information Processing Letters. 24 (4): 247–250. doi:10.1016/0020-0190(87)90142-6. S2CID 28135103

Dual lattice (1,857 words) [view diff] exact match in snippet view article find links to article

approximate lattice problems under general Cook reductions". Information Processing Letters. 76 (1–2): 61–66. doi:10.1016/S0020-0190(00)00123-X. MR 1797563

Smallest-circle problem (2,601 words) [view diff] exact match in snippet view article find links to article

Richard (2008), "On the smallest enclosing information disk", Information Processing Letters, 105 (3): 93–97, doi:10.1016/j.ipl.2007.08.007 Megiddo, Nimrod

Vector clock (1,862 words) [view diff] exact match in snippet view article find links to article

algorithm to prevent mutual drift between n logical clocks". Information Processing Letters. 24 (3): 199–202. doi:10.1016/0020-0190(87)90186-4. Fidge, Colin

Linear code sequence and jump (1,293 words) [view diff] exact match in snippet view article find links to article

Hennell, M.R.Woodward and D.Hedley, "On program analysis", Information Processing Letters, 5(5), pp. 136 – 140, 1976 M. R. Woodward, M. A. Hennell, "On

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

linear-time algorithm for finding a minimum spanning pseudoforest", Information Processing Letters, 27 (5): 259–263, doi:10.1016/0020-0190(88)90089-0. Gabow, H

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

Zizza, R. (2001-09-30). "Separating some splicing models". Information Processing Letters. 79 (6): 255–259. doi:10.1016/S0020-0190(01)00139-9. ISSN 0020-0190

Time hierarchy theorem (2,511 words) [view diff] exact match in snippet view article find links to article

Amir M. (2003). "Tighter constant-factor time hierarchies". Information Processing Letters. 87 (1): 39–44. doi:10.1016/S0020-0190(03)00253-9. Michael Sipser

Nearest-neighbor chain algorithm (3,651 words) [view diff] exact match in snippet view article find links to article

implementations of UPGMA and other common clustering algorithms", Information Processing Letters, 104 (6): 205–210, doi:10.1016/j.ipl.2007.07.002, MR 2353367

Fisher–Yates shuffle (5,224 words) [view diff] exact match in snippet view article find links to article

(1986-05-30). "An algorithm to generate a random cyclic permutation". Information Processing Letters. 22 (6): 315–3017. doi:10.1016/0020-0190(86)90073-6. Wilson

Optimal facility location (3,149 words) [view diff] exact match in snippet view article find links to article

"Optimal packing and covering in the plane are NP-complete", Information Processing Letters, 12 (3): 133–137, doi:10.1016/0020-0190(81)90111-3. Megiddo

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

isomorphism, matching relational structures and maximal cliques", Information Processing Letters, 4 (4): 83–84, doi:10.1016/0020-0190(76)90049-1. McCreesh, Ciaran;

Zvi Lotker (741 words) [view diff] exact match in snippet view article find links to article

number of vertices of polyhedra with -constraint matrices". Information Processing Letters. 100 (2): 69–71. arXiv:cs/0507038. doi:10.1016/j.ipl.2006.05

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

B. (2016). "On the efficiency of localized work stealing". Information Processing Letters. 116 (2): 100–106. arXiv:1804.04773. doi:10.1016/j.ipl.2015

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

(1978). "A probabilistic remark on algebraic program testing". Information Processing Letters. 7 (4): 193–195. doi:10.1016/0020-0190(78)90067-4. Rudich, Steven

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

Rubinstein, S. (2000), "Better approximations for max TSP", Information Processing Letters, 75 (4): 181–186, CiteSeerX 10.1.1.35.7209, doi:10.1016/S0020-0190(00)00097-1

Count-distinct problem (2,130 words) [view diff] exact match in snippet view article find links to article

Unified Scheme for Generalizing Cardinality Estimators to Sum Aggregation". Information Processing Letters. 115 (2): 336–342. doi:10.1016/j.ipl.2014.10.009.

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

Clemens (1983-11-08). "BPP and the polynomial hierarchy". Information Processing Letters. 17 (4): 215–217. doi:10.1016/0020-0190(83)90044-3. ISSN 0020-0190

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

for describing polynomial-time subclasses of hard problems". Information Processing Letters. 14 (2): 52–56. doi:10.1016/0020-0190(82)90086-2. A. Habel,

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

{\displaystyle n\times n} approximate matrix multiplication". Information Processing Letters. 8 (5): 234–235. doi:10.1016/0020-0190(79)90113-3. A. Schönhage

Slope One (1,456 words) [view diff] exact match in snippet view article find links to article

Userrank for item-based collaborative filtering recommendation, Information Processing Letters Volume 111, Issue 9, 1 April 2011, pp. 440-446. Mi, Zhenzhen

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

"Optimal packing and covering in the plane are NP-complete". Information Processing Letters. 12 (3): 133–137. doi:10.1016/0020-0190(81)90111-3. ISSN 0020-0190

Separating words problem (946 words) [view diff] exact match in snippet view article find links to article

Robson, J. M. (1989), "Separating strings with small automata", Information Processing Letters, 30 (4): 209–214, doi:10.1016/0020-0190(89)90215-9, MR 0986823

Information security (18,145 words) [view diff] exact match in snippet view article find links to article

tractable under every polynomial-time computable distribution". Information Processing Letters. 55 (4): 179–184. doi:10.1016/0020-0190(95)00108-o. ISSN 0020-0190

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

\scriptstyle O\left(n^{1.5}{\sqrt {\frac {m}{\log n}}}\right)} ", Information Processing Letters, 37 (4): 237–240, doi:10.1016/0020-0190(91)90195-N. Annamalai

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

complexity of model checking for circumscriptive formulae". Information Processing Letters. 44 (3): 113–8. doi:10.1016/0020-0190(92)90049-2. Lifschitz

Multiple subset sum (1,613 words) [view diff] exact match in snippet view article find links to article

Multiple Subset Sum Problem with different knapsack capacities". Information Processing Letters. 73 (3–4): 111–118. doi:10.1016/S0020-0190(00)00010-7. ISSN 0020-0190

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

optimal algorithm for computing the repetitions in a word". Information Processing Letters. 12 (5): 244–250. doi:10.1016/0020-0190(81)90024-7. ISSN 0020-0190

Claw-free graph (3,914 words) [view diff] exact match in snippet view article find links to article

"Finding and counting small induced subgraphs efficiently", Information Processing Letters, 74 (3–4): 115–121, doi:10.1016/S0020-0190(00)00047-8, MR 1761552

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

ordering abstraction and a simple way to implement it" (PDF). Information Processing Letters. 39 (6): 343–350. doi:10.1016/0020-0190(91)90008-6. Baldoni

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

eternal dominating set problem for proper interval graphs", Information Processing Letters, 115 (6–8): 582–587, doi:10.1016/j.ipl.2015.02.004. Braga, A

Tracing garbage collection (5,282 words) [view diff] exact match in snippet view article find links to article

"Garbage collection can be faster than stack allocation" (PDF). Information Processing Letters. 25 (4): 275–279. CiteSeerX 10.1.1.49.2537. doi:10.1016/0020-0190(87)90175-X

Lonely runner conjecture (3,289 words) [view diff] exact match in snippet view article find links to article

Jarosław (September 2008). "Invisible runners in finite fields". Information Processing Letters. 108 (2): 64–67. doi:10.1016/j.ipl.2008.03.019. Dubickas, A

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

Threlfall RA (2004). "A note on quadratic residuosity and UP". Information Processing Letters. 92 (3): 127–131. CiteSeerX 10.1.1.409.1830. doi:10.1016/j.ipl

Cycle basis (3,322 words) [view diff] exact match in snippet view article find links to article

"On finding a cycle basis with a shortest maximal cycle", Information Processing Letters, 54 (1): 55–58, CiteSeerX 10.1.1.650.8218, doi:10.1016/0020-0190(94)00231-M

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

Norbert (1983). "A note on the 'parallel computation thesis'". Information Processing Letters. 17 (4): 203–205. doi:10.1016/0020-0190(83)90041-8. Parberry

Kinetic convex hull (1,934 words) [view diff] exact match in snippet view article find links to article

the upper envelope of n line segments in O(n log n) time". Information Processing Letters. 33 (4): 169–174. doi:10.1016/0020-0190(89)90136-1. Agarwal

Mechthild Stoer (423 words) [view diff] exact match in snippet view article find links to article

correctness certificate for the Stoer–Wagner min-cut algorithm", Information Processing Letters, 70 (5): 251–254, doi:10.1016/S0020-0190(99)00071-X, MR 1707963

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

Kjartan (2006). "Pathwidth of cubic graphs and exact algorithms". Information Processing Letters. 97 (5): 191–196. doi:10.1016/j.ipl.2005.10.012. MR 2195217

Reservoir sampling (3,843 words) [view diff] exact match in snippet view article find links to article

(2006-03-16). "Weighted random sampling with a reservoir". Information Processing Letters. 97 (5): 181–185. doi:10.1016/j.ipl.2005.11.003. Arratia, Richard

Addition-subtraction chain (663 words) [view diff] exact match in snippet view article find links to article

April 1985). "Some results on addition/subtraction chains". Information Processing Letters. 20 (3): 155–160. doi:10.1016/0020-0190(85)90085-7. Morain,

Neil J. Gunther (2,003 words) [view diff] exact match in snippet view article find links to article

"Path Integral Methods for Computer Performance Analysis". Information Processing Letters. 32: 7–13. doi:10.1016/0020-0190(89)90061-6. Gunther, Neil J

Causal consistency (1,695 words) [view diff] exact match in snippet view article find links to article

"Concerning the size of logical clocks in distributed systems", Information Processing Letters, 39 (1): 11–16, doi:10.1016/0020-0190(91)90055-m Torres-Rojas

Michael D. Atkinson (772 words) [view diff] exact match in snippet view article find links to article

Atkinson, M. D. (1981). "The cyclic towers of Hanoi". Information Processing Letters. 13 (3): 118–119. doi:10.1016/0020-0190(81)90123-X. Atkinson

Time-utility function (2,586 words) [view diff] exact match in snippet view article find links to article

Complexity of scheduling tasks with time-dependent execution times, Information Processing Letters 48 (1993), no. 6, Elsevier, 20 December 1993. Real-Time for

Melanie Schmidt (493 words) [view diff] exact match in snippet view article find links to article

simplified inapproximability for k {\displaystyle k} -means", Information Processing Letters, 120: 40–43, arXiv:1509.00916, doi:10.1016/J.IPL.2016.11.009

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

(March 31, 2012). "Automorphism Groups of the Pancake Graphs". Information Processing Letters. 112 (7): 264–266. arXiv:1201.0452. doi:10.1016/j.ipl.2011.12

Factorization of polynomials over finite fields (4,620 words) [view diff] exact match in snippet view article find links to article

deterministic complexity of factoring polynomials over finite fields, Information Processing Letters 33:261-267, 1990 Rabin, Michael (1980). "Probabilistic algorithms

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

2012). "A note on the Kenyon–Remila strip-packing algorithm". Information Processing Letters. 112 (1–2): 10–12. doi:10.1016/j.ipl.2011.10.003. Hougardy,

Envy-free cake-cutting (5,573 words) [view diff] exact match in snippet view article find links to article

note on envy-free cake cutting with polynomial valuations". Information Processing Letters. 115 (2): 93–95. doi:10.1016/j.ipl.2014.07.005. Alijani, Reza;

Hyperproperty (958 words) [view diff] exact match in snippet view article find links to article

Bowen; Schneider, Fred B. (1985-10-07). "Defining liveness". Information Processing Letters. 21 (4): 181–185. doi:10.1016/0020-0190(85)90056-0. ISSN 0020-0190

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

of block accesses in performing relational join is NP-hard". Information Processing Letters. 38 (5): 271–275. doi:10.1016/0020-0190(91)90070-X. MR 1114421

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

STOC, pp. 209–213, 1979. 14 I. Newman, Private vs. Common Random Bits in Communication Complexity, Information Processing Letters 39, 1991, pp. 67–71.

Minimum mean weight cycle (1,081 words) [view diff] exact match in snippet view article find links to article

Ross M. (2017-11-01). "A note on finding minimum mean cycle". Information Processing Letters. 127: 21–22. doi:10.1016/j.ipl.2017.06.007. ISSN 0020-0190.

Square-root sum problem (1,436 words) [view diff] exact match in snippet view article find links to article

is needed to compare two sums of square roots of integers?". Information Processing Letters. 100 (5): 194–198. doi:10.1016/j.ipl.2006.05.002. ISSN 0020-0190

Danny Raz (1,029 words) [view diff] exact match in snippet view article find links to article

efficient approximation for the Generalized Assignment Problem". Information Processing Letters. 100 (4): 162–166. doi:10.1016/j.ipl.2006.06.003. ISSN 0020-0190

Channel system (computer science) (2,797 words) [view diff] exact match in snippet view article

Lossy Channel Systems has Nonprimitive Recursive Complexity". Information Processing Letters. 83 (5): 251–261. doi:10.1016/S0020-0190(01)00337-4. Cécé, Gérard;

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

intersection types to support both dynamic and static typing". Information Processing Letters. 111 (6): 278–286. doi:10.1016/j.ipl.2010.12.006. hdl:10651/8732

Knuth–Plass line-breaking algorithm (681 words) [view diff] exact match in snippet view article find links to article

algorithm for concave one-dimensional dynamic programming", Information Processing Letters, 33 (6): 309–311, doi:10.1016/0020-0190(90)90215-J, MR 1045521

Bogusław Jackowski (1,126 words) [view diff] exact match in snippet view article find links to article

1979). "Complexity of sorting by distributive partitioning". Information Processing Letters. 9 (2): 100–. doi:10.1016/0020-0190(79)90139-X. ISSN 0020-0190

Fractional job scheduling (1,605 words) [view diff] exact match in snippet view article find links to article

job release dates, delivery times and preemption penalties". Information Processing Letters. 82 (2): 107–111. doi:10.1016/S0020-0190(01)00251-4. hdl:10397/32337

Fat object (geometry) (4,907 words) [view diff] exact match in snippet view article

Overmars, M. H. (1992). "Point location in fat subdivisions". Information Processing Letters (Submitted manuscript). 44 (5): 261–265. doi:10.1016/0020-0190(92)90211-d

List of Dutch inventions and innovations (19,000 words) [view diff] exact match in snippet view article find links to article

"Termination detection for diffusing computations" (PDF), Information Processing Letters, 11 (1): 1–4, doi:10.1016/0020-0190(80)90021-6, MR 0585394 Dijkstra

Bailey's FFT algorithm (633 words) [view diff] exact match in snippet view article find links to article

"Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190

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

application of the planar separator theorem to counting problems". Information Processing Letters. 25 (5): 317. doi:10.1016/0020-0190(87)90206-7., Smith, W. D

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

"Computing Longest Previous Factor in linear time and applications". Information Processing Letters. 106 (2): 75. CiteSeerX 10.1.1.70.5720. doi:10.1016/j.ipl.2007

Commitment ordering (12,831 words) [view diff] exact match in snippet view article find links to article

(September 1994), "Serializability by Commitment Ordering", Information Processing Letters, 51 (5): 257–264, doi:10.1016/0020-0190(94)90005-1 Raz, Yoav

Efficient approximately fair item allocation (5,471 words) [view diff] exact match in snippet view article find links to article

of maximizing Nash social welfare with indivisible items". Information Processing Letters. 122: 17–20. arXiv:1507.01159. doi:10.1016/j.ipl.2017.01.012

Lexicographic max-min optimization (4,059 words) [view diff] exact match in snippet view article find links to article

"Minimizing the sum of the k largest functions in linear time". Information Processing Letters. 85 (3): 117–122. doi:10.1016/S0020-0190(02)00370-8. ISSN 0020-0190