336 results on '"RON, DANA"'
Search Results
302. Maximum Weight Independent Sets and Matchings in Sparse Random Graphs : Exact Results Using the Local Weak Convergence Method
303. The Sketching Complexity of Pattern Matching
304. Distribution-Free Connectivity Testing
305. Fooling Parity Tests with Parity Gates
306. The Diameter of Randomly Perturbed Digraphs and Some Applications
307. Estimating Frequency Moments of Data Streams Using Random Linear Combinations
308. Improved Randomness Extraction from Two Independent Sources
309. Counting Connected Graphs and Hypergraphs via the Probabilistic Method
310. Strong Refutation Heuristics for Random k-SAT
311. Approximating Additive Distortion of Embeddings into Line Metrics
312. A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
313. Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
314. Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions
315. Maximum Coverage Problem with Group Budget Constraints and Applications
316. Robust Locally Testable Codes and Products of Codes
317. Estimating the Distance to a Monotone Function
318. The Chromatic Number of Random Regular Graphs
319. A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One
320. The Greedy Algorithm for the Minimum Common String Partition Problem
321. Convergence Issues in Competitive Games
322. Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks
323. Designing Networks with Existing Traffic to Support Fast Restoration
324. Min-Max Multiway Cut
325. On the Crossing Spanning Tree Problem
326. Computationally-Feasible Truthful Auctions for Convex Bundles
327. Simultaneous Source Location
328. An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case
329. Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem
330. Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks
331. Approximating Max k CSP Using Random Restrictions
332. Cost-Sharing Mechanisms for Network Design
333. Polylogarithmic Inapproximability of the Radio Broadcast Problem
334. On Systems of Linear Equations with Two Variables per Equation
335. Finding cycles and trees in sublinear time.
336. The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.