Search results
The page ""Information Processing Letters" magazine" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
Bronislava (15 September 2001). "Analyzing variants of Shellsort". Information Processing Letters. 79 (5): 223–227. doi:10.1016/S0020-0190(00)00223-4. Dobosiewicz...7 KB (832 words) - 05:45, 22 June 2024- "Enumerating Longest Increasing Subsequences and Patience Sorting". Information Processing Letters. 76 (1–2): 7–11. CiteSeerX 10.1.1.40.5912. doi:10.1016/s0020-0190(00)00124-1...8 KB (1,127 words) - 09:59, 3 January 2024
- Review Indagationes Mathematicae Information and Computation Information Processing Letters Infrared Physics and Technology Inorganica Chimica Acta Integrative...16 KB (1,224 words) - 11:19, 23 October 2024
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...21 KB (2,201 words) - 21:46, 2 October 2024
(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,...18 KB (2,030 words) - 19:28, 20 September 2024
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...27 KB (3,383 words) - 19:17, 2 November 2024
and the asynchronicity of linear and bilinear algorithms". Information Processing Letters. 22 (1): 11–14. doi:10.1016/0020-0190(86)90035-9. Retrieved...64 KB (7,525 words) - 15:16, 11 November 2024
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...42 KB (5,227 words) - 18:08, 27 October 2024
Complexity Journal of Complexity ACM Transactions on Algorithms Information Processing Letters Open Computer Science (open access journal) Annual ACM Symposium...42 KB (4,794 words) - 04:27, 14 October 2024- Hardcopy Scan Line Graphics System for Document Generation". Information Processing Letters. 1 (6): 246–251. doi:10.1016/0020-0190(72)90021-X. Jonathan...29 KB (3,260 words) - 23:58, 6 September 2024
Trees on a Checkerboard" with Chung and Martin Gardner in Mathematics Magazine (1989),[A89b] and the Lester R. Ford Award for his paper "A whirlwind tour...52 KB (4,470 words) - 16:45, 20 October 2024
"Reconstructing hv-convex polyominoes from orthogonal projections", Information Processing Letters, 69 (6): 283–289, arXiv:cs/9906021, Bibcode:1999cs........6021D...34 KB (4,490 words) - 18:47, 12 November 2024
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...71 KB (8,783 words) - 09:57, 8 November 2024- 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...11 KB (1,082 words) - 17:51, 9 February 2024
Hennell, M.R.Woodward and D.Hedley, "On program analysis", Information Processing Letters, 5(5), pp. 136 – 140, 1976 John Binder, Testing software: The...13 KB (1,214 words) - 05:42, 28 July 2024
Farhad (1989). "On renaming a set of clauses as a Horn set". Information Processing Letters. 30 (6): 289–293. doi:10.1016/0020-0190(89)90229-9. MR 0994523...55 KB (4,524 words) - 00:43, 5 November 2024- (1979), "A note on the graph isomorphism counting problem", Information Processing Letters, 8 (3): 131–132, doi:10.1016/0020-0190(79)90004-8, MR 0526453...40 KB (4,127 words) - 14:57, 25 October 2024
- 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...14 KB (1,786 words) - 04:46, 15 July 2024
- {\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...34 KB (4,211 words) - 06:37, 12 November 2024
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 Rappaport...26 KB (2,753 words) - 13:46, 29 July 2024
