Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 8 of 8570 results
Sort by: relevance publication year

A fast parallel algorithm to recognize partitionable graphs

JOURNAL ARTICLE published November 1990 in Information Processing Letters

Authors: R. Lin | S. Olariu

On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs

JOURNAL ARTICLE published June 1994 in Information Processing Letters

Authors: Jordan Gergov | Christoph Meinel

On a characterization of the standard Gray code by using its edge type on a hypercube

JOURNAL ARTICLE published March 2002 in Information Processing Letters

Authors: Zenji Kobayashi | Takeshi Sekiguchi

Obituary Victor Mikhaylovich Glushkov (1923–1982)

JOURNAL ARTICLE published July 1982 in Information Processing Letters

Authors: Heinz Zemanek

Improved lower bounds for some matrix multiplication problems

JOURNAL ARTICLE published September 1985 in Information Processing Letters

Authors: Joseph Ja'ja' | Jean Takche

Editorial Board

JOURNAL ARTICLE published August 2010 in Information Processing Letters

A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems

JOURNAL ARTICLE published May 2019 in Information Processing Letters

Research funded by NSF (CCF 1655215,CCF 1815434)

Authors: Pasin Manurangsi

The indexing for one-dimensional proportionally-scaled strings

JOURNAL ARTICLE published March 2011 in Information Processing Letters

Authors: Yung-Hsing Peng | Chang-Biau Yang | Chiou-Ting Tseng | Chiou-Yi Hor

A simple proof of a completeness result for leads-to in the UNITY logic

JOURNAL ARTICLE published January 1992 in Information Processing Letters

Authors: Jan Pachl

The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems

JOURNAL ARTICLE published November 1993 in Information Processing Letters

Authors: Ying Teh Tsai | Chuan Yi Tang

Editorial Board

JOURNAL ARTICLE published November 2007 in Information Processing Letters

Worst-case analysis of a generalized heapsort algorithm

JOURNAL ARTICLE published November 1990 in Information Processing Letters

Authors: A. Paulik

A note on the decoding complexity of error-correcting codes

JOURNAL ARTICLE published November 2006 in Information Processing Letters

Authors: André Gronemeier

A note on lower bounds for rectilinear Steiner trees

JOURNAL ARTICLE published May 1992 in Information Processing Letters

Authors: J.S. Salowe

Attack on a concast signature scheme

JOURNAL ARTICLE published July 2004 in Information Processing Letters

Authors: D.R. Stinson

A predicate transformer for progress

JOURNAL ARTICLE published February 1990 in Information Processing Letters

Authors: Edgar Knapp

An efficient minimum and maximum global snapshot algorithm

JOURNAL ARTICLE published May 2003 in Information Processing Letters

Authors: L.-B. Chen

A note on minimizing the sum of quadratic completion times on two identical parallel machines

JOURNAL ARTICLE published October 2012 in Information Processing Letters

Authors: F. Della Croce | C. Koulamas

A circuit for exact summation of floating-point numbers

JOURNAL ARTICLE published February 1996 in Information Processing Letters

Authors: Michael Müller | Christine Rüb | Wolfgang Rülling

An O(log n) algorithm for computing the nth element of the solution of a difference equation

JOURNAL ARTICLE published October 1980 in Information Processing Letters

Authors: Friedrich J. Urbanek