yusuke1997/dblp-id-title huggingface dataset:
High entropy secrecy generation from wireless CIR
Smart antenna spatial sweeping for combined directionality and transmit diversity
Butterfly Log-MAP decoding algorithm
DMRUT-MCDS: Discovery relationships in the cyber-physical integrated network
Architectures and connection probabilities for wireless ad hoc and hybrid communication networks
Joint association and resource allocation for multi-hop integrated access and backhaul (IAB) network
Inter-cell interference management for next-generation wireless communication systems
cdma2000 physical layer: An overview
Steiner tree compilation of multicast under differentiated services constraints
Throughput-delay analysis of one-to-many wireless multi-hop flows based on random linear network coding
In-vehicle network latency analysis for a lane keeping assistance system
Collaborative attributes and resources for single-stage virtual network mapping in network virtualization
Improving user satisfaction in adaptive multicast video
Efficient implementations of a delay-constrained least-cost multicast algorithm
Tight bounds and invertible average error probability expressions over composite fading channels
Mobility management requirements and framework for systems beyond IMT-2000
Construction of multiple-rate quasi-cyclic LDPC codes via the hyperplane decomposing
Cross-layer resource allocation with multipath routing in wireless multihop and multichannel systems
Soft decision differential phase detection with Viterbi decoding in satellite mobile systems
A novel optimization-based approach for minimum power multicast in wireless networks
Lightpaths routing for single link failure survivability in IP-over-WDM networks
A searching algorithm for minimum bandpass sampling frequency in simultaneous down-conversion of multiple RF signals
Flow-aware link dimensioning for guaranteed-QoS services in broadband convergence networks
Dynamically adaptable mobile agents for scaleable software and service management
New Locally Decodable Codes and Private Information Retrieval Schemes
High dimensional expanders imply agreement expanders
On one lower bound for branching programs
The Rate-Immediacy Barrier in Explicit Tree Code Constructions
Depth-reduction for composites
Eigenvalue Bounds for Symmetric Markov Chains on Multislices With Applications
Undirected ST-Connectivity in Log-Space
Perfect Bipartite Matching in Pseudo-Deterministic RNC
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Efficient List-Decoding with Constant Alphabet and List Sizes
Tractable Constraint Satisfaction Problems on a 3-element set
SOS is not obviously automatizable, even approximately
A Note On the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits
On the role of private coins in unbounded-round Information Complexity
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers
Pseudorandom bits for polynomials
Improved Algorithms for Unique Games via Divide and Conquer
Lower Bounds for Circuits with Few Modular Gates using Exponential Sums
Making RAMs Oblivious Requires Superlogarithmic Overhead
Isolation Lemma for Directed Reachability and NL vs. L
A note on the hardness of the characteristic polynomial
Interactive Coding Over the Noisy Broadcast Channel
On a special case of rigidity
On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors
The density of weights of Generalized Reed-Muller codes
Characterizing the Power of (Persistent) Randomness in Log-space
On Annihilators of Explicit Polynomial Maps
Lower bounds for myopic DPLL algorithms with a cut heuristic
Rational degree is polynomially related to degree
Nonuniform catalytic space and the direct sum for space
Small Set Expansion in The Johnson Graph
Additively efficient universal computers
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False
Testing local properties of arrays
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
On the entropy of a noisy function
Separating RAM and Multitape Turing Machines with Short Random Oracles
A tutorial on the Deterministic two-party Communication Complexity
Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP
Randomness Extractors in $\mathrm{AC}^0$ and $\mathrm{NC}^1$: Optimal up to Constant Factors
On Local versus Global Satisfiability
Cell-Probe Lower Bounds for Prefix Sums
Locally Correctable and Testable Codes Approaching the Singleton Bound
A Lower Bound for Relaxed Locally Decodable Codes
A note on the relation between XOR and Selective XOR Lemmas
The nonprobabilistic approach to learning the best prediction
Average-Case Complexity Theory of Approximation Problems
Public-Key Encryption from Continuous LWE
Complexity Theory and Genetics (extended abstract)
Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey
Does QRAT simulate IR-calc? QRAT simulation algorithm for $\forall$Exp+Res cannot be lifted to IR-calc
Linear Matroid Intersection is in Catalytic Logspace
Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization
Magic coins are useful for small-space quantum machines
Symmetric Systems of Linear Equations modulo p
Indivisible Markets with Good Approximate EquilibriumPrices
Linear and Sublinear Time Algorithms for the Basis of Abelian Groups
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations
Exponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity
Parameterized Algorithms for Hitting Set: the Weighted Case
Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product
Integer Circuit Evaluation is PSPACE-complete
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games
Bridging between 0/1 and Linear Programming via Random Walks
A Simple Model for Neural Computation with Firing Rates and Firing Correlations
Consistency of circuit lower bounds with bounded theories
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized
Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion
Deterministic Amplification of Space Bounded Probabilistic Algorithms
A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction
Improved Resolution Lower Bounds for the Weak Pigeonhole Principle
The one-way communication complexity of the Boolean Hidden Matching Problem
On the randomness complexity of property testing
Derandomization that is rarely wrong from short advice that is typically good
On doubly-sublinear interactive proofs for distributions
Extractors for small zero-fixing sources
On the power of homogeneous depth 4 arithmetic circuits
Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK
Failure of Feasible Disjunction Property for $k$-DNF Resolution and NP-hardness of Automating It
Prediction from Partial Information and Hindsight, an Alternative Proof
Simultaneous Max-Cut is harder to approximate than Max-Cut
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems
On Approximation Hardness of Dense TSP and other Path Problems
A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata
Improved bounds on Fourier entropy and Min-entropy
On SZK and PP
Schemes for Deterministic Polynomial Factoring
On Some Tighter Inapproximability Results
Hyperdeterminants are hard in four dimensions
On the Complexity of Group Isomorphism
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture
A Super-Grover Separation Between Randomized and Quantum Query Complexities
Three-Player Games Are Hard
Improved Algorithms for Optimal Embeddings
On the Security of Server aided RSA protocols
An Õ(n) Queries Adaptive Tester for Unateness
Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Hardness of Time-Bounded Kolmogorov Complexity
On Learning Correlated Boolean Functions Using Statistical Query
Degree and Sensitivity: tails of two distributions
Holographic Algorithms: From Art to Science
Improved local testing for multiplicity codes
Sum-of-squares hierarchy lower bounds for symmetric formulations
From Laconic Zero-Knowledge to Public-Key Cryptography
A note on the real $\tau$-conjecture and the distribution of roots
Lower bounds for matrix product
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
Explicit and structured sum of squares lower bounds from high dimensional expanders
Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy
Resolution complexity of perfect mathcing principles for sparse graphs
Partial Minimum Branching Program Size Problem is ETH-hard
Defying Dimensions Modulo 6
Simulating Cutting Plane proofs with restricted degree of falsity by Resolution
Parallel Read Operations Without Memory Contention
On Rigid Matrices and Subspace Polynomials
No-Signaling MIPs and Faster-Than-Light Communication, Revisited
AC0 unpredictability
List-Decoding Random Walk XOR Codes Near the Johnson Bound
New separation between s(f) and bs(f)
Towards blackbox identity testing of log-variate circuits
Lower Bounds for Depth Three Arithmetic Circuits with small bottom fanin
$BPL\subseteq L-AC^1$
On the Power of Unambiguity in Logspace
Location-Invariant Properties of Functions versus Properties of Distributions: United in Testing but Separated in Verification
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
Some Applications of Coding Theory in Computational Complexity
On reducibility and symmetry of disjoint NP-pairs
Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems
The shifted partial derivative complexity of Elementary Symmetric Polynomials
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $\ell_p$-metrics
Hard Languages in $\text{NP}\cap\text{coNP}$ and NIZK Proofs from Unstructured Hardness
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
Simulating Quantum Circuits with Sparse Output Distributions
List-decoding in Linear Time
Inequalities and tail bounds for elementary symmetric polynomials
Approximating the best Nash Equilibrium in n o(log n) -time breaks the Exponential Time Hypothesis
A stronger bound for linear 3-LCC
Succinct and explicit circuits for sorting and connectivity
NP Search Problems
A unified framework for analyzing security of protocols
Almost Cubic Bound for Depth Three Circuits in VP
NP-Hard Sets are Exponentially Dense Unless NP is contained in coNP/poly
Approximating Boolean functions with depth-2 circuits
Learning Polynomials with Queries - The Highly Noisy Case
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
Randomness-efficient Curve Samplers
The Myth of the Folk Theorem
Algebra in Algorithmic Coding Theory
Dense locally testable codes cannot have constant rate and distance
Non-Malleable Coding Against Bit-wise and Split-State Tampering
Note On the Computational Complexity of j-Radii of Polytopes in R n
FIFO is Unstable at Arbitrarily Low Rates
A moment ratio bound for polynomials and some extremal properties of Krawchouk polynomials and Hamming spheres
Algebraic Proof Complexity: Progress, Frontiers and Challenges
Implicit Simulation of FNC Algorithms
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
Near-Optimal Separation of Treelike and General Resolution
(Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids
Resolution Lower Bounds for the Weak Functional Pigeonhole Principle
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity
Exponential Lower Bound for 2-Query Locally Decodable Codes
Algorithms for the Coin Weighing Problems with the Presence of Noise
Searching Randomly for Maximum Matchings
If VNP is hard, then so are equations for it
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time
One-way Functions and Partial MCSP
Towards An Optimal Query Efficient PCP?
On the doubly-efficient interactive proof systems of GKR
An Overview of Non-Uniform Parameterized Complexity
Majority is incompressible by AC 0 [p] circuits
Quantum hardness of learning shallow classical circuits
The Importance of Being Biased
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom
Building above read-once polynomials: identity testing and hardness of representation
Distribution Free Evolvability of Polynomial Functions over all Convex Loss Functions
On Approximately Fair Cost Allocation in Euclidean TSP Games
A Note On the Universality of Black-box MKtP Solvers
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier
Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
On the correlation of parity and small-depth circuits
Sampling Permutations with Cell Probes is Hard
Hitting Properties of Hard Boolean Operators and their Consequences on BPP
Lattice Variant of the Sensitivity Conjecture
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive
2-D Tucker is PPA complete
Functions Computable in Polynomial Space
Inverse Conjecture for the Gowers norm is false
Almost Euclidean subspaces of ℓ 1 N via expander codes
Polynomial calculus space and resolution width
Synergies Between Complexity Theory and Nondeterministic Kolmogorov Complexity
Fundamentals of Fully Homomorphic Encryption - A Survey
Hierarchies within TFNP: building blocks and collapses
Space Hierarchy Results for Randomized and Other Semantic Models
An average-case depth hierarchy theorem for Boolean circuits
Fooling Constant-Depth Threshold Circuits
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
The hardness of decision tree complexity
IP = PSPACE using Error Correcting Codes
Strong XOR Lemma for Communication with Bounded Rounds
A Survey on Distribution Testing: Your Data is Big. But is it Blue?
On Approximability of Satisfiable k-CSPs: VII
One-Round Multi-Party Communication Complexity of Distinguishing Sums
Testing probability distributions underlying aggregated data
$LS_+$ Lower Bounds from Pairwise Independence
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions
A subquadratic upper bound on sum-of-squares compostion formulas
Preferred representations of Boolean relations
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits
Random (log n)-CNF are Hard for Cutting Planes (Again)
Computations beyond Exponentiation Gates and Applications
Efficiently Coding for Interactive Communication
Labeling the complete bipartite graph with no zero cycles
On the approximation method and the P versus NP problem
An Average-Case Optimal One-Variable Pattern Language Learner
Constructing Near Spanning Trees with Few Local Inspections
Distributed Simulation and Distributed Inference
Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes
On Symmetric Parallel Repetition : Towards Equivalence of MAX-CUT and UG
Linear systems over abelian groups
On the impossibility of entropy reversal, and its application to zero-knowledge proofs
Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation
The Chasm at Depth Four, and Tensor Rank : Old results, new insights
The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices
Identity Testing for constant-width, and commutative, read-once oblivious ABPs
Does robustness imply tractability? A lower bound for planted clique in the semi-random model
Arithmetic circuit classes over Zm
One Clean Qubit Suffices for Quantum Communication Advantage
Lower Bound for Non-Adaptive Estimate the Number of Defective Items
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs
Computing with a full memory: Catalytic space
Subspace Designs based on Algebraic Function Fields
Optimal Resilience for Short-Circuit Noise in Formulas
Bounded-depth circuits cannot sample good codes
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes
A probabilistic nonequivalence test for syntactic (1,+k)-branching programs
Cops-Robber games and the resolution of Tseitin formulas
Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees
Two Theorems in List Decoding
Optimally Resilient Codes for List-Decoding from Insertions and Deletions
On Finer Separations between Subclasses of Read-once Oblivious ABPs
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees
The influence lower bound via query elimination
Promise Hierarchies
Classification of the streaming approximability of Boolean CSPs
On the Security of Modular Exponentiation
Local Reconstruction of Low-Rank Matrices and Subspaces
Efficient reconstruction of depth three circuits with top fan-in two
Polynomial-Time Maximisation Classes: Syntactic Hierarchy
Exponential Lower Bounds for Semantic Resolution
On the Query Complexity of Selecting Few Minimal Sets
Efficient Black-Box Identity Testing for Free Group Algebra
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits
Geometric Approach for Optimal Routing on Mesh with Buses
Characterizing Small Depth and Small Space Classes by Operators of Higher Types
On The Hardness of Approximating Max-Satisfy
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
On isoperimetric profiles and computational complexity
New bounds on the half-duplex communication complexity
Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications
Computing Bounded Path Decompositions in Logspace
Mixing of 3-term progressions in Quasirandom Groups
Impossibility of Succinct Quantum Proofs for Collision-Freeness
Resource Tradeoffs and Derandomization
On the usefulness of Promises
Comparing computational entropies below majority (or: When is the dense model theorem false?)
Amplification and Derandomization Without Slowdown
New Lower Bounds for Matching Vector Codes
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis
Improved decoding of Folded Reed-Solomon and Multiplicity Codes
On optimal proof systems and logics for PTIME
Half-duplex communication complexity
An Entropy Lower Bound for Non-Malleable Extractors
Streaming and Sketching Complexity of CSPs: A survey
Networks of Spiking Neurons: The Third Generation of Neural Network Models
Smoothed Complexity of Learning Disjunctive Normal Forms, Inverting Fourier Transforms, and Verifying Small Circuits
On the Power of Quantum Fingerprinting
A lower bound on the quantum query complexity of read-once functions
New results on Noncommutative and Commutative Polynomial Identity Testing
Lecture Notes on Algorithmic Number Theory
Pseudorandomness when the odds are against you
On the expressive power of read-once determinants
Cell-Probe Lower Bounds from Online Communication Complexity
Structural and Computational Complexity of Isometries and their Shift Commutators
A Simplified Way of Proving Trade-off Results for Resolution
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel
From Irreducible Representations to Locally Decodable Codes
An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
Lower bounds for the circuit size of partially homogeneous polynomials
Natural Proofs
Strong ETH Holds for Bounded-Depth Resolution over Parities
On ℓ 4 : ℓ 2 ratio of functions with restricted Fourier support
Analyzing Ta-Shma's Code via the Expander Mixing Lemma
Negations Provide Strongly Exponential Savings
GF(2 n )-Linear Tests versus GF(2)-Linear Tests
Complexity Dichotomies of Counting Problems
A Combinatorial Consistency Lemma with application to the PCP Theorem
Randomized Quicksort and the Entropy of the Random Number Generator
Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Leakage-resilient non-malleable codes
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
On Block-wise Symmetric Signatures for Matchgates
Pseudodeterministic Constructions in Subexponential Time
A Candidate Counterexample to the Easy Cylinders Conjecture
Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization
Memory-Restricted Black-Box Complexity
Random Walks, Conditional Hitting Sets and Partial Derandomization
The Complexity of Public-Key Cryptograph
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs
Primal-Dual Approaches to the Steiner Problem
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits
Parameterized Complexity of First-Order Logic
The Many Entropies in One-Way Functions
Shadows of Newton polytopes
Lower Bounds on OBDD Proofs with Several Orders
The Final Nail in the Coffin of Statistically-Secure Obfuscator
Some Lower Bounds Related to the Missing String Problem
Simulation Methods in Communication Lower Bounds, Revisited
Pseudodistributions That Beat All Pseudorandom Generators
The splitting power of branching programs of bounded repetition and CNFs of bounded width
On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity
Improved bounds on the AN-complexity of multilinear functions
Equality Alone Does Not Simulate Randomness
Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols
Half-duplex communication complexity with adversary? can be less than the classical communication complexity
A Note on Las Vegas OBDDs
Multi- k -ic depth three circuit lower bound
Optimal Testing of Discrete Distributions with High Probability
AC 0 \circ MOD 2 lower bounds for the Boolean Inner Product
Robust testing of lifted codes with applications to low-degree testing
On one-way functions and the average time complexity of almost-optimal compression
Tolerant Property Testing and Distance Approximation
On the Robust Testability of Product of Codes
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity
Simple PCPs with Poly-log Rate and Query Complexity
k-SUM in the Sparse Regime
Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations
On Fortification of General Games
Enumerating Complexity Revisited
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension
$3$-Query RLDCs are Strictly Stronger than $3$-Query LDCs
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies
The New Complexity Landscape around Circuit Minimization
Exponentially improved algorithms and lower bounds for testing signed majorities
Classification of OBDD size for monotone 2-CNFs
The Price of Optimum in Stackelberg Games
Quasilinear time list-decodable codes for space bounded channels
On Extracting Randomness From Weak Random Sources
A proof of the GM-MDS conjecture
Strong Fooling Sets for Multi-Player Communication with Applications to Deterministic Estimation of Stream Statistics
Two-Sided Error Proximity Oblivious Testing
Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique