Metadata Search Funding Data Link References Status API Help
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

Authors: V.J. Rayward-Smith

Constructor equivalent term rewriting systems

JOURNAL ARTICLE published September 1993 in Information Processing Letters

Authors: Iréne Durand | Bruno Salinier

A direct construction of polynomial-size OBDD proof of pigeon hole problem

JOURNAL ARTICLE published April 2009 in Information Processing Letters

Authors: Wěi Chén | Wenhui Zhang

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)

Authors: Massimo Lauria | Neil Thapen

On the correspondence between two classes of reduction systems

JOURNAL ARTICLE published February 1985 in Information Processing Letters

Authors: Satish R. Thatte

An error-correcting coding scheme for alphanumeric data

JOURNAL ARTICLE published February 1978 in Information Processing Letters

Authors: A.S. Sethi | V. Rajaraman | P.S. Kenjale

Relaxed barrier synchronization for the BSP model of computation on message-passing architectures

JOURNAL ARTICLE published June 1998 in Information Processing Letters

Authors: Jin-Soo Kim | Soonhoi Ha | Chu Shik Jhon

Self-stabilizing algorithms for efficient sets of graphs and trees

JOURNAL ARTICLE published September 2013 in Information Processing Letters

Authors: Volker Turau

Revisiting global constraint satisfaction

JOURNAL ARTICLE published April 1998 in Information Processing Letters

Authors: Walter Hower

Routing on trees

JOURNAL ARTICLE published February 1996 in Information Processing Letters

Authors: Antonios Symvonis

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

Authors: Madan Natu | Shu-Cherng Fang

A faster algorithm for computing the strength of a network

JOURNAL ARTICLE published February 1994 in Information Processing Letters

Authors: Eddie Cheng | William H. Cunningham

Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence?

JOURNAL ARTICLE published April 2018 in Information Processing Letters

Authors: Adam Polak

Notes on avoiding “go to” statements

JOURNAL ARTICLE published June 1972 in Information Processing Letters

Authors: D.E. Knuth | R.W. Floyd

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

Authors: Yuriy A. Reznik

A new approximation algorithm for labeling points with circle pairs

JOURNAL ARTICLE published August 2006 in Information Processing Letters

Authors: Minghui Jiang

Subtraction-free Almost Montgomery Inverse algorithm

JOURNAL ARTICLE published April 2005 in Information Processing Letters

Authors: Róbert Lórencz | Josef Hlaváč

Test sets for languages of infinite words

JOURNAL ARTICLE published September 1988 in Information Processing Letters

Authors: Aldo De Luca | Mariacristina Pelagalli | Stefano Varricchio