Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion (English)
Free access
- New search for: Ngo, Hung Q.
- New search for: Porat, Ely
- New search for: Rudra, Atri
- New search for: Ngo, Hung Q.
- New search for: Porat, Ely
- New search for: Rudra, Atri
- New search for: Dürr, Christoph
- New search for: Wilke, Thomas
In:
LIPIcs, Volume 14, STACS 2012
: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
;
14
;
230-241
;
2012
-
ISBN:
-
ISSN:
- Conference paper / Electronic Resource
-
Title:Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion
-
Contributors:Ngo, Hung Q. ( author ) / Porat, Ely ( author ) / Rudra, Atri ( author ) / Dürr, Christoph ( editor ) / Wilke, Thomas ( editor )
-
Published in:LIPIcs, Volume 14, STACS 2012 : 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012) ; 14 ; 230-241Leibniz International Proceedings in Informatics (LIPIcs) ; 14 ; 230-241
-
Publisher:
- New search for: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Publication date:2012-02-24
-
Size:12 pages , 661969 byte
-
Remarks:LIPIcs, Vol. 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), pages 230-241
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Conference paper
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Forms of Determinism for Automata (Invited Talk)Colcombet, Thomas et al. | 2012
- 2
-
Iterative Methods in Combinatorial Optimization (Invited Talk)Ravi, R. et al. | 2012
- 3
-
On Randomness in Hash Functions (Invited Talk)Dietzfelbinger, Martin et al. | 2012
- 4
-
Pseudo-deterministic Algorithms (Invited Talk)Goldwasser, Shafi et al. | 2012
- 5
-
13/9-approximation for Graphic TSPMucha, Marcin et al. | 2012
- 6
-
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systemsWard, Justin et al. | 2012
- 7
-
A Pumping Lemma for Pushdown Graphs of Any LevelParys, Pawel et al. | 2012
- 8
-
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic DepthElberfeld, Michael / Jakoby, Andreas / Tantau, Till et al. | 2012
- 9
-
An Approximation Algorithm for #k-SATThurley, Marc et al. | 2012
- 10
-
Asymptotic enumeration of Minimal AutomataBassino, Frédérique / David, Julien / Sportiello, Andrea et al. | 2012
- 11
-
Balanced Partitions of Trees and ApplicationsFeldmann, Andreas Emil / Foschini, Luca et al. | 2012
- 12
-
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set PropertyStølting Brodal, Gerth / Kejlberg-Rasmussen, Casper et al. | 2012
- 13
-
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and SimplifiedChung, Kai-Min / Lam, Henry / Liu, Zhenming / Mitzenmacher, Michael et al. | 2012
- 14
-
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)Jez, Artur et al. | 2012
- 15
-
Concurrency Makes Simple Theories HardGöller, Stefan / Widjaja Lin, Anthony et al. | 2012
- 16
-
Conflict-free Chromatic Art Gallery CoverageBärtschi, Andreas / Suri, Subhash et al. | 2012
- 17
-
Constant compression and random weightsMerkle, Wolfgang / Teutsch, Jason et al. | 2012
- 18
-
Contraction checking in graphs on surfacesKaminski, Marcin / Thilikos, Dimitrios M. et al. | 2012
- 19
-
Distribution of the number of accessible states in a random deterministic automatonCarayol, Arnaud / Nicaud, Cyril et al. | 2012
- 20
-
Edge-disjoint Odd Cycles in 4-edge-connected GraphsKawarabayashi, Ken-ichi / Kobayashi, Yusuke et al. | 2012
- 21
-
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in PDiekert, Volker / Laun, Jürn / Ushakov, Alexander et al. | 2012
- 22
-
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and RecursionNgo, Hung Q. / Porat, Ely / Rudra, Atri et al. | 2012
- 23
-
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degreeDurand-Gasselin, Antoine / Habermehl, Peter et al. | 2012
- 24
-
Improved Bounds for Bipartite Matching on SurfacesDatta, Samir / Gopalan, Arjun / Kulkarni, Raghav / Tewari, Raghunath et al. | 2012
- 25
-
Improved Spectral Sparsification and Numerical Algorithms for SDD MatricesKoutis, Ioannis / Levin, Alex / Peng, Richard et al. | 2012
- 26
-
Linear min-max relation between the treewidth of H-minor-free graphs and its largest gridKawarabayashi, Ken-ichi / Kobayashi, Yusuke et al. | 2012
- 27
-
Linear-Space Data Structures for Range Mode Query in ArraysChan, Timothy M. / Durocher, Stephane / Larsen, Kasper Green / Morrison, Jason / Wilkinson, Bryan T. et al. | 2012
- 28
-
Log-supermodular functions, functional clones and counting CSPsBulatov, Andrei A. / Dyer, Martin / Goldberg, Leslie Ann / Jerrum, Mark et al. | 2012
- 29
-
Low Randomness Rumor Spreading via HashingGiakkoupis, George / Sauerwald, Thomas / Sun, He / Woelfel, Philipp et al. | 2012
- 30
-
Lower Bounds on the Complexity of MSO_1 Model-CheckingGanian, Robert / Hlineny, Petr / Langer, Alexander / Obdržálek, Jan / Rossmanith, Peter / Sikdar, Somnath et al. | 2012
- 31
-
LP can be a cure for Parameterized ProblemsNarayanaswamy, N.S. / Raman, Venkatesh / Ramanujan, M.S. / Saurabh, Saket et al. | 2012
- 32
-
Mind Change Speed-up for Learning Languages from Positive DataJain, Sanjay / Kinber, Efim et al. | 2012
- 33
-
Monomials in arithmetic circuits: Complete problems in the counting hierarchyFournier, Hervé / Malod, Guillaume / Mengel, Stefan et al. | 2012
- 34
-
Motion planning with pulley, rope, and basketsEggermont, Christian E.J. / Woeginger, Gerhard J. et al. | 2012
- 35
-
On Computing Pareto Stable AssignmentsChen, Ning et al. | 2012
- 36
-
On the separation question for tree languagesArnold, André / Michalewski, Henryk / Niwinski, Damian et al. | 2012
- 37
-
On the treewidth and related parameters of random geometric graphsMitsche, Dieter / Perarnau, Guillem et al. | 2012
- 38
-
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of MutationWitt, Carsten et al. | 2012
- 39
-
Parameterized Complexity of Connected Even/Odd Subgraph ProblemsFomin, Fedor V. / Golovach, Petr A. et al. | 2012
- 40
-
Playing Mastermind With Constant-Size MemoryDoerr, Benjamin / Winzen, Carola et al. | 2012
- 41
-
Polynomial-time Isomorphism Test for Groups with Abelian Sylow TowersBabai, László / Qiao, Youming et al. | 2012
- 42
-
Preemptive and Non-Preemptive Generalized Min Sum Set CoverIm, Sungjin / Sviridenko, Maxim / van der Zwaan, Ruben et al. | 2012
- 43
-
Randomized Communication Complexity for Linear Algebra Problems over Finite FieldsSun, Xiaoming / Wang, Chengu et al. | 2012
- 44
-
Regular tree languages, cardinality predicates, and addition-invariant FOHarwath, Frederik / Schweikardt, Nicole et al. | 2012
- 45
-
Simpler Approximation of the Maximum Asymmetric Traveling Salesman ProblemPaluch, Katarzyna / Elbassioni, Khaled / van Zuylen, Anke et al. | 2012
- 46
-
Stabilization of Branching Queueing NetworksBrázdil, Tomáš / Kiefer, Stefan et al. | 2012
- 47
-
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity ClassesJansen, Maurice / Santhanam, Rahul et al. | 2012
- 48
-
Surface Split Decompositions and Subgraph Isomorphism in Graphs on SurfacesBonsma, Paul et al. | 2012
- 49
-
The Denjoy alternative for computable functionsBienvenu, Laurent / Hölzl, Rupert / Miller, Joseph S. / Nies, André et al. | 2012
- 50
-
The Determinacy of Context-Free GamesFinkel, Olivier et al. | 2012
- 51
-
The dimension of ergodic random sequencesHoyrup, Mathieu et al. | 2012
- 52
-
The Field of Reals is not omega-AutomaticAbu Zaid, Faried / Grädel, Erich / Kaiser, Lukasz et al. | 2012
- 53
-
The Limits of Decidability for First Order Logic on CPDA GraphsBroadbent, Christopher H. et al. | 2012
- 54
-
The Power of Local Search: Maximum Coverage over a MatroidFilmus, Yuval / Ward, Justin et al. | 2012
- 55
-
Trichotomy for Integer Linear Systems Based on Their Sign PatternsKimura, Kei / Makino, Kazuhisa et al. | 2012
- 56
-
Tying up the loose ends in fully LZW-compressed pattern matchingGawrychowski, Pawel et al. | 2012
- 57
-
Variable time amplitude amplification and quantum algorithms for linear algebra problemsAmbainis, Andris et al. | 2012
- 58
-
Weak MSO+U over infinite treesBojanczyk, Mikolaj / Torunczyk, Szymon et al. | 2012