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.

Proving Computational Intractability Through Hardness Reductions 12
The Empirical Validation Gap 11
Tightening the Approximation Hardness Gap 4
Extending Structural Graph Properties to Broader Graph Classes 3
Beyond Worst-Case Analysis of Algorithmic Performance 3
The Empirical Validation Gap in Graph Algorithms 3
Generalizing Matrix and Tensor Recovery to Asymmetric Systems 2
The Computational Cost of High Precision 2
Greedy Maximization for Submodular Subset Selection 2
From Fractional Solutions to Discrete Decisions 2
Dynamic Workload Redistribution in Parallel Systems 2
Learning and Hybrid Search for Combinatorial Optimization 2
Fair Division of Indivisible Resources 2
Non-Redundant Topological Representations for VLSI Floorplanning 1
Synchronous Abstractions for Asynchronous Distributed Systems 1

Top Authors

AuthorPapers
Kurt Mehlhorn22
Christos Papadimitriou10
Jörg Rothe9
Andrew C Yao7
Michael Mitzenmacher6
Benjamin Doerr5
Hans U. Simon5
Noga Alon5
Olaf Beyersdorff5
Pasin Manurangsi5
Subhamoy Maitra5
Yishay Mansour5
Giuseppe Persiano4
Joseph JaJa4
Martin Lange4
Meirav Zehavi4
Mikko Koivisto4
Venkatesh Srinivasan4
Yossi Azar4
A. Pavan3

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
A Tool for the Analysis of Manipulation1993
Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis1993
On the Maximum Length of Huffman Codes1993
On the Relationship Between Deterministic Time and Deterministic Reversal1993
Single Jog Minimum Area Joining of Compacted Cells1993
Testing a Simple Polygon for Monotonicity Optimally in Parallel1993
A Dynamic Programming Solution to the n-Queens Problem1992
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition1992
Approximating the Minimum-Cost Maximum Flow is P-Complete1992
Batch Checking with Applications to Linear Functions1992
Binding Propagation Beyond the Reach of Rule/Goal Graphs1992
Edge Intersection on the Hypercube Computer1992
Failure-Equivalent Transformation of Transition Systems to Avoid Internal Actions1992
Fast Computation of the Euclidian Distance Maps for Binary Images1992
Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard1992
On the Difficulty of Manhattan Channel Routing1992
On the Greedy Algorithm for Satisfiability1992
On the Power of Two-Local Random Reductions1992
Optimal Time Bounds for Some Proximity Problems in the Plane1992
Rank-r Decision Trees are a Subclass of r-Decision Lists1992
Sooner is Safer Than Later1992
The Algorithmic Complexity of Colour Switching1992
Towards an Understanding of Unbounded Variables in Asynchronous Systems1992
A Competitive 2-Server Algorithm1991
Building Heaps in Parallel1991
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)1991
Deferred Data Structure for the Nearest Neighbor Problem1991
Fastest Path Across Constrained Moving Rectilinear Obstacles1991
Server Problems and Resistive Spaces1991
The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank1991
A Feasibly Constructive Lower Bound for Resolution Proofs1990
A Metric for Traces1990
An Optimal Parallel Algorithm for Linear Programming in the Plane1990
A Parallel Algorithm for Eliminating Cycles in Undirected Graphs1990
A Simple Randomized Parallel Algorithm for List-Ranking1990
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space1990
Dynamic Deferred Data Structuring1990
Generating Pseudo-Random Permutations and Maximum Flow Algorithms1990
Hidden Line Elimination for Isooriented Rectangels1990
Polygon Nesting and Robustness1990
Space Efficient Processor Identity Protocol1990
The Cover Time of a Regular Expander is O(n log n)1990
The Optimum Execution Order of Queries in Linear Storage1990
An O(n log n) Lower Bound for Decomposing a Set of Points into Chains1989
An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem1989
An Optimal Parallel Circle-Cover Algorithm1989
Bit Complexity of Order Statistics on a Distributed Star Network1989
Comments on "A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases"1989
Drawing Polygons Given Angle Sequences1989
Fast Approximations to Discrete Optimal Quantization1989

« prev Page 11/12 next »