| Publication | Date of Publication | Type |
|---|
Non-commutative optimization - where algebra, analysis and computational complexity meet
| 2025-01-17 | Paper |
Robustly self-ordered graphs: constructions and applications to property testing
TheoretiCS | 2024-06-27 | Paper |
Interactions of computational complexity theory and mathematics
International Congress of Mathematicians | 2024-03-20 | Paper |
Good permutation codes based on the shuffle-exchange network
Israel Journal of Mathematics | 2023-10-23 | Paper |
Connections between graphs and matrix spaces
Israel Journal of Mathematics | 2023-10-12 | Paper |
scientific article; zbMATH DE number 7711614 (Why is no real title available?)
| 2023-07-12 | Paper |
On the power and limitations of branch and cut
| 2023-07-12 | Paper |
Robustly self-ordered graphs: constructions and applications to property testing
| 2023-07-12 | Paper |
On linear-algebraic notions of expansion
| 2022-12-26 | Paper |
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
| 2022-09-14 | Paper |
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
Lecture Notes in Computer Science | 2022-08-30 | Paper |
The complexity of graph connectivity
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
An Optimal "It Ain't Over Till It's Over" Theorem
| 2022-08-06 | Paper |
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7471587 (Why is no real title available?)
Theory of Computing | 2022-02-09 | Paper |
Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties)
Journal für die Reine und Angewandte Mathematik | 2021-12-01 | Paper |
The uncertainty principle: Variations on a theme
Bulletin of the American Mathematical Society | 2021-03-17 | Paper |
Subspace arrangements, graph rigidity and derandomization through submodular optimization
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
Spanoids -- an abstraction of spanning structures, and a barrier for LCCs
SIAM Journal on Computing | 2020-05-28 | Paper |
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
| 2019-10-02 | Paper |
Prediction from partial information and hindsight, with application to circuit lower bounds
Computational Complexity | 2019-07-10 | Paper |
More barriers for rank methods, via a "numeric to symbolic" transfer
| 2019-04-08 | Paper |
Mathematics and computation. A theory revolutionizing technology and science
| 2018-11-09 | Paper |
Explicit Capacity Approaching Coding for Interactive Communication
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Local expanders
Computational Complexity | 2018-08-03 | Paper |
Towards optimal deterministic coding for interactive communication
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
Geometric and Functional Analysis. GAFA | 2018-04-25 | Paper |
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes
| 2018-04-12 | Paper |
Teaching and Compressing for Low VC-Dimension
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
On randomness extraction in \({\mathcal{AC}}^0\)
| 2018-01-24 | Paper |
Superquadratic lower bound for 3-query locally correctable codes over the reals
Theory of Computing | 2017-11-14 | Paper |
Proof complexity lower bounds from algebraic circuit complexity
| 2017-10-10 | Paper |
scientific article; zbMATH DE number 6789278 (Why is no real title available?)
| 2017-10-10 | Paper |
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Reed–Muller Codes for Random Erasures and Errors
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Symmetric LDPC codes and local testing
Combinatorica | 2017-03-31 | Paper |
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
SIAM Journal on Computing | 2017-03-10 | Paper |
Restriction access
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Short proofs are narrow -- resolution made simple
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Pseudorandomness for network algorithms
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Book review of: S. Aaronson, Quantum computing since Democritus
Notices of the American Mathematical Society | 2016-06-15 | Paper |
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Population recovery and partial identification
Machine Learning | 2016-03-09 | Paper |
Non-commutative arithmetic circuits with division
Theory of Computing | 2016-02-02 | Paper |
Algebrization: a new barrier in complexity theory
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Sum-of-squares Lower Bounds for Planted Clique
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Reed-Muller codes for random erasures and errors
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Breaking the quadratic barrier for 3-LCC's over the reals
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On derandomizing algorithms that err extremely rarely
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Characterizing non-deterministic circuit size
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Expanders that beat the eigenvalue bound
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
New direct-product testers and \(2\)-query PCPs
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Randomness -- a computational complexity perspective
XVIIth International Congress on Mathematical Physics | 2014-11-11 | Paper |
Extractors and pseudo-random generators with optimal seed length
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Space complexity in propositional calculus
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Improved rank bounds for design matrices and a new proof of Kelly's theorem
Forum of Mathematics, Sigma | 2014-09-01 | Paper |
Sylvester-Gallai type theorems for approximate collinearity
Forum of Mathematics, Sigma | 2014-09-01 | Paper |
Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Fractional Sylvester–Gallai theorems
Proceedings of the National Academy of Sciences | 2014-07-25 | Paper |
Linear Systems over Composite Moduli
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Partial derivatives in arithmetic complexity and beyond
Foundations and Trends in Theoretical Computer Science | 2014-01-15 | Paper |
The Gödel phenomenon in mathematics: a modern view
| 2013-10-29 | Paper |
Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique
| 2013-07-29 | Paper |
New direct-product testers and 2-query PCPs
SIAM Journal on Computing | 2013-03-19 | Paper |
An asymptotic bound on the composition number of integer sums of squares formulas
Canadian Mathematical Bulletin | 2013-03-07 | Paper |
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
Annals of Mathematics. Second Series | 2013-01-03 | Paper |
Randomness extractors -- applications and constructions
| 2012-10-24 | Paper |
Kakeya sets, new mergers, and old extractors
SIAM Journal on Computing | 2011-10-18 | Paper |
On the Circuit Complexity of Perfect Hashing
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 2011-08-19 | Paper |
Simplified derandomization of BPP using a hitting set generator
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 2011-08-19 | Paper |
On Yao's XOR-lemma
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 2011-08-19 | Paper |
Non-commutative circuits and the sum-of-squares problem
Journal of the American Mathematical Society | 2011-06-27 | Paper |
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
Theory of Computing | 2011-05-24 | Paper |
Iterative construction of Cayley expander graphs
Theory of Computing | 2011-05-24 | Paper |
The randomized communication complexity of set disjointness
Theory of Computing | 2011-05-24 | Paper |
Norms, XOR lemmas, and lower bounds for polynomials and protocols
Theory of Computing | 2011-05-24 | Paper |
Monotone expanders: constructions and applications
Theory of Computing | 2011-05-24 | Paper |
One-way multiparty communication lower bound for pointer jumping with applications
Combinatorica | 2011-04-26 | Paper |
Extractors and rank extractors for polynomial sources
Computational Complexity | 2011-02-18 | Paper |
Symmetric LDPC codes and local testing
Property Testing | 2010-10-12 | Paper |
Uniform direct product theorems: simplified, optimized, and derandomized
SIAM Journal on Computing | 2010-09-06 | Paper |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Extractors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Simulating independence
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Depth through breadth, or why should we attend talks in other areas?
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Derandomizing homomorphism testing in general groups
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
A new family of Cayley expanders (?)
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Expanders from symmetric codes
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Randomness conductors and constant-degree lossless expanders
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
Journal of the ACM | 2010-07-14 | Paper |
Computational analogues of entropy
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Towards a Study of Low-Complexity Graphs
Automata, Languages and Programming | 2009-07-14 | Paper |
scientific article; zbMATH DE number 5485571 (Why is no real title available?)
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485587 (Why is no real title available?)
| 2009-01-05 | Paper |
Neighborly embedded manifolds
Discrete & Computational Geometry | 2008-12-02 | Paper |
Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals
Lecture Notes in Computer Science | 2008-11-27 | Paper |
The Power and Weakness of Randomness in Computation
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Pairwise Independence and Derandomization
Foundations and Trends® in Theoretical Computer Science | 2008-09-01 | Paper |
Expander graphs and their applications
Bulletin of the American Mathematical Society | 2008-07-21 | Paper |
Randomness – A Computational Complexity Perspective
Computer Science – Theory and Applications | 2008-06-05 | Paper |
An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
Journal of the ACM | 2008-05-05 | Paper |
A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
Computational Complexity | 2007-11-14 | Paper |
\({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
| 2007-10-24 | Paper |
Derandomizing Homomorphism Testing in General Groups
SIAM Journal on Computing | 2007-09-07 | Paper |
Extracting Randomness Using Few Independent Sources
SIAM Journal on Computing | 2007-09-07 | Paper |
Robust Local Testability of Tensor Products of LDPC Codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Reducing the seed length in the Nisan-Wigderson generator
Combinatorica | 2007-05-08 | Paper |
Pairwise independence and derandomization.
| 2007-01-04 | Paper |
Extracting Randomness via Repeated Condensing
SIAM Journal on Computing | 2006-06-01 | Paper |
Expanders in group algebras
Combinatorica | 2006-01-26 | Paper |
Near optimal seperation of tree-like and general resolution
Combinatorica | 2005-07-05 | Paper |
Pseudorandom Generators in Propositional Proof Complexity
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2134901 (Why is no real title available?)
| 2005-02-18 | Paper |
scientific article; zbMATH DE number 2115041 (Why is no real title available?)
| 2004-11-11 | Paper |
scientific article; zbMATH DE number 1775389 (Why is no real title available?)
| 2004-01-27 | Paper |
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing | 2004-01-08 | Paper |
scientific article; zbMATH DE number 2019628 (Why is no real title available?)
| 2003-12-17 | Paper |
scientific article; zbMATH DE number 2019636 (Why is no real title available?)
| 2003-12-17 | Paper |
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus
Combinatorica | 2003-12-14 | Paper |
On interactive proofs with a laconic prover
Computational Complexity | 2003-11-17 | Paper |
Short proofs are narrow—resolution made simple
Journal of the ACM | 2003-06-25 | Paper |
In search of an easy witness: Exponential time vs. probabilistic polynomial time.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms | 2003-04-03 | Paper |
Entropy waves, the zig-zag graph product, and new constant-degree expanders
Annals of Mathematics. Second Series | 2002-10-13 | Paper |
Space Complexity in Propositional Calculus
SIAM Journal on Computing | 2002-09-29 | Paper |
scientific article; zbMATH DE number 1775454 (Why is no real title available?)
| 2002-09-17 | Paper |
Randomness vs time: Derandomization under a uniform assumption
Journal of Computer and System Sciences | 2002-07-04 | Paper |
scientific article; zbMATH DE number 1754603 (Why is no real title available?)
| 2002-06-12 | Paper |
Depth-3 arithmetic circuits over fields of characteristic zero
Computational Complexity | 2002-02-28 | Paper |
scientific article; zbMATH DE number 1263186 (Why is no real title available?)
| 2001-08-27 | Paper |
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Combinatorica | 2001-06-13 | Paper |
scientific article; zbMATH DE number 1559594 (Why is no real title available?)
| 2001-03-01 | Paper |
scientific article; zbMATH DE number 1559538 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1559537 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1559552 (Why is no real title available?)
| 2001-02-28 | Paper |
Superpolynomial lower bounds for monotone span programs
Combinatorica | 2000-05-14 | Paper |
Expanders that beat the eigenvalue bound: Explicit construction and applications
Combinatorica | 1999-12-08 | Paper |
scientific article; zbMATH DE number 1261803 (Why is no real title available?)
| 1999-08-31 | Paper |
scientific article; zbMATH DE number 1256666 (Why is no real title available?)
| 1999-08-17 | Paper |
scientific article; zbMATH DE number 1256780 (Why is no real title available?)
| 1999-07-05 | Paper |
scientific article; zbMATH DE number 1256637 (Why is no real title available?)
| 1999-04-22 | Paper |
Techniques for bounding the convergence rate of genetic algorithms
| 1999-03-30 | Paper |
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences | 1999-01-06 | Paper |
Tiny families of functions with random properties: A quality-size trade-off for hashing
| 1998-07-19 | Paper |
Lower bounds on arithmetic circuits via partial derivatives
Computational Complexity | 1998-06-11 | Paper |
On the Power of Finite Automata with both Nondeterministic and Probabilistic States
SIAM Journal on Computing | 1998-05-10 | Paper |
scientific article; zbMATH DE number 1031002 (Why is no real title available?)
| 1997-07-06 | Paper |
The Tree Model for Hashing: Lower and Upper Bounds
SIAM Journal on Computing | 1997-03-25 | Paper |
A method for obtaining randomized algorithms with small tail probabilities
Algorithmica | 1997-03-03 | Paper |
Super-logarithmic depth lower bounds via the direct sum in communication complexity
Computational Complexity | 1996-11-10 | Paper |
Boolean complexity classes vs. their arithmetic analogs
| 1996-10-07 | Paper |
On rank vs. communication complexity
Combinatorica | 1996-09-15 | Paper |
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
SIAM Journal on Discrete Mathematics | 1996-07-02 | Paper |
Search Problems in the Decision Tree Model
SIAM Journal on Discrete Mathematics | 1995-08-06 | Paper |
Derandomized graph products
Computational Complexity | 1995-07-16 | Paper |
On the second eigenvalue of hypergraphs
Combinatorica | 1995-05-04 | Paper |
scientific article; zbMATH DE number 1263251 (Why is no real title available?)
| 1995-01-01 | Paper |
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
Journal of the ACM | 1994-11-24 | Paper |
Constructing Small Sets that are Uniform in Arithmetic Progressions
Combinatorics, Probability and Computing | 1994-11-20 | Paper |
scientific article; zbMATH DE number 524142 (Why is no real title available?)
| 1994-11-13 | Paper |
Hardness vs randomness
Journal of Computer and System Sciences | 1994-11-06 | Paper |
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences | 1994-11-06 | Paper |
Monotone circuits for matching require linear depth
Journal of the ACM | 1994-08-21 | Paper |
\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
Computational Complexity | 1994-05-08 | Paper |
scientific article; zbMATH DE number 549856 (Why is no real title available?)
| 1994-04-12 | Paper |
Combinatorial characterization of read-once formulae
Discrete Mathematics | 1993-10-24 | Paper |
Randomized vs. deterministic decision tree complexity for read-once Boolean functions
Computational Complexity | 1993-10-10 | Paper |
Universal traversal sequences for expander graphs
Information Processing Letters | 1993-08-08 | Paper |
\(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
Information Processing Letters | 1993-06-29 | Paper |
On read-once threshold formulae and their randomized decision tree complexity
Theoretical Computer Science | 1993-05-16 | Paper |
Rounds in Communication Complexity Revisited
SIAM Journal on Computing | 1993-05-16 | Paper |
Geometric medians
Discrete Mathematics | 1993-01-17 | Paper |
scientific article; zbMATH DE number 66621 (Why is no real title available?)
| 1992-09-27 | Paper |
Linear-size constant-depth polylog-threshold circuits
Information Processing Letters | 1992-06-27 | Paper |
A lower bound on the area of permutation layouts
Algorithmica | 1991-01-01 | Paper |
Toward Understanding Exclusive Read
SIAM Journal on Computing | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4195163 (Why is no real title available?)
| 1990-01-01 | Paper |
Monotone Circuits for Connectivity Require Super-Logarithmic Depth
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Linear Circuits over $\operatorname{GF}(2)$
SIAM Journal on Computing | 1990-01-01 | Paper |
On computations with integer division
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
The complexity of parallel search
Journal of Computer and System Sciences | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4072374 (Why is no real title available?)
| 1988-01-01 | Paper |
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
The Discrete Logarithm Hides $O(\log n)$ Bits
SIAM Journal on Computing | 1988-01-01 | Paper |
Rubber bands, convex embeddings and graph connectivity
Combinatorica | 1988-01-01 | Paper |
Simulations among concurrent-write PRAMs
Algorithmica | 1988-01-01 | Paper |
Relations between Concurrent-Write Models of Parallel Computation
SIAM Journal on Computing | 1988-01-01 | Paper |
A tradeoff between search and update time for the implicit dictionary problem
Theoretical Computer Science | 1988-01-01 | Paper |
A Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4037759 (Why is no real title available?)
| 1987-01-01 | Paper |
The Complexity of Parallel Sorting
SIAM Journal on Computing | 1987-01-01 | Paper |
How to share memory in a distributed system
Journal of the ACM | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3980480 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3956454 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3999326 (Why is no real title available?)
| 1986-01-01 | Paper |
Constructing a perfect matching is in random NC
Combinatorica | 1986-01-01 | Paper |
A fast parallel algorithm for the maximal independent set problem
Journal of the ACM | 1985-01-01 | Paper |
Rectilinear Graphs and Their Embeddings
SIAM Journal on Computing | 1985-01-01 | Paper |
Trade-Offs between Depth and Width in Parallel Computation
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3856986 (Why is no real title available?)
| 1983-01-01 | Paper |
Succinct representations of graphs
Information and Control | 1983-01-01 | Paper |
Improving the performance guarantee for approximate graph coloring
Journal of the ACM | 1983-01-01 | Paper |
