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

On the connectivity threshold for general uniform metric spaces

JOURNAL ARTICLE published April 2010 in Information Processing Letters

Authors: Gady Kozma | Zvi Lotker | Gideon Stupp

A note on optical routing on trees

JOURNAL ARTICLE published June 1997 in Information Processing Letters

Authors: S.Ravi Kumar | Rina Panigrahy | Alexander Russell | Ravi Sundaram

Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees

JOURNAL ARTICLE published September 1998 in Information Processing Letters

Authors: Timothy M. Chan

An efficient finite-state machine implementation of Huffman decoders

JOURNAL ARTICLE published December 1997 in Information Processing Letters

Authors: Vikram Iyengar | Krishnendu Chakrabarty

A generalization of orthogonal factorizations in digraphs

JOURNAL ARTICLE published April 2018 in Information Processing Letters

Authors: Zhiren Sun | Sizhong Zhou

Exponential lower bound for bounded depth circuits with few threshold gates

JOURNAL ARTICLE published March 2012 in Information Processing Letters

Authors: Vladimir V. Podolskii

Tight bounds for reachability problems on one-counter and pushdown systems

JOURNAL ARTICLE published October 2021 in Information Processing Letters

Authors: Jakob Cetti Hansen | Adam Husted Kjelstrøm | Andreas Pavlogiannis

A linear-time algorithm for concave one-dimensional dynamic programming

JOURNAL ARTICLE published February 1990 in Information Processing Letters

Authors: Zvi Galil | Kunsoo Park

Space-efficient Huffman codes revisited

JOURNAL ARTICLE published January 2023 in Information Processing Letters

Research funded by Japan Society for the Promotion of Science (JP21H05847,JP21K17701)

Authors: Szymon Grabowski | Dominik Köppl

A linear-time algorithm for testing the truth of certain quantified Boolean formulas

JOURNAL ARTICLE published June 1982 in Information Processing Letters

Authors: Bengt Aspvall | Michael F. Plass | Robert Endre Tarjan

A note on searching line arrangements and applications

JOURNAL ARTICLE published July 2013 in Information Processing Letters

Authors: Danny Z. Chen | Haitao Wang

Algorithms for multicast connection under multi-path routing model

JOURNAL ARTICLE published October 2002 in Information Processing Letters

Authors: Jun Gu | Xiao-Dong Hu | Mu-Hong Zhang

Finding the detour-critical edge of a shortest path between two nodes

JOURNAL ARTICLE published July 1998 in Information Processing Letters

Authors: Enrico Nardelli | Guido Proietti | Peter Widmayer

Prefix grammars: an alternative characterization of the regular languages

JOURNAL ARTICLE published July 1994 in Information Processing Letters

Authors: Michael Frazier | C. David Page

The finite power problem revisited

JOURNAL ARTICLE published December 2002 in Information Processing Letters

Authors: Daniel Kirsten

Fault-tolerant routings in a K-connected network

JOURNAL ARTICLE published July 1988 in Information Processing Letters

Authors: Makoto Imase | Yoshifumi Manabe

Author index of Volume 1

JOURNAL ARTICLE published December 1972 in Information Processing Letters

The two-thirds rule for dynamic storage allocation under equilibrium

JOURNAL ARTICLE published 1971 in Information Processing Letters

Authors: Erol Gelenbe

On proving that a graph has no large clique: A connection with Ramsey theory

JOURNAL ARTICLE published April 1996 in Information Processing Letters

Authors: Richard J. Lipton

Real estate of names

JOURNAL ARTICLE published February 2001 in Information Processing Letters

Authors: K.Rustan M. Leino