Atri Rudra

From MaRDI portal
Revision as of 12:40, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:627116

Available identifiers

zbMath Open rudra.atriMaRDI QIDQ627116

List of research outcomes

PublicationDate of PublicationType
Arithmetic circuits, structured matrices and (not so) deep learning2023-07-26Paper
General Strong Polarization2022-03-31Paper
Joins via Geometric Resolutions2021-11-25Paper
General Strong Polarization2019-08-22Paper
Worst-case Optimal Join Algorithms2018-12-06Paper
Tight Network Topology Dependent Bounds on Rounds of Communication2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46079232018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46079562018-03-15Paper
Better Binary List Decodable Codes Via Multilevel Concatenation2017-08-08Paper
Limits to List Decoding of Random Codes2017-07-27Paper
Soft Decoding, Dual BCH Codes, and Better List-Decodable $\varepsilon$-Biased Codes2017-07-27Paper
The Existence of Concatenated Codes List-Decodable up to the Hamming Bound2017-07-27Paper
It'll Probably Work Out2017-05-19Paper
An energy complexity model for algorithms2017-05-16Paper
The Range of Topological Effects on Communication2015-11-04Paper
Every list-decodable code for high noise has abundant near-optimal rate puncturings2015-06-26Paper
https://portal.mardi4nfdi.de/entity/Q29346592014-12-18Paper
Explicit capacity-achieving list-decodable codes2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q54176952014-05-22Paper
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk2013-08-06Paper
Improved approximation algorithms for the spanning star forest problem2013-08-05Paper
Flexible coloring2013-03-28Paper
When LP is the cure for your matching woes: improved bounds for stochastic matchings2012-12-06Paper
https://portal.mardi4nfdi.de/entity/Q29047642012-08-23Paper
https://portal.mardi4nfdi.de/entity/Q31137082012-01-23Paper
Symmetric Functions Capture General Functions2011-08-17Paper
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications2011-07-06Paper
Pricing commodities2011-02-21Paper
Testing low-degree polynomials over prime fields2010-11-09Paper
Two Theorems on List Decoding2010-09-10Paper
Data Stream Algorithms for Codeword Testing2010-09-07Paper
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings2010-09-06Paper
Limits to list decoding Reed-Solomon codes2010-08-16Paper
Ordering by weighted number of wins gives a good ranking for weighted tournaments2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794742010-08-06Paper
Floodlight illumination of infinite wedges2009-10-16Paper
Limits to List Decoding Random Codes2009-07-23Paper
Approximating Matches Made in Heaven2009-07-14Paper
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy2009-02-24Paper
Improved Approximation Algorithms for the Spanning Star Forest Problem2009-02-17Paper
Better Binary List-Decodable Codes Via Multilevel Concatenation2009-02-17Paper
Lower bounds for randomized read/write stream algorithms2009-01-05Paper
Limits to List Decoding Reed–Solomon Codes2008-12-21Paper
Walrasian equilibrium: Hardness, approximations and tractable instances2008-09-12Paper
Efficient List Decoding of Explicit Codes with Optimal Redundancy2008-04-17Paper
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations2008-02-20Paper
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics2007-11-28Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Automata, Languages and Programming2006-01-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Atri Rudra