Inf. Process. Lett
596 papers117 directions
Papers by Year
| 2027 | 1 |
| 2026 | 4 |
| 2025 | 8 |
| 2024 | 8 |
| 2023 | 12 |
| 2022 | 13 |
| 2021 | 12 |
| 2020 | 10 |
| 2019 | 13 |
| 2018 | 22 |
| 2017 | 18 |
| 2016 | 14 |
| 2015 | 17 |
| 2014 | 17 |
| 2013 | 21 |
| 2012 | 18 |
| 2011 | 21 |
| 2010 | 22 |
| 2009 | 25 |
| 2008 | 26 |
| 2007 | 14 |
| 2006 | 23 |
| 2005 | 14 |
| 2004 | 19 |
| 2003 | 17 |
| 2002 | 15 |
| 2001 | 7 |
| 2000 | 13 |
| 1999 | 10 |
| 1998 | 14 |
| 1997 | 14 |
| 1996 | 18 |
| 1995 | 17 |
| 1994 | 15 |
| 1993 | 9 |
| 1992 | 17 |
| 1991 | 7 |
| 1990 | 13 |
| 1989 | 9 |
| 1988 | 10 |
| 1987 | 4 |
| 1986 | 2 |
| 1985 | 5 |
| 1984 | 2 |
| 1983 | 2 |
| 1982 | 2 |
| 1981 | 6 |
| 1980 | 1 |
| 1979 | 4 |
| 1977 | 1 |
| 1976 | 2 |
| 1975 | 2 |
| 1971 | 1 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
Impactful Papers
Papers from this venue that shaped research clusters.
Foundational
NQPC = co-C=P
foundational
The Computational Limits of Quantum Advi
1999
Single Jog Minimum Area Joining of Compacted Cells
foundational
Non-Redundant Topological Representation
1993
The communication complexity of the Hamming distance problem
foundational
Lower Bounds for Quantum and Hamming Com
2006
Improved approximation algorithms for the Min-Max Selecting Items problem
foundational
Breaking Approximation Barriers in Metri
2013
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
foundational
Managing the Cardinality Explosion in Mu
2005
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource
foundational
Online Fair Division with Sequential Arr
1997
Commutativity of quantum weakest preconditions
foundational
Quantum Hoare Logic and Weakest Precondi
2007
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
foundational
Parameter Agnostic Sublinear Graph Algor
2011
Efficient Searching Using Partial Ordering
foundational
Yao's Minimax Principle for Randomized L
1981
The communication complexity of the Hamming distance problem
foundational
Communication Efficiency in Secure Distr
2006
Influential
The computational complexity of some explainable clustering problems
influential
Explainable Clustering and Semantic Labe
2024
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
influential
Generalizing Matrix and Tensor Recovery
2011
Strong hardness of approximation for tree transversals
influential
Hypergraph to Graph Reduction
2023
On the non-efficient PAC learnability of conjunctive queries
influential
Exact Learning with Membership and Equiv
2024
On the bounds of feedback numbers of (n, k)-star graphs
influential
Parameterized Complexity of Directed Fee
2012
The power of first-order quantification over states in branching and linear time temporal logics
influential
Overcoming Expressivity Limits in Tempor
2004
Incremental deployment of network monitors based on Group Betweenness Centrality
influential
Beyond Shortest Paths in Policy-Driven N
2009
Improved algorithm for finding next-to-shortest paths
influential
The Empirical Validation Gap in Graph Al
2006
The computational complexity of some explainable clustering problems
influential
Proving Computational Intractability Thr
2024
Spanning trees with minimum weighted degrees
influential
Proving Computational Intractability Thr
2007
Related Venues
Venues with the most similar research cluster distributions.
Theoretical Computer Science62% similar · 1,733 papers
Stacs59% similar · 357 papers
Esa59% similar · 632 papers
Iwoca58% similar · 71 papers
Approx-random57% similar · 404 papers
Cocoon57% similar · 321 papers
Isaac56% similar · 401 papers
ICALP55% similar · 1,234 papers
Ipco54% similar · 244 papers
Aaim53% similar · 91 papers
Papers
« prev Page 12/12