On the public citation graph
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
0 signed · 582 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1521-3978(199811)46:6/8<759::aid-prop759>3.0.co;2-eopenalex-snapshot
Prospects for Quantum Computation with Trapped Ions
inferred← citeshttps://doi.org/10.1002/3527603182.ch1openalex-snapshot
The Physical Implementation of Quantum Computation
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0093openalex-snapshot
Basis Reduction Methods
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0774openalex-snapshot
The Simplex Method and Its Complexity
inferred← citeshttps://doi.org/10.1002/9781118984352.ch7openalex-snapshot
User Driven Server Selection Algorithm for CDN Architecture
inferred← citeshttps://doi.org/10.1002/9781118984413.ch3openalex-snapshot
Multiprocessor Architecture Solutions
inferred← citeshttps://doi.org/10.1002/9781394237258.ch7openalex-snapshot
Integrating Consortium Blockchain and Mimic Security in Distributed Storage System
inferred← citeshttps://doi.org/10.1002/cpe.700openalex-snapshot
Parallel computation on interval graphs: algorithms and experiments
inferred← citeshttps://doi.org/10.1002/cpe.8351openalex-snapshot
Quantum Computer Architecture for Quantum Error Correction With Distributing Process to Multiple Temperature Layers
inferred← citeshttps://doi.org/10.1002/jgt.3190120208openalex-snapshot
Nowhere‐zero flows in low genus graphs
inferred← citeshttps://doi.org/10.1002/sam.11207openalex-snapshot
A distributed kernel summation framework for general‐dimension machine learning
inferred← citeshttps://doi.org/10.1002/sec.571openalex-snapshot
Efficient chosen ciphertext secure public‐key encryption under factoring assumption
inferred← citeshttps://doi.org/10.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferred← citeshttps://doi.org/10.1006/jcss.2002.1882openalex-snapshot
A Constant-Factor Approximation Algorithm for the k-Median Problem
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_26openalex-snapshot
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_401openalex-snapshot
Statistical Query Learning
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_325openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_10openalex-snapshot
Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security Protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_18openalex-snapshot
A Tutorial on Computable Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_10openalex-snapshot
The Quantitative Structure of Exponential Time
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_30openalex-snapshot
Removing Interaction from Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_539openalex-snapshot
Discrete Wavelet Transform and Wavelet Synopses
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_5openalex-snapshot
Property Testing in Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_539-2openalex-snapshot
Discrete Wavelet Transform and Wavelet Synopses
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_116openalex-snapshot
Distributed Algorithms for Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_325openalex-snapshot
Mechanical Computing: The Computational Complexity of Physical Devices
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_3openalex-snapshot
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_8openalex-snapshot
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_1549openalex-snapshot
Oblivious Parallel RAM (OPRAM)
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_1openalex-snapshot
Complexity Theory Basics: NP and NL
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_13openalex-snapshot
Abstraction and Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_3openalex-snapshot
Extremal Kernelization: A Commemorative Paper
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_19openalex-snapshot
What Is Known About Vertex Cover Kernelization?
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_39openalex-snapshot
Using Random Sampling to Build Approximate Tries for Efficient String Sorting
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_11openalex-snapshot
Boosting Based on Divide and Merge
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_48openalex-snapshot
Some Theorems Concerning the Core Function
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_46openalex-snapshot
On Problems without Polynomial Kernels (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_52openalex-snapshot
On Euclidean Vehicle Routing with Allocation
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_11openalex-snapshot
On the Approximation Resistance of a Random Predicate
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_15openalex-snapshot
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_19openalex-snapshot
Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_23openalex-snapshot
Dial a Ride from k-Forest
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_7openalex-snapshot
Finding Frequent Elements in Non-bursty Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-77105-0_38openalex-snapshot
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_9openalex-snapshot
Quantified Positive Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_38openalex-snapshot
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_37openalex-snapshot
A Problem Kernelization for Graph Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-00563-3_23openalex-snapshot
On Construction of Partial Association Rules with Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_32openalex-snapshot
Incompressibility through Colors and IDs
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_13openalex-snapshot
Lower Bounds for Kernelizations and Other Preprocessing Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_8openalex-snapshot
k-SAT Is No Harder Than Decision-Unique-k-SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_9openalex-snapshot
Probabilistically Checkable Arguments
inferred← citeshttps://doi.org/10.1007/978-3-642-03864-8_1openalex-snapshot
DEEP-SaM - Energy-Efficient Provisioning Policies for Computing Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_57openalex-snapshot
Kernel Bounds for Disjoint Cycles and Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-10745-0_1openalex-snapshot
Hierarchical Clustering with Performance Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_2openalex-snapshot
Kernelization: New Upper and Lower Bound Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_20openalex-snapshot
Extended Islands of Tractability for Parsimony Haplotyping
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_22openalex-snapshot
Lower Bounds for Reducibility to the Kolmogorov Random Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_55openalex-snapshot
Preprocessing of Min Ones Problems: A Dichotomy
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_26openalex-snapshot
Some Recent Results on Local Testing of Sparse Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_15openalex-snapshot
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19379-8_13openalex-snapshot
Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-19896-0_2openalex-snapshot
Preserving Privacy in Data Mining via Importance Weighting
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_3openalex-snapshot
Kernelization: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-23169-8_35openalex-snapshot
A Distributed Genetic Algorithm for Graph-Based Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_3openalex-snapshot
On the Expressive Power of Deep Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_19openalex-snapshot
Multicommodity Flows and Edge-Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-24861-0_22openalex-snapshot
How Much Is Enough? Choosing ε for Differential Privacy
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_774-1openalex-snapshot
Quantum Algorithms for Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_13openalex-snapshot
On the Hardness of Losing Width
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_2openalex-snapshot
Parameterized Complexity of Firefighting Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_20openalex-snapshot
On Cutwidth Parameterized by Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_19openalex-snapshot
Kernels for Packing and Covering Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-30054-7_16openalex-snapshot
Heterogeneous Secure Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_10openalex-snapshot
Kernelization – Preprocessing with a Guarantee
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_15openalex-snapshot
Backdoors to Satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_20openalex-snapshot
What’s Next? Future Directions in Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_28openalex-snapshot
A Linear Kernel for the Complementary Maximal Strip Recovery Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_26openalex-snapshot
Black-Box Reductions and Separations in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_38openalex-snapshot
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_25openalex-snapshot
A Multivariate Analysis of Some DFA Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39256-6_3openalex-snapshot
Differentially Private Multi-dimensional Time Series Release for Traffic Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_44openalex-snapshot
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_31openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_32openalex-snapshot
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-05300-3_13openalex-snapshot
Object Repositories for Digital Libraries
inferred← citeshttps://doi.org/10.1007/978-3-662-05642-4_9openalex-snapshot
Quantum Computers: the Church-Turing Hypothesis Versus the Turing Principle
inferred← citeshttps://doi.org/10.1007/978-3-662-43936-4_13openalex-snapshot
ELITE: zEro Links Identity managemenT systEm
inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_7openalex-snapshot
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_6openalex-snapshot
The Complexity of Finding Read-Once NAE-Resolution Refutations
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_47openalex-snapshot
On the structure of graphs with large minimum bisection
inferred← citeshttps://doi.org/10.1007/bf01580648openalex-snapshot
On the expected number of linear complementarity cones intersected by random and semi-random rays
inferred← citeshttps://doi.org/10.1007/bf01580724openalex-snapshot
A polynomial-time algorithm, based on Newton's method, for linear programming
inferred← citeshttps://doi.org/10.1007/bf01592243openalex-snapshot
One-third-integrality in the max-cut problem
inferred← citeshttps://doi.org/10.1007/bf01594941openalex-snapshot
Karmarkar's linear programming algorithm and Newton's method
inferred← citeshttps://doi.org/10.1007/bf01788539openalex-snapshot
Paths and edge-connectivity in graphs III. Six-terminalk paths
inferred← citeshttps://doi.org/10.1007/bf01840453openalex-snapshot
Introduction: New approaches to linear programming
inferred← citeshttps://doi.org/10.1007/bf02523688openalex-snapshot
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
inferred← citeshttps://doi.org/10.1007/bfb0035850openalex-snapshot
A simple protocol for secure circuit evaluation
inferred← citeshttps://doi.org/10.1007/s00039-010-0106-3openalex-snapshot
Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$
inferred← citeshttps://doi.org/10.1007/s00145-011-9112-3openalex-snapshot
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
inferred← citeshttps://doi.org/10.1007/s00145-013-9172-7openalex-snapshot
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00224-009-9185-7openalex-snapshot
Trimmed Moebius Inversion and Graphs of Bounded Degree
inferred← citeshttps://doi.org/10.1007/s00224-011-9365-0openalex-snapshot
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
inferred← citeshttps://doi.org/10.1007/s00224-011-9368-xopenalex-snapshot
The Complexity of Explicit Constructions
inferred← citeshttps://doi.org/10.1007/s00224-013-9480-1openalex-snapshot
On the Hardness of Losing Width
inferred← citeshttps://doi.org/10.1007/s00224-013-9523-7openalex-snapshot
Complexity of Rational and Irrational Nash Equilibria
inferred← citeshttps://doi.org/10.1007/s00453-007-9143-1openalex-snapshot
The Network as a Storage Device: Dynamic Routing with Bounded Buffers
inferred← citeshttps://doi.org/10.1007/s00453-012-9619-5openalex-snapshot
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems
inferred← citeshttps://doi.org/10.1007/s00453-012-9681-zopenalex-snapshot
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
inferred← citeshttps://doi.org/10.1007/s00453-012-9704-9openalex-snapshot
Computing the Map of Geometric Minimal Cuts
inferred← citeshttps://doi.org/10.1007/s00453-012-9734-3openalex-snapshot
Necklaces, Convolutions, and X+Y
inferred← citeshttps://doi.org/10.1007/s00453-017-0352-yopenalex-snapshot
Fréchet Distance Between a Line and Avatar Point Set
inferred← citeshttps://doi.org/10.1007/s00493-016-3363-4openalex-snapshot
Random matrices have simple spectrum
inferred← citeshttps://doi.org/10.1007/s10114-015-4479-yopenalex-snapshot
Acyclic edge coloring of triangle-free 1-planar graphs
inferred← citeshttps://doi.org/10.1007/s10479-011-0858-7openalex-snapshot
A least-squares minimum-cost network flow algorithm
inferred← citeshttps://doi.org/10.1007/s10601-012-9127-xopenalex-snapshot
A complexity perspective on entailment of parameterized linear constraints
inferred← citeshttps://doi.org/10.1007/s10773-017-3405-8openalex-snapshot
Simultaneous classification of Oranges and Apples Using Grover’s and Ventura’ Algorithms in a Two-qubits System
inferred← citeshttps://doi.org/10.1007/s10878-012-9474-yopenalex-snapshot
Acyclic edge coloring of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1007/s11424-017-6332-0openalex-snapshot
Computing Sparse GCD of Multivariate Polynomials via Polynomial Interpolation
inferred← citeshttps://doi.org/10.1007/s11425-013-4644-7openalex-snapshot
Acyclic edge coloring of planar graphs without adjacent cycles
inferred← citeshttps://doi.org/10.1007/s11425-023-2346-3openalex-snapshot
Differentially private analysis of networks with covariates via a generalized β-model
inferred← citeshttps://doi.org/10.1007/s11432-012-4711-7openalex-snapshot
Parallel computation of determinants of matrices with multivariate polynomial entries
inferred← citeshttps://doi.org/10.1007/s11432-013-4795-8openalex-snapshot
A polynomial time algorithm for GapCVPP in l 1 norm
inferred← citeshttps://doi.org/10.1007/s11432-013-4866-xopenalex-snapshot
A theoretical framework for quantum image representation and data loading scheme
inferred← citeshttps://doi.org/10.1007/s11432-014-5147-zopenalex-snapshot
Lattice-based key exchange on small integer solution problem
inferred← citeshttps://doi.org/10.1007/s11432-015-1037-2openalex-snapshot
A new construction on randomized message-locked encryption in the standard model via UCEs
inferred← citeshttps://doi.org/10.1007/s11432-015-5385-8openalex-snapshot
Memory leakage-resilient secret sharing schemes
inferred← citeshttps://doi.org/10.1007/s11432-015-5433-4openalex-snapshot
Survey on cyberspace security
inferred← citeshttps://doi.org/10.1007/s11432-015-5447-yopenalex-snapshot
Cryptanalysis of an MOR cryptosystem based on a finite associative algebra
inferred← citeshttps://doi.org/10.1007/s11432-015-5474-8openalex-snapshot
Discussion on the theoretical results of white-box cryptography
inferred← citeshttps://doi.org/10.1007/s11432-017-9117-0openalex-snapshot
Decision-implementation complexity of cooperative game systems
inferred← citeshttps://doi.org/10.1007/s11432-017-9307-0openalex-snapshot
Orthogonalized lattice enumeration for solving SVP
inferred← citeshttps://doi.org/10.1007/s11432-017-9409-7openalex-snapshot
A rejection sampling algorithm for off-centered discrete Gaussian distributions over the integers
inferred← citeshttps://doi.org/10.1007/s11432-017-9412-3openalex-snapshot
A more compact multi-id identity-based FHE scheme in the standard model and its applications
inferred← citeshttps://doi.org/10.1007/s11432-017-9468-yopenalex-snapshot
Quantum key-recovery attack on Feistel structures
inferred← citeshttps://doi.org/10.1007/s11432-018-9589-xopenalex-snapshot
Secure two-party SM9 signing
inferred← citeshttps://doi.org/10.1007/s11432-019-1509-7openalex-snapshot
An enhanced searchable encryption scheme for secure data outsourcing
inferred← citeshttps://doi.org/10.1007/s11432-024-4439-1openalex-snapshot
On the encryption for graph foundation model inference of sparse graph
inferred← citeshttps://doi.org/10.1007/s11433-015-5661-zopenalex-snapshot
First experimental demonstration of an exact quantum search algorithm in nuclear magnetic resonance system
inferred← citeshttps://doi.org/10.1007/s11433-017-9132-yopenalex-snapshot
Improving the efficiency of quantum hash function by dense coding of coin operators in discrete-time quantum walk
inferred← citeshttps://doi.org/10.1007/s11434-013-5925-9openalex-snapshot
Deleting a marked state in quantum database in a duality computing mode
inferred← citeshttps://doi.org/10.1007/s11704-014-3289-1openalex-snapshot
Unbalanced graph cuts with minimum capacity
inferred← citeshttps://doi.org/10.1007/s11704-016-5554-yopenalex-snapshot
A survey of RDF data management systems
inferred← citeshttps://doi.org/10.1007/s11704-024-40238-8openalex-snapshot
Improving local search algorithms for clique relaxation problems via group driven initialization
inferred← citeshttps://doi.org/10.1007/s11704-024-40266-4openalex-snapshot
Deterministic streaming algorithms for non-monotone submodular maximization
inferred← citeshttps://doi.org/10.1007/s11704-024-40952-3openalex-snapshot
A survey of estimating number of distinct values
inferred← citeshttps://doi.org/10.1007/s11704-025-40919-yopenalex-snapshot
Multivariate basic function secret sharing from oblivious transfer
inferred← citeshttps://doi.org/10.1007/s11859-013-0924-xopenalex-snapshot
A resource-fair protocol for two-party coin toss
inferred← citeshttps://doi.org/10.1007/s12204-017-1837-1openalex-snapshot
Lattice-based group signature with verifier-local revocation
inferred← citeshttps://doi.org/10.1007/s42064-024-0216-6openalex-snapshot
Transcription and optimization of an interplanetary trajectory through quantum annealing
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90042-xopenalex-snapshot
Improved upper bounds on shellsort
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90042-uopenalex-snapshot
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90089-3openalex-snapshot
A ramsey type problem concerning vertex colourings
inferred← citeshttps://doi.org/10.1016/0096-0551(83)90028-0openalex-snapshot
A distributed synchronization mechanism for interacting processes
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90068-ropenalex-snapshot
Parallel algorithms for the assignment and minimum-cost flow problems
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90062-9openalex-snapshot
Towards optimal parallel bucket sorting
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90021-sopenalex-snapshot
Deterministic P-RAM simulation with constant redundancy
inferred← citeshttps://doi.org/10.1016/b978-0-44-329238-5.00015-9openalex-snapshot
Sparsity-aware learning: concepts and theoretical foundations
inferred← citeshttps://doi.org/10.1016/b978-0-44-332940-1.00016-2openalex-snapshot
Capacitated network design
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103166openalex-snapshot
Bounded-depth Frege complexity of Tseitin formulas for all graphs
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.001openalex-snapshot
Computing a small agreeable set of indivisible items
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103451openalex-snapshot
On the noise estimation statistics
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101881openalex-snapshot
On the spanning and routing ratios of the directed Θ6-graph
inferred← citeshttps://doi.org/10.1016/j.cor.2012.01.006openalex-snapshot
Efficient approximation algorithms for the routing open shop problem
inferred← citeshttps://doi.org/10.1016/j.cose.2018.08.012openalex-snapshot
Reducing the communication complexity of quantum private database queries by subtle classical post-processing with relaxed quantum ability
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.003openalex-snapshot
Colouring, constraint satisfaction, and complexity
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100344openalex-snapshot
Compactors for parameterized counting problems
inferred← citeshttps://doi.org/10.1016/j.csi.2023.103761openalex-snapshot
Abuse-resistant deniable encryption
inferred← citeshttps://doi.org/10.1016/j.csi.2023.103807openalex-snapshot
Lattice-based dynamic universal accumulator: Design and application
inferred← citeshttps://doi.org/10.1016/j.cviu.2014.07.001openalex-snapshot
On the family of shortest isothetic paths in a digital object—An algorithm with applications
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.031openalex-snapshot
Phylogenetic graph models beyond trees
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.016openalex-snapshot
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.021openalex-snapshot
Facility location problems: A parameterized view
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.016openalex-snapshot
Kernelization hardness of connectivity problems in d -degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.007openalex-snapshot
On the approximability and exact algorithms for vector domination and related problems in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.002openalex-snapshot
Fixed-parameter algorithms for DAG Partitioning
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.002openalex-snapshot
Structural parameters, tight bounds, and approximation for ( k , r ) -center
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.024openalex-snapshot
The Gowers U3 norm of one family of cubic power permutations
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114420openalex-snapshot
Multigraph edge-coloring with local list sizes
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.10.001openalex-snapshot
Lower bounds on kernelization
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.04.001openalex-snapshot
On the complexity of submodular function minimisation on diamonds
inferred← citeshttps://doi.org/10.1016/j.dsp.2013.10.018openalex-snapshot
Efficient algorithms for computing the new Mersenne number transform
inferred← citeshttps://doi.org/10.1016/j.ecolecon.2011.04.016openalex-snapshot
Game theory and climate diplomacy
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104163openalex-snapshot
Comparing width parameters on graph classes
showing the first 200 of 582 · page through all 582
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.