Facet browsing currently unavailable
Page 8 of 8570 results
Sort by: relevance publication year
Strategical languages of infinite words JOURNAL ARTICLE published June 2009 in Information Processing Letters |
Editorial Board JOURNAL ARTICLE published April 1989 in Information Processing Letters |
The difference between game chromatic number and chromatic number of graphs JOURNAL ARTICLE published November 2019 in Information Processing Letters |
On multiset orderings JOURNAL ARTICLE published September 1982 in Information Processing Letters |
On the size of (generalized) OBDDs for threshold functions JOURNAL ARTICLE published April 2009 in Information Processing Letters |
On-line two-machine job shop scheduling with time lags JOURNAL ARTICLE published June 2010 in Information Processing Letters |
The homogeneous set sandwich problem JOURNAL ARTICLE published July 1998 in Information Processing Letters |
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock JOURNAL ARTICLE published August 2012 in Information Processing Letters |
Searching with a forbidden lie pattern in responses JOURNAL ARTICLE published February 1991 in Information Processing Letters |
Three-coloring planar graphs without short cycles JOURNAL ARTICLE published February 2007 in Information Processing Letters |
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem JOURNAL ARTICLE published May 1992 in Information Processing Letters |
Δ-List vertex coloring in linear time JOURNAL ARTICLE published May 2006 in Information Processing Letters |
A non-hamiltonian, nondegenerate delaunay triangulation JOURNAL ARTICLE published May 1987 in Information Processing Letters |
Single-machine scheduling with past-sequence-dependent delivery times and release times JOURNAL ARTICLE published November 2012 in Information Processing Letters |
An upper bound for the equational specification of finite state services JOURNAL ARTICLE published June 2005 in Information Processing Letters |
Comments on “a distributed algorithm for distributed termination” JOURNAL ARTICLE published July 1987 in Information Processing Letters |
Time-bounded incompressibility of compressible strings and sequences JOURNAL ARTICLE published August 2009 in Information Processing Letters |
Verifying programs by induction on their data structure: General format and applications JOURNAL ARTICLE published October 1983 in Information Processing Letters |
Shortest enclosing walks and cycles in embedded graphs JOURNAL ARTICLE published February 1989 in Information Processing Letters |
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems JOURNAL ARTICLE published December 1999 in Information Processing Letters |