Facet browsing currently unavailable
Page 6 of 8570 results
Sort by: relevance publication year
Optimal coteries and voting schemes JOURNAL ARTICLE published July 1994 in Information Processing Letters |
A space-saving technique for assigning algol 68 multiple values JOURNAL ARTICLE published October 1976 in Information Processing Letters |
On the computational complexity of cardinality constraints in relational databases JOURNAL ARTICLE published October 1980 in Information Processing Letters |
On the time-space complexity of reachability queries for preprocessed graphs JOURNAL ARTICLE published August 1990 in Information Processing Letters |
Estimating block transfers when record access probabilities are non-uniform JOURNAL ARTICLE published June 1983 in Information Processing Letters |
Worst-case data structures for the priority queue with attrition JOURNAL ARTICLE published April 1989 in Information Processing Letters |
On two-way tree automata JOURNAL ARTICLE published May 1994 in Information Processing Letters |
An algorithm for string matching with a sequence of don't cares JOURNAL ARTICLE published February 1991 in Information Processing Letters |
Performance analysis of file organizations that use multi-bucket data leaves JOURNAL ARTICLE published December 1990 in Information Processing Letters |
The complexity of recognizing 3NF relation schemes JOURNAL ARTICLE published June 1982 in Information Processing Letters |
NP-hardness and inapproximability of sparse PCA JOURNAL ARTICLE published October 2017 in Information Processing Letters Research funded by Army Research Laboratory (W911NF-09-2-0053) |
On fully orientability of 2-degenerate graphs JOURNAL ARTICLE published February 2008 in Information Processing Letters |
A note on the hardness of sparse approximation JOURNAL ARTICLE published July 2013 in Information Processing Letters |
Testing unboundedness of database schemes and functional dependencies JOURNAL ARTICLE published August 1988 in Information Processing Letters |
A note on shortest superstrings with flipping JOURNAL ARTICLE published December 1992 in Information Processing Letters |
The greedy algorithm for edit distance with moves JOURNAL ARTICLE published January 2006 in Information Processing Letters |
Attacks on Okamoto and Tanaka's one-way ID-based key distribution system JOURNAL ARTICLE published August 1992 in Information Processing Letters |
A cryptosystem for multiple communication JOURNAL ARTICLE published July 1980 in Information Processing Letters |
Maximizing the number of unused colors in the vertex coloring problem JOURNAL ARTICLE published October 1994 in Information Processing Letters |
Fast correlation attacks on nonlinear filter generators JOURNAL ARTICLE published October 1997 in Information Processing Letters |