Facet browsing currently unavailable
Page 1 of 8569 results
Sort by: relevance publication year
Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence? JOURNAL ARTICLE published April 2018 in Information Processing Letters |
Notes on avoiding “go to” statements JOURNAL ARTICLE published June 1972 in Information Processing Letters |
Subject index volume 56 (1995) JOURNAL ARTICLE published December 1995 in Information Processing Letters |
On the average depth of asymmetric LC-tries JOURNAL ARTICLE published November 2005 in Information Processing Letters |
A new approximation algorithm for labeling points with circle pairs JOURNAL ARTICLE published August 2006 in Information Processing Letters |
Subtraction-free Almost Montgomery Inverse algorithm JOURNAL ARTICLE published April 2005 in Information Processing Letters |
Test sets for languages of infinite words JOURNAL ARTICLE published September 1988 in Information Processing Letters |
A fast parallel algorithm to recognize partitionable graphs JOURNAL ARTICLE published November 1990 in Information Processing Letters |
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs JOURNAL ARTICLE published June 1994 in Information Processing Letters |
On a characterization of the standard Gray code by using its edge type on a hypercube JOURNAL ARTICLE published March 2002 in Information Processing Letters |
Obituary Victor Mikhaylovich Glushkov (1923–1982) JOURNAL ARTICLE published July 1982 in Information Processing Letters |
Improved lower bounds for some matrix multiplication problems JOURNAL ARTICLE published September 1985 in Information Processing Letters |
Editorial Board JOURNAL ARTICLE published August 2010 in Information Processing Letters |
A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems JOURNAL ARTICLE published May 2019 in Information Processing Letters Research funded by NSF (CCF 1655215,CCF 1815434) |
The indexing for one-dimensional proportionally-scaled strings JOURNAL ARTICLE published March 2011 in Information Processing Letters |
A simple proof of a completeness result for leads-to in the UNITY logic JOURNAL ARTICLE published January 1992 in Information Processing Letters |
The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems JOURNAL ARTICLE published November 1993 in Information Processing Letters |
Editorial Board JOURNAL ARTICLE published November 2007 in Information Processing Letters |
Worst-case analysis of a generalized heapsort algorithm JOURNAL ARTICLE published November 1990 in Information Processing Letters |
A note on the decoding complexity of error-correcting codes JOURNAL ARTICLE published November 2006 in Information Processing Letters |