Sign in
Facet browsing currently unavailable
Page 4 of 8570 results
Sort by: relevance publication year
|
Loop unravelling: a practical tool in proving program correctness JOURNAL ARTICLE published December 1975 in Information Processing Letters |
|
Game chromatic number of graphs with locally bounded number of cycles JOURNAL ARTICLE published August 2010 in Information Processing Letters |
|
The complexity of symmetric functions in bounded-depth circuits JOURNAL ARTICLE published June 1987 in Information Processing Letters |
|
The termination of the higher-dimensional tarai functions JOURNAL ARTICLE published February 2015 in Information Processing Letters |
|
Static filtering on stratified programs JOURNAL ARTICLE published October 1993 in Information Processing Letters |
|
Editorial Board JOURNAL ARTICLE published July 2013 in Information Processing Letters |
|
On the period of the Naor–Reingold sequence JOURNAL ARTICLE published November 2008 in Information Processing Letters |
|
Improvement on Meshram et al.ʼs ID-based cryptographic mechanism JOURNAL ARTICLE published September 2013 in Information Processing Letters |
|
A tool for the analysis of manipulation JOURNAL ARTICLE published March 1993 in Information Processing Letters |
|
I-serializability: Generalized correctness for transaction-based environments JOURNAL ARTICLE published August 1997 in Information Processing Letters |
|
Author index volume 15 (1982) JOURNAL ARTICLE published December 1982 in Information Processing Letters |
|
A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs JOURNAL ARTICLE published May 1983 in Information Processing Letters |
|
On constructing multiple spanning trees in a hypercube JOURNAL ARTICLE published March 1993 in Information Processing Letters |
|
Editorial Board JOURNAL ARTICLE published September 2006 in Information Processing Letters |
|
A compact encoding of plane triangulations with efficient query supports JOURNAL ARTICLE published September 2010 in Information Processing Letters |
|
Some remarks on the Kronecker product of graphs JOURNAL ARTICLE published October 1998 in Information Processing Letters |
|
Equivalency reasoning to solve a class of hard SAT problems JOURNAL ARTICLE published November 2000 in Information Processing Letters |
|
Relating bends and size in orthogonal graph drawings JOURNAL ARTICLE published January 1998 in Information Processing Letters |
|
Multi-machine scheduling with general position-based deterioration to minimize total load revisited JOURNAL ARTICLE published August 2014 in Information Processing Letters |
|
An efficient probabilistic encryption scheme JOURNAL ARTICLE published April 1990 in Information Processing Letters |