| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Venkatesan Guruswami, Srivatsan Narayanan |
Combinatorial limitations of a strong form of list decoding.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Chaoping Xing |
Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Chaoping Xing |
Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou |
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Srivatsan Narayanan, Carol Wang |
List decoding subspace codes from insertions and deletions |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Srivatsan Narayanan |
Combinatorial limitations of a strong form of list decoding |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
Bypassing UGC from some optimal geometric inapproximability results. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou |
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Optimal column-based low-rank matrix reconstruction. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Srivatsan Narayanan, Carol Wang |
List decoding subspace codes from insertions and deletions. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Chaoping Xing |
Folded codes from function field towers and improved optimal rate list decoding. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amit Chakrabarti, Venkatesan Guruswami, Andrew Wirth, Anthony Wirth |
The query complexity of estimating weighted averages. |
Acta Inf. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Linear-algebraic list decoding of folded Reed-Solomon codes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou |
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Optimal Column-Based Low-Rank Matrix Reconstruction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Carol Wang |
Optimal rate list decoding via derivative codes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Hardness amplification within NP against deterministic algorithms. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Yuan Zhou |
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Carol Wang |
Optimal Rate List Decoding via Derivative Codes. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou |
Finding Almost-Perfect Graph Bisections. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Linear-Algebraic List Decoding of Folded Reed-Solomon Codes. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces is Hard. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
Bypassing UGC from some optimal geometric inapproximability results. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Yuan Zhou |
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Adam Smith |
Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, James R. Lee, Alexander A. Razborov |
Almost Euclidean subspaces of l 1N VIA expander codes. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang |
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Adam Smith |
Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces is Hard |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the List-Decodability of Random Linear Codes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
The existence of concatenated codes list-decodable up to the hamming bound. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Salil P. Vadhan |
A Lower Bound on List Size for List Decoding. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu |
SDP Gaps for 2-to-1 and Other Label-Cover Variants. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Rishi Saket |
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Adam Smith |
Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Swastik Kopparty |
On the list-decodability of random linear codes. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Error correction up to the information-theoretic limit. |
Commun. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
error-correcting codes, Expander graphs, condensers, list decoding, randomness extractors |
| 1 | Venkatesan Guruswami, Adam Smith |
Explicit Capacity-achieving Codes for Worst-Case Additive Errors |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Hardness of Learning Halfspaces with Noise. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Better Binary List Decodable Codes Via Multilevel Concatenation. |
IEEE Transactions on Information Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
List Decoding of Binary Codes-A Brief Survey of Some Recent Results. |
IWCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Ali Kemal Sinop |
Improved Inapproximability Results for Maximum k-Colorable Subgraph. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
Agnostic Learning of Monomials by Halfspaces Is Hard. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Hardness of Learning, Dictatorship Tests, PCPs, Agnostic Learning |
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran |
Every Permutation CSP of arity 3 is Approximation Resistant. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
cyclotomic function fields, frobenius automorphism, galois extensions, list decoding capacity, error-correcting codes, algebraic-geometric codes |
| 1 | MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami |
MaxMin allocation via degree lower-bounded arborescences. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, graphs, lift-and-project |
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List decoding tensor products and interleaved codes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products |
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Concatenated codes can achieve list-decoding capacity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Soft decoding, dual BCH codes, and better list-decodable eps-biased codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton |
Algorithms for Modular Counting of Roots of Multivariate Polynomials. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Modular counting, Polynomials, Reed-Solomon codes |
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification via Space-Efficient Direct Products. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17 |
| 1 | Venkatesan Guruswami |
Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List Decoding Tensor Products and Interleaved Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Anindya C. Patthak |
Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets. |
Math. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Decoding Reed-Solomon Codes. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Concatenated codes can achieve list-decoding capacity. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, James R. Lee, Alexander A. Razborov |
Almost Euclidean subspaces of lN1 via expander codes. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
List Error-Correction with Optimal Information Rate (Invited Talk). |
ICITS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Widad Machmouchi |
Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, James R. Lee, Avi Wigderson |
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra |
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Hardness Amplification within NP against Deterministic Algorithms. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Hardness Amplication, Error-Correcting Codes, Derandomization, NP |
| 1 | Venkatesan Guruswami, Atri Rudra |
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, James R. Lee, Alexander A. Razborov |
Almost Euclidean subspaces of $\ell_1^N$ via expander codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Better Binary List-Decodable Codes via Multilevel Concatenation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang |
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Venkatesan Guruswami |
Deterministic Hardness Amplification via Local GMD Decoding. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan |
Guessing secrets efficiently via list decoding. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
?-biased spaces, 20 questions, k-universal sets, error-correcting codes, decoding algorithms |
| 1 | Venkatesan Guruswami, Valentine Kabanets |
Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
List Decoding and Pseudorandom Constructions. |
AAECC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Atri Rudra |
Better Binary List-Decodable Codes Via Multilevel Concatenation. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, expander graphs, condensers, list decoding, randomness extractors |
| 1 | Venkatesan Guruswami, Prasad Raghavendra |
A 3-query PCP over integers. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
sparse linear equations, hardness of approximation, probabilistically checkable proofs, linearity testing |
| 1 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 1 | Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan |
Extractors and condensers from univariate polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")