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
Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem1989
Study of Self-Organizing Heuristics for Skewed Access Patterns1989
A Faster Approximation Algorithm for the Steiner Problem in Graphs1988
Alternating Real-Time Computations1988
An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph1988
An Optimally Efficient Selection Algorithm1988
Matrix Multiplication for Finite Algebraic Systems1988
On Generating All Maximal Independent Sets1988
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees1988
The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures1988
The Generation of Random Permutations on the Fly1988
Two Algorithms for Constructing a Binary Tree from its Traversals1988
A log log n Data Structure for Three-Sided Range Queries1987
An Application of the Planar Separator Theorem to Counting Problems1987
Efficient Algorithms for Common Transversals1987
Occam's Razor1987
Linear Programming in O(n * (3_d)_2) Time1986
On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications1986
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set1985
An Algorithm for Shortest-Path Motion in Three Dimensions1985
A Parallel Median Algorithm1985
Improved Lower Bounds for Some Matrix Multiplication Problems1985
More on Looping vs. Repeating in Dynamic Logic1985
Partial Match Retrieval in Implicit Data Structures1984
Strong NP-Hardness of Moving Many Discs1984
A Modification of the Greedy Algorithm for Vertex Cover1983
On Computing All North-East Nearest Neighbors in the L1 Metric1983
A Probabilistic Algorithm for Vertex Connectivity of Graphs1982
Formal Correctness Proofs of a Nondeterministic Program1982
Efficient Searching Using Partial Ordering1981
On Minimal Eulerian Graphs1981
Optimal Dynamization of Decomposable Searching Problems1981
Testing a Simple Polygon for Monotonicity1981
The Clique Problem for Planar Graphs1981
The Complexity of Testing Whether a Graph is a Superconcentrator1981
A Note on the Analysis of Extendible Hashing1980
A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases1979
A Note on Rabin's Nearest-Neighbor Algorithm1979
Efficient Search for Rationals1979
Two Results on Process Logic1979
A Method for Determining Class Subspaces1977
An Almost Optimal Algorithm for Unbounded Searching1976
Bracket-Languages are Recognizable in Logarithmic Space1976
An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees1975
On the Divergence and the Joshi Dependence Measure in Feature Selection1975
A V² Algorithm for Determining Isomorphism of Planar Graphs1971

« prev Page 12/12