Facet browsing currently unavailable
Page 7 of 8570 results
Sort by: relevance publication year
The complexity of preemptive scheduling given interprocessor communication delays JOURNAL ARTICLE published May 1987 in Information Processing Letters |
Constructor equivalent term rewriting systems JOURNAL ARTICLE published September 1993 in Information Processing Letters |
A direct construction of polynomial-size OBDD proof of pigeon hole problem JOURNAL ARTICLE published April 2009 in Information Processing Letters |
On semantic cutting planes with very small coefficients JOURNAL ARTICLE published August 2018 in Information Processing Letters Research funded by Horizon 2020 (ERC-2014-CoG 648276 AUTAR) | GAČR (P202/12/G061) | RVO (67985840) |
On the correspondence between two classes of reduction systems JOURNAL ARTICLE published February 1985 in Information Processing Letters |
An error-correcting coding scheme for alphanumeric data JOURNAL ARTICLE published February 1978 in Information Processing Letters |
Relaxed barrier synchronization for the BSP model of computation on message-passing architectures JOURNAL ARTICLE published June 1998 in Information Processing Letters |
Self-stabilizing algorithms for efficient sets of graphs and trees JOURNAL ARTICLE published September 2013 in Information Processing Letters |
Revisiting global constraint satisfaction JOURNAL ARTICLE published April 1998 in Information Processing Letters |
Routing on trees JOURNAL ARTICLE published February 1996 in Information Processing Letters |
Editorial Board JOURNAL ARTICLE published February 2023 in Information Processing Letters |
On the point-to-point connection problem JOURNAL ARTICLE published March 1995 in Information Processing Letters |
A faster algorithm for computing the strength of a network JOURNAL ARTICLE published February 1994 in Information Processing Letters |
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 |