On the public citation graph

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

0 signed · 125 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.1002/ett.4460080106openalex-snapshot
Charging and rate control for elastic traffic
inferredcites →https://doi.org/10.1006/jeth.1999.2531openalex-snapshot
Walrasian Equilibrium with Gross Substitutes
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_15openalex-snapshot
Approximation Algorithms for the Max-Min Allocation Problem
inferredcites →https://doi.org/10.1007/bf01774658openalex-snapshot
Nonsymmetric Nash solutions and replications of 2-person bargaining
inferredcites →https://doi.org/10.1007/bf02986756openalex-snapshot
Discrete convex analysis
inferredcites →https://doi.org/10.1007/s00182-009-0157-6openalex-snapshot
Bargaining among groups: an axiomatic viewpoint
inferredcites →https://doi.org/10.1007/s00453-007-9105-7openalex-snapshot
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
inferredcites →https://doi.org/10.1007/s10458-013-9224-2openalex-snapshot
Computational complexity and approximability of social welfare optimization in multiagent resource allocation
inferredcites →https://doi.org/10.1007/s10784-017-9351-3openalex-snapshot
Nash bargaining solutions for international climate agreements under different sets of bargaining weights
inferredcites →https://doi.org/10.1007/s11269-016-1431-6openalex-snapshot
Water Allocation in Transboundary River Basins under Water Scarcity: a Cooperative Bargaining Approach
inferredcites →https://doi.org/10.1007/s40305-018-0195-5openalex-snapshot
Computation of Fisher–Gale Equilibrium by Auction
inferredcites →https://doi.org/10.1016/0022-0531(74)90075-1openalex-snapshot
Equity, envy, and efficiency
inferredcites →https://doi.org/10.1016/0095-8956(80)90066-0openalex-snapshot
Matroid matching and some applications
inferredcites →https://doi.org/10.1016/0176-2680(96)00003-1openalex-snapshot
Fair division: From cake-cutting to dispute resolution
inferredcites →https://doi.org/10.1016/j.geb.2005.02.006openalex-snapshot
Combinatorial auctions with decreasing marginal utilities
inferredcites →https://doi.org/10.1016/j.geb.2017.10.016openalex-snapshot
Gross substitutability: An algorithmic survey
inferredcites →https://doi.org/10.1016/j.jet.2005.05.004openalex-snapshot
Bargaining in committees as an extension of Nash's bargaining theory
inferredcites →https://doi.org/10.1017/cbo9780511546679openalex-snapshot
The Geometry of Efficient Fair Division
inferredcites →https://doi.org/10.1017/cbo9781107446984openalex-snapshot
Handbook of Computational Social Choice
inferredcites →https://doi.org/10.1093/qmath/os-13.1.83openalex-snapshot
A THEOREM ON INDEPENDENCE RELATIONS
inferredcites →https://doi.org/10.1108/03684920810884423openalex-snapshot
Algorithmic Game Theory
inferredcites →https://doi.org/10.1137/070680977openalex-snapshot
On Maximizing Welfare When Utility Functions Are Subadditive
inferredcites →https://doi.org/10.1137/080723491openalex-snapshot
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1137/1.9781611975031.147openalex-snapshot
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
inferredcites →https://doi.org/10.1137/1.9781611975031.150openalex-snapshot
Approximating the Nash Social Welfare with Budget-Additive Valuations
inferredcites →https://doi.org/10.1137/1.9781611975994.167openalex-snapshot
A Tale of Santa Claus, Hypergraphs and Matroids
inferredcites →https://doi.org/10.1137/1.9781611976465.69openalex-snapshot
Estimating the Nash Social Welfare for coverage and other submodular valuations
inferredcites →https://doi.org/10.1137/140978296openalex-snapshot
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
inferredcites →https://doi.org/10.1137/s0097539705447384openalex-snapshot
A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot
Optimal approximation for the submodular welfare problem in the value oracle model
inferredcites →https://doi.org/10.1145/2160158.2160160openalex-snapshot
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
inferredcites →https://doi.org/10.1145/2845926.2845931openalex-snapshot
Approximating the nash social welfare with indivisible items
inferredcites →https://doi.org/10.1145/3070694openalex-snapshot
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
inferredcites →https://doi.org/10.1145/3219166.3219176openalex-snapshot
Finding Fair and Efficient Allocations
inferredcites →https://doi.org/10.1145/3219166.3219184openalex-snapshot
On the Construction of Substitutes
inferredcites →https://doi.org/10.1145/3355902openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1214/aoms/1177706369openalex-snapshot
Consensus of Subjective Probabilities: The Pari-Mutuel Method
inferredcites →https://doi.org/10.1287/mnsc.18.5.80openalex-snapshot
A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete Information
inferredcites →https://doi.org/10.1287/mnsc.7.4.337openalex-snapshot
Aggregation of Utility Functions
inferredcites →https://doi.org/10.1287/moor.2019.0129openalex-snapshot
Satiation in Fisher Markets and Approximation of Nash Social Welfare
inferredcites →https://doi.org/10.1287/moor.28.3.463.16393openalex-snapshot
A Note on Kelso and Crawford's Gross Substitutes Condition
inferredcites →https://doi.org/10.1515/9781400841059openalex-snapshot
Nonlinear Optimization
inferredcites →https://doi.org/10.1609/aaai.v35i6.16665openalex-snapshot
Fair and Efficient Allocations under Subadditive Valuations
inferredcites →https://doi.org/10.1613/jair.1.11618openalex-snapshot
Improving Nash Social Welfare Approximations
inferredcites →https://doi.org/10.2139/ssrn.2243424openalex-snapshot
Asymmetric Nash Solutions in the River Sharing Problem
inferredcites →https://doi.org/10.22574/jmid.2016.12.005openalex-snapshot
Discrete convex analysis: A tool for economics and game theory
inferredcites →https://doi.org/10.2307/1913392openalex-snapshot
Job Matching, Coalition Formation, and Gross Substitutes
inferredcites →https://doi.org/10.2307/1914191openalex-snapshot
The Nash Social Welfare Function
inferredcites →https://doi.org/10.2307/2583689openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/2589459openalex-snapshot
Cake-Cutting Algorithms: Be Fair if You Can.
inferredcites →https://doi.org/10.2307/3325038openalex-snapshot
Equity in Theory and Practice
inferredcites →https://doi.org/10.3982/te1840openalex-snapshot
Gross substitutes and endowed assignment valuations
inferredcites →https://doi.org/10.4230/lipics.itcs.2017.36openalex-snapshot
Nash Social Welfare, Matrix Permanent, and Stable Polynomials
inferredcites →https://doi.org/10.48550/arxiv.1510.02694openalex-snapshot
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
inferredcites →https://doi.org/10.48550/arxiv.1805.06232openalex-snapshot
On Fair Division of Indivisible Items
inferredcites →https://doi.org/10.48550/arxiv.1902.04319openalex-snapshot
Envy-freeness up to any item with high Nash welfare: The virtue of donating items
inferredcites →https://doi.org/10.48550/arxiv.1912.12541openalex-snapshot
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
inferredcites →https://doi.org/10.7249/p2184openalex-snapshot
Complements and Substitutes in the Optimal Assignment Problem
inferredcites →https://doi.org/10.7551/mitpress/2954.001.0001openalex-snapshot
Fair Division and Collective Welfare

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00039-024-00691-wopenalex-snapshot
Maximal Multiplicity of Laplacian Eigenvalues in Negatively Curved Surfaces
inferred← citeshttps://doi.org/10.1007/s11227-024-05962-9openalex-snapshot
Token open secure and practical NTRU-based updatable encryption
inferred← citeshttps://doi.org/10.1016/b978-0-44-315441-6.00012-5openalex-snapshot
Theoretical aspects of noisy-label learning
inferred← citeshttps://doi.org/10.1016/b978-0-44-315441-6.00016-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.acha.2025.101791openalex-snapshot
Nonharmonic multivariate Fourier transforms and matrices: Condition numbers and hyperplane geometry
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128754openalex-snapshot
A note on graphs with purely imaginary per-spectrum
inferred← citeshttps://doi.org/10.1016/j.artint.2023.104049openalex-snapshot
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104114openalex-snapshot
Lifted algorithms for symmetric weighted first-order model sampling
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104177openalex-snapshot
Class fairness in online matching
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111239openalex-snapshot
Auction algorithm sensitivity for multi-robot task allocation
inferred← citeshttps://doi.org/10.1016/j.bcra.2022.100118openalex-snapshot
Cryptographic obfuscation for smart contracts: Trustless bitcoin bridge and more
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110795openalex-snapshot
A two-step linear programming approach for repeater placement in large-scale quantum networks
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2025.109380openalex-snapshot
Cyclic reinforcement learning for generalization enhancement on T/C imbalance scheduling in TFT-LCD cell manufacturing
inferred← citeshttps://doi.org/10.1016/j.dam.2022.08.007openalex-snapshot
Gaussian discrepancy: A probabilistic relaxation of vector balancing
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113954openalex-snapshot
Query complexity of Boolean functions on slices
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100746openalex-snapshot
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.04.028openalex-snapshot
Bifactor approximation for location routing with vehicle and facility capacities
inferred← citeshttps://doi.org/10.1016/j.geb.2023.02.002openalex-snapshot
Public goods games in directed networks
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e31297openalex-snapshot
On approximating a new generalization of traveling salesman problem
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.105166openalex-snapshot
Characterization of exact two-query quantum algorithms
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.519openalex-snapshot
Distributed Estimation of the Laplacian Spectrum via Wave Equation and Distributed Optimization
inferred← citeshttps://doi.org/10.1016/j.ifacsc.2025.100339openalex-snapshot
Deep Koopman-based reachability analysis for data-driven predictive control of unknown nonlinear systems
inferred← citeshttps://doi.org/10.1016/j.ins.2023.02.069openalex-snapshot
Trustworthy sealed-bid auction with low communication cost atop blockchain
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106286openalex-snapshot
A real polynomial for bipartite graph minimum weight perfect matchings
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103494openalex-snapshot
Lifting query complexity to time-space complexity for two-way finite automata
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105966openalex-snapshot
Reconstruction of hypermatrices from subhypermatrices
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.09.002openalex-snapshot
Approximating TSP walks in subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.01.002openalex-snapshot
Grid induced minor theorem for graphs of small degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.006openalex-snapshot
Treewidth versus clique number. II. Tree-independence number
inferred← citeshttps://doi.org/10.1016/j.jfa.2021.109349openalex-snapshot
Modified log-Sobolev inequalities, Beckner inequalities and moment estimates
inferred← citeshttps://doi.org/10.1016/j.jfa.2023.110038openalex-snapshot
On the convexity of general inverse σ equations
inferred← citeshttps://doi.org/10.1016/j.jisa.2025.104186openalex-snapshot
Lightweight representation learning for network traffic towards malicious traffic detection in edge devices
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102424openalex-snapshot
Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
inferred← citeshttps://doi.org/10.1016/j.laa.2022.05.002openalex-snapshot
A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.127252openalex-snapshot
An approximation algorithm for bus evacuation problem
inferred← citeshttps://doi.org/10.1016/j.neunet.2025.108112openalex-snapshot
On the theoretical expressive power of graph transformers for solving graph problems
inferred← citeshttps://doi.org/10.1016/j.neunet.2025.108156openalex-snapshot
Counterfactual generation with joint causal representation for generative adversarial networks
inferred← citeshttps://doi.org/10.1016/j.orl.2022.10.007openalex-snapshot
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107133openalex-snapshot
Circulant TSP special cases: Easily-solvable cases and improved approximations
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.013openalex-snapshot
An LP-based approximation algorithm for the generalized traveling salesman path problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114177openalex-snapshot
On (simple) decision tree rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115450openalex-snapshot
Bit-array-based alternatives to HyperLogLog
inferred← citeshttps://doi.org/10.1016/j.ymben.2023.01.010openalex-snapshot
A nutrition algorithm to optimize feed and medium composition using genome-scale metabolic models
inferred← citeshttps://doi.org/10.1103/physreva.107.032215openalex-snapshot
Generalized deep thermalization for free fermions
inferred← citeshttps://doi.org/10.1103/physreva.108.042406openalex-snapshot
Protocols for classically training quantum generative models on probability distributions
inferred← citeshttps://doi.org/10.1103/physreva.109.022407openalex-snapshot
Quantum two-block group algebra codes
inferred← citeshttps://doi.org/10.1103/physreva.110.022607openalex-snapshot
Long-range-enhanced surface codes
inferred← citeshttps://doi.org/10.1103/physreve.106.024136openalex-snapshot
Statistical limits of dictionary learning: Random matrix theory and the spectral replica method
inferred← citeshttps://doi.org/10.1103/physreve.108.064901openalex-snapshot
Local stability of spheres via the convex hull and the radical Voronoi diagram
inferred← citeshttps://doi.org/10.1103/physrevlett.134.180601openalex-snapshot
Energy Barrier of Hypergraph Product Codes
inferred← citeshttps://doi.org/10.1103/physrevresearch.4.l042030openalex-snapshot
Digitized counterdiabatic quantum optimization
inferred← citeshttps://doi.org/10.1103/physrevresearch.5.013035openalex-snapshot
Tailored XZZX codes for biased noise
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.l032020openalex-snapshot
Quantum query complexity of Boolean functions under indefinite causal order
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.013201openalex-snapshot
Predicting properties of quantum systems by regression on a quantum computer
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00037openalex-snapshot
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
inferred← citeshttps://doi.org/10.1109/tit.2026.3704289openalex-snapshot
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
inferred← citeshttps://doi.org/10.1145/3519270.3538438openalex-snapshot
Overcoming Congestion in Distributed Coloring
inferred← citeshttps://doi.org/10.1145/3564246.3585149openalex-snapshot
Linear Independence, Alternants, and Applications
inferred← citeshttps://doi.org/10.1145/3663763openalex-snapshot
Efficient Decoding up to a Constant Fraction of the Code Length for Asymptotically Good Quantum Codes
inferred← citeshttps://doi.org/10.1145/3699517openalex-snapshot
DeMEtRIS: Counting (near)-Cliques by Crawling
inferred← citeshttps://doi.org/10.1145/3748724openalex-snapshot
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
inferred← citeshttps://doi.org/10.14778/3574245.3574249openalex-snapshot
Density Personalized Group Query
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3322704/v1openalex-snapshot
Scholtes relaxation method for pessimistic bilevel optimization
inferred← citeshttps://doi.org/10.3788/col202422.060009openalex-snapshot
Information-theoretic perspective on performance assessment and fundamental limit of quantum imaging [Invited]
inferred← citeshttps://doi.org/10.62056/ae0zo-3yopenalex-snapshot
Circular Insecure Encryption: from Long Cycles to Short Cycles
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.