On the public citation graph

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

0 signed · 110 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580074openalex-snapshot
A modified layered-step interior-point algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01580724openalex-snapshot
A polynomial-time algorithm, based on Newton's method, for linear programming
inferredcites →https://doi.org/10.1007/bf01582904openalex-snapshot
On the complexity of following the central path of linear programs by linear extrapolation II
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02592148openalex-snapshot
A primal-dual interior point method whose running time depends only on the constraint matrix
inferredcites →https://doi.org/10.1007/pl00011420openalex-snapshot
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
inferredcites →https://doi.org/10.1007/s10107-005-0610-7openalex-snapshot
Improved complexity results on solving real-number linear feasibility problems
inferredcites →https://doi.org/10.1007/s10107-007-0141-5openalex-snapshot
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
inferredcites →https://doi.org/10.1007/s10107-011-0482-yopenalex-snapshot
A bound for the number of different basic solutions generated by the simplex method
inferredcites →https://doi.org/10.1007/s101070050087openalex-snapshot
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
inferredcites →https://doi.org/10.1007/s10589-013-9608-xopenalex-snapshot
Curvature integrals and iteration complexities in SDP and symmetric cone programs
inferredcites →https://doi.org/10.1007/s10957-012-0180-9openalex-snapshot
Information Geometry and Interior-Point Algorithms in Semidefinite Programs and Symmetric Cone Programs
inferredcites →https://doi.org/10.1016/0024-3795(89)90594-6openalex-snapshot
On scaled projections and pseudoinverses
inferredcites →https://doi.org/10.1016/0024-3795(90)90056-iopenalex-snapshot
On bounds for scaled projections and pseudoinverses
inferredcites →https://doi.org/10.1016/j.dam.2011.09.003openalex-snapshot
Connections in Combinatorial Optimization
inferredcites →https://doi.org/10.1016/s0024-3795(96)00409-0openalex-snapshot
A note on properties of condition numbers
inferredcites →https://doi.org/10.1016/s0898-1221(98)90495-3openalex-snapshot
Interior point algorithms: Theory and analysis
inferredcites →https://doi.org/10.1109/focs.2013.35openalex-snapshot
Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back
inferredcites →https://doi.org/10.1109/focs.2015.23openalex-snapshot
Efficient Inverse Maintenance and Faster Algorithms for Linear Programming
inferredcites →https://doi.org/10.1109/sfcs.1989.63499openalex-snapshot
Speeding-up linear programming using fast matrix multiplication
inferredcites →https://doi.org/10.1137/0212022openalex-snapshot
Towards a Genuinely Polynomial Algorithm for Linear Programming
inferredcites →https://doi.org/10.1137/070693461openalex-snapshot
A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
inferredcites →https://doi.org/10.1137/0802028openalex-snapshot
On the Implementation of a Primal-Dual Interior Point Method
inferredcites →https://doi.org/10.1137/0805026openalex-snapshot
Incorporating Condition Measures into the Complexity Theory of Linear Programming
inferredcites →https://doi.org/10.1137/1.9781611975994.16openalex-snapshot
A Deterministic Linear Program Solver in Current Matrix Multiplication Time
inferredcites →https://doi.org/10.1137/1034048openalex-snapshot
Path-Following Methods for Linear Programming
inferredcites →https://doi.org/10.1137/110835475openalex-snapshot
A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity
inferredcites →https://doi.org/10.1137/151002915openalex-snapshot
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
inferredcites →https://doi.org/10.1137/17m1142132openalex-snapshot
Log-Barrier Interior Point Methods Are Not Strongly Polynomial
inferredcites →https://doi.org/10.1137/21m1419994openalex-snapshot
Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
inferredcites →https://doi.org/10.1137/s0895479892230948openalex-snapshot
Stable Numerical Algorithms for Equilibrium Systems
inferredcites →https://doi.org/10.1137/s1052623401388926openalex-snapshot
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
inferredcites →https://doi.org/10.1137/s1052623402416803openalex-snapshot
A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
inferredcites →https://doi.org/10.1142/9789812778031_0006openalex-snapshot
RECONCILIATION OF VARIOUS COMPLEXITY AND CONDITION MEASURES FOR LINEAR PROGRAMMING PROBLEMS AND A GENERALIZATION OF TARDOS' THEOREM
inferredcites →https://doi.org/10.1145/1007352.1007372openalex-snapshot
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
inferredcites →https://doi.org/10.1145/1374376.1374441openalex-snapshot
Faster approximate lossy generalized flow via interior point algorithms
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/3055399.3055439openalex-snapshot
A simpler and faster strongly polynomial algorithm for generalized flow maximization
inferredcites →https://doi.org/10.1145/3313276.3316303openalex-snapshot
Solving linear programs in the current matrix multiplication time
inferredcites →https://doi.org/10.1145/800057.808695openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1287/moor.1050.0149openalex-snapshot
A New Complexity Result on Solving the Markov Decision Problem
inferredcites →https://doi.org/10.1287/moor.1110.0516openalex-snapshot
The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
inferredcites →https://doi.org/10.1287/moor.18.4.964openalex-snapshot
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
inferredcites →https://doi.org/10.1287/moor.2016.0800openalex-snapshot
A Strongly Polynomial Algorithm for Generalized Flow Maximization
inferredcites →https://doi.org/10.1287/moor.5.3.388openalex-snapshot
The Relaxation Method for Solving Systems of Linear Inequalities
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.1287/opre.38.6.1006openalex-snapshot
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.48550/arxiv.1412.1587openalex-snapshot
The entropic barrier: a simple and optimal universal self-concordant barrier
inferredcites →https://doi.org/10.48550/arxiv.1910.08033openalex-snapshot
Solving Linear Programs with Sqrt(rank) Linear System Solves

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.acha.2021.09.001openalex-snapshot
Differentially private SGD with non-smooth losses
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104208openalex-snapshot
Polynomial calculus for optimization
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109745openalex-snapshot
A spanning tree algorithm with adaptive pruning with low redundancy coverage rate
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114388openalex-snapshot
Even pairs in Berge graphs with no balanced skew-partitions
inferred← citeshttps://doi.org/10.1016/j.ecosta.2023.07.003openalex-snapshot
Robust empirical risk minimization via Newton’s method
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.120006openalex-snapshot
On the local convergence of GANs with differential Privacy: Gradient clipping and noise perturbation
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105152openalex-snapshot
Monomial Boolean functions with large high-order nonlinearities
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105225openalex-snapshot
Truthful and privacy-preserving generalized linear models
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120167openalex-snapshot
Communication-efficient and privacy-preserving large-scale federated learning counteracting heterogeneity
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121211openalex-snapshot
Density-based clustering with differential privacy
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106268openalex-snapshot
Spectral independence, coupling, and the spectral gap of the Glauber dynamics
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.08.005openalex-snapshot
Improved distance sensitivity oracles with subcubic preprocessing time
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.008openalex-snapshot
Single-source shortest paths and strong connectivity in dynamic planar graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.11.001openalex-snapshot
Deterministic non-adaptive contention resolution on a shared channel
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103496openalex-snapshot
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103506openalex-snapshot
On coresets for fair clustering in metric and Euclidean spaces and their applications
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103600openalex-snapshot
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.jiixd.2024.02.001openalex-snapshot
A survey on membership inference attacks and defenses in machine learning
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.012openalex-snapshot
Secured distributed algorithms without hardness assumptions
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111356openalex-snapshot
Differential private knowledge trading in vehicular federated learning using contract theory
inferred← citeshttps://doi.org/10.1016/j.nlp.2023.100024openalex-snapshot
An evaluation on large language model outputs: Discourse and memorization
inferred← citeshttps://doi.org/10.1016/j.softx.2021.100659openalex-snapshot
Polyrun: A Java library for sampling from the bounded convex polytopes
inferred← citeshttps://doi.org/10.1016/j.sysarc.2023.102932openalex-snapshot
A review of sensory interactions between autonomous vehicles and drivers
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.001openalex-snapshot
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.038openalex-snapshot
A survey of size counting in population protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.020openalex-snapshot
Uniform bipartition in the population protocol model with arbitrary graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.019openalex-snapshot
Distributed strong diameter network decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.047openalex-snapshot
Distributed minimum vertex coloring and maximum independent set in chordal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.031openalex-snapshot
Loosely-stabilizing maximal independent set algorithms with unreliable communications
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114259openalex-snapshot
Gradient complexity and non-stationary views of differentially private empirical risk minimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115578openalex-snapshot
Faster leader election via mobile agents and its applications
inferred← citeshttps://doi.org/10.1017/dce.2022.36openalex-snapshot
Quantum computing for data-centric engineering and science
inferred← citeshttps://doi.org/10.1088/1402-4896/acf3a2openalex-snapshot
Quantum walk state transfer on a hypercube
inferred← citeshttps://doi.org/10.1103/physreva.103.012418openalex-snapshot
Quantum algorithms for hedging and the learning of Ising models
inferred← citeshttps://doi.org/10.1103/physreva.103.042422openalex-snapshot
Quantum-classical algorithms for skewed linear systems with an optimized Hadamard test
inferred← citeshttps://doi.org/10.1103/physreva.104.062411openalex-snapshot
Fast and scalable classical machine-learning algorithm with similar performance to quantum circuit learning
inferred← citeshttps://doi.org/10.1103/physreva.105.022415openalex-snapshot
Quantum advantage for differential equation analysis
inferred← citeshttps://doi.org/10.1103/physreva.108.042422openalex-snapshot
Entanglement area law for one-dimensional gauge theories and bosonic systems
inferred← citeshttps://doi.org/10.1103/physreva.108.062423openalex-snapshot
Shallow quantum circuits for deeper problems
inferred← citeshttps://doi.org/10.1103/physreva.109.032229openalex-snapshot
Multipartite high-dimensional quantum state engineering via discrete-time quantum walk
inferred← citeshttps://doi.org/10.1103/physreva.109.052435openalex-snapshot
Quantum search in many-body interacting systems with long-range interactions
inferred← citeshttps://doi.org/10.1103/physreva.111.032409openalex-snapshot
Tensor networks and efficient descriptions of classical data
inferred← citeshttps://doi.org/10.1103/physrevb.102.224202openalex-snapshot
Topological delocalization in the completely disordered two-dimensional quantum walk
inferred← citeshttps://doi.org/10.1103/physrevb.106.134420openalex-snapshot
Hidden Bethe states in a partially integrable model
inferred← citeshttps://doi.org/10.1103/physrevb.109.155126openalex-snapshot
Spectral form factors of topological phases
inferred← citeshttps://doi.org/10.1103/physrevb.111.174520openalex-snapshot
Models of interacting bosons with exact ground states: A unified approach
inferred← citeshttps://doi.org/10.1103/physrevlett.129.230504openalex-snapshot
Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
inferred← citeshttps://doi.org/10.1103/physrevlett.133.200402openalex-snapshot
Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.033199openalex-snapshot
Quantum-inspired algorithm for general minimum conical hull problems
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.023237openalex-snapshot
Tight bound for estimating expectation values from a system of linear equations
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.033068openalex-snapshot
Quantum computational advantage attested by nonlocal games with the cyclic cluster state
inferred← citeshttps://doi.org/10.1103/physrevx.14.011014openalex-snapshot
Sparse Random Hamiltonians Are Quantumly Easy
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00073openalex-snapshot
Estimating the Longest Increasing Subsequence in Nearly Optimal Time
inferred← citeshttps://doi.org/10.1145/3673651openalex-snapshot
Query Lower Bounds for Log-concave Sampling
inferred← citeshttps://doi.org/10.1145/3760771openalex-snapshot
The Computational Advantage of MIP* Vanishes in the Presence of Noise
inferred← citeshttps://doi.org/10.1186/s12911-020-01224-9openalex-snapshot
As if sand were stone. New concepts and metrics to probe the ground on which to build trustable AI
inferred← citeshttps://doi.org/10.14778/3594512.3594519openalex-snapshot
Answering Private Linear Queries Adaptively Using the Common Mechanism
inferred← citeshttps://doi.org/10.1609/aaai.v38i11.29092openalex-snapshot
Fast Machine Unlearning without Retraining through Selective Synaptic Dampening
inferred← citeshttps://doi.org/10.3788/col202523.032501openalex-snapshot
Smoothed analysis-based noise manipulation for spatial photonic Ising machines
inferred← citeshttps://doi.org/10.54254/2755-2721/5/20230711openalex-snapshot
The advance of neural networks generalization performance
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.