Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 8561 results
Sort by: relevance publication year
Showing results for ISSN matching 0020-0190

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

https://doi.org/10.1016/j.ipl.2017.11.007 Actions

Notes on avoiding “go to” statements

JOURNAL ARTICLE published June 1972 in Information Processing Letters

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

https://doi.org/10.1016/0020-0190(72)90054-3 Actions

Subject index volume 56 (1995)

JOURNAL ARTICLE published December 1995 in Information Processing Letters

https://doi.org/10.1016/0020-0190(95)90843-9 Actions

On the average depth of asymmetric LC-tries

JOURNAL ARTICLE published November 2005 in Information Processing Letters

Authors: Yuriy A. Reznik

https://doi.org/10.1016/j.ipl.2005.06.008 Actions

A new approximation algorithm for labeling points with circle pairs

JOURNAL ARTICLE published August 2006 in Information Processing Letters

Authors: Minghui Jiang

https://doi.org/10.1016/j.ipl.2006.04.006 Actions

Subtraction-free Almost Montgomery Inverse algorithm

JOURNAL ARTICLE published April 2005 in Information Processing Letters

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

https://doi.org/10.1016/j.ipl.2004.12.012 Actions

Test sets for languages of infinite words

JOURNAL ARTICLE published September 1988 in Information Processing Letters

Authors: Aldo De Luca | Mariacristina Pelagalli | Stefano Varricchio

https://doi.org/10.1016/0020-0190(88)90035-x Actions

A fast parallel algorithm to recognize partitionable graphs

JOURNAL ARTICLE published November 1990 in Information Processing Letters

Authors: R. Lin | S. Olariu

https://doi.org/10.1016/0020-0190(90)90085-c Actions

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

https://doi.org/10.1016/0020-0190(94)00048-4 Actions

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

https://doi.org/10.1016/s0020-0190(01)00237-x Actions

Obituary Victor Mikhaylovich Glushkov (1923–1982)

JOURNAL ARTICLE published July 1982 in Information Processing Letters

Authors: Heinz Zemanek

https://doi.org/10.1016/0020-0190(82)90023-0 Actions

Improved lower bounds for some matrix multiplication problems

JOURNAL ARTICLE published September 1985 in Information Processing Letters

Authors: Joseph Ja'ja' | Jean Takche

https://doi.org/10.1016/0020-0190(85)90016-x Actions

Editorial Board

JOURNAL ARTICLE published August 2010 in Information Processing Letters

https://doi.org/10.1016/s0020-0190(10)00212-7 Actions

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

https://doi.org/10.1016/j.ipl.2018.08.007 Actions

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

https://doi.org/10.1016/j.ipl.2010.12.001 Actions

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

https://doi.org/10.1016/0020-0190(92)90077-9 Actions

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

https://doi.org/10.1016/0020-0190(93)90142-v Actions

Editorial Board

JOURNAL ARTICLE published November 2007 in Information Processing Letters

https://doi.org/10.1016/s0020-0190(07)00233-5 Actions

Worst-case analysis of a generalized heapsort algorithm

JOURNAL ARTICLE published November 1990 in Information Processing Letters

Authors: A. Paulik

https://doi.org/10.1016/0020-0190(90)90086-d Actions

A note on the decoding complexity of error-correcting codes

JOURNAL ARTICLE published November 2006 in Information Processing Letters

Authors: André Gronemeier

https://doi.org/10.1016/j.ipl.2006.06.006 Actions
Feedback: support@crossref.org