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

Efficient algorithms for common transversals

JOURNAL ARTICLE published May 1987 in Information Processing Letters

Authors: Mikhail Atallah | Chanderjit Bajaj

https://doi.org/10.1016/0020-0190(87)90226-2 Actions

On the proof of a distributed algorithm

JOURNAL ARTICLE published May 1987 in Information Processing Letters

Authors: J.Pierre Verjus

https://doi.org/10.1016/0020-0190(87)90123-2 Actions

Quantum symmetrically-private information retrieval

JOURNAL ARTICLE published May 2004 in Information Processing Letters

Authors: Iordanis Kerenidis | Ronald de Wolf

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

Finding and counting small induced subgraphs efficiently

JOURNAL ARTICLE published May 2000 in Information Processing Letters

Authors: Ton Kloks | Dieter Kratsch | Haiko Müller

https://doi.org/10.1016/s0020-0190(00)00047-8 Actions

On testing single connectedness in directed graphs and some related problems

JOURNAL ARTICLE published September 2015 in Information Processing Letters

Authors: Martin Dietzfelbinger | Raed Jaberi

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

Dominance made simple

JOURNAL ARTICLE published April 2009 in Information Processing Letters

Authors: Sanjeev Saxena

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

The clique problem for planar graphs

JOURNAL ARTICLE published January 1981 in Information Processing Letters

Authors: Christos H. Papadimitriou | Mihalis Yannakakis

https://doi.org/10.1016/0020-0190(81)90041-7 Actions

Reconstructing hv-convex polyominoes from orthogonal projections

JOURNAL ARTICLE published March 1999 in Information Processing Letters

Authors: Marek Chrobak | Christoph Dürr

https://doi.org/10.1016/s0020-0190(99)00025-3 Actions

Ski rental with two general options

JOURNAL ARTICLE published November 2008 in Information Processing Letters

Authors: Zvi Lotker | Boaz Patt-Shamir | Dror Rawitz

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

An optimal algorithm for computing the repetitions in a word

JOURNAL ARTICLE published October 1981 in Information Processing Letters

Authors: Max Crochemore

https://doi.org/10.1016/0020-0190(81)90024-7 Actions

Vertex rankings of chordal graphs and weighted trees

JOURNAL ARTICLE published May 2006 in Information Processing Letters

Authors: Dariusz Dereniowski | Adam Nadolski

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

Conditional fault tolerance of arrangement graphs

JOURNAL ARTICLE published November 2011 in Information Processing Letters

Authors: Shuming Zhou | Jun-Ming Xu

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

On the arrangement graph

JOURNAL ARTICLE published May 1998 in Information Processing Letters

Authors: Wei-Kuo Chiang | Rong-Jaye Chen

https://doi.org/10.1016/s0020-0190(98)00052-0 Actions

Computing Longest Previous non-overlapping Factors

JOURNAL ARTICLE published February 2011 in Information Processing Letters

Authors: Maxime Crochemore | German Tischler

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

On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees

JOURNAL ARTICLE published November 2022 in Information Processing Letters

Authors: Abolfazl Poureidi

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

An upper bound for the equational specification of finite state services

JOURNAL ARTICLE published June 2005 in Information Processing Letters

Authors: J.A. Bergstra | I. Bethke

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

Comments on “a distributed algorithm for distributed termination”

JOURNAL ARTICLE published July 1987 in Information Processing Letters

Authors: G. Tel | J. Van Leeuwen

https://doi.org/10.1016/0020-0190(87)90211-0 Actions

Time-bounded incompressibility of compressible strings and sequences

JOURNAL ARTICLE published August 2009 in Information Processing Letters

Authors: Edgar G. Daylight | Wouter M. Koolen | Paul M.B. Vitányi

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

Verifying programs by induction on their data structure: General format and applications

JOURNAL ARTICLE published October 1983 in Information Processing Letters

Authors: Ali Mili

https://doi.org/10.1016/0020-0190(83)90056-x Actions

Shortest enclosing walks and cycles in embedded graphs

JOURNAL ARTICLE published February 1989 in Information Processing Letters

Authors: J.Scott Provan

https://doi.org/10.1016/0020-0190(89)90129-4 Actions
Feedback: support@crossref.org