| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Daniel Stefankovic, Santosh Vempala, Eric Vigoda |
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Trinh Huynh |
Multiparty Communication Complexity and Threshold Circuit Size of sfAC0. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan |
On Clustering to Minimize the Sum of Radii. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala |
Local Versus Global Properties of Metric Spaces. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Thorup, Yin Zhang |
Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Jansson, Richard S. Lemence, Andrzej Lingas |
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wouter Gelade, Marc Gyssens, Wim Martens |
Regular Expressions with Counting: Weak versus Strong Determinism. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow, Suzanne Gallagher |
Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jen-Yeu Chen, Gopal Pandurangan |
Almost-Optimal Gossip-Based Aggregate Computation. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Ezra N. Hoch, Yoram Moses |
An Optimal Self-Stabilizing Firing Squad. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuele Viola |
The Complexity of Distributions. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi |
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore, Alexander Russell |
Approximating the Permanent via Nonabelian Determinants. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss |
Approximate Sparse Recovery: Optimizing Time and Measurements. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Devroye |
Simulating Size-constrained Galton-Watson Trees. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky |
Envy-Free Makespan Approximation. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita |
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toniann Pitassi, Nathan Segerlind |
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Niv Buchbinder, Joseph Naor |
Randomized Competitive Algorithms for Generalized Caching. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking |
Uncoordinated Two-Sided Matching Markets. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Cynthia Dwork, Venkat Guruswami |
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008). |
SIAM J. Comput. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Chen, Arpita Ghosh, Sergei Vassilvitskii |
Optimal Envy-Free Pricing with Metric Substitutability. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann |
Exact Price of Anarchy for Polynomial Congestion Games. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri |
Self-Improving Algorithms. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Páll Melsted, Michael Mitzenmacher |
An Analysis of Random-Walk Cuckoo Hashing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
Testing Fourier Dimensionality and Sparsity. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Norm Ferns, Prakash Panangaden, Doina Precup |
Bisimulation Metrics for Continuous Markov Decision Processes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Mironov, Moni Naor, Gil Segev |
Sketching in Adversarial Environments. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
Black-Box Constructions of Protocols for Secure Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Hayim Shaul |
Semialgebraic Range Reporting and Emptiness Searching with Applications. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Danny Harnik, Omer Reingold |
On the Power of the Randomized Iterate. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Avi Wigderson |
Kakeya Sets, New Mergers, and Old Extractors. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
Algorithmic Aspects of Property Testing in the Dense Graphs Model. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
Dynamic Connectivity: Connecting to Networks and Geometry. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith |
What Can We Learn Privately? |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
The Recognition of Tolerance and Bounded Tolerance Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. |
SIAM J. Comput. |
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 | Hagay Levin, Michael Schapira, Aviv Zohar |
Interdomain Routing and Games. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Gafni, Rachid Guerraoui, Bastian Pochon |
The Complexity of Early Deciding Set Agreement. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Nikhil Srivastava |
Graph Sparsification by Effective Resistances. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha |
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
A Counterexample to Strong Parallel Repetition. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | James King, Erik Krohn |
Terrain Guarding is NP-Hard. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Briest, Piotr Krysta, Berthold Vöcking |
Approximation Techniques for Utilitarian Mechanism Design. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amnon Ta-Shma |
Short Seed Extractors against Quantum Storage. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Briest, Piotr Krysta |
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Ailon, Moses Charikar |
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao |
Parallel Repetition in Projection Games and a Concentration Bound. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák |
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola |
Special Section on Foundations of Computer Science. |
SIAM J. Comput. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin |
Sorting and Selection in Posets. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky |
Interval Graphs: Canonical Representations in Logspace. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Giménez, Guillem Godoy, Sebastian Maneth |
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström |
On the Composition of Public-Coin Zero-Knowledge Protocols. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Hazan, Robert Krauthgamer |
How Hard Is It to Approximate the Best Nash Equilibrium? |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy |
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tao Jiang, Zevi Miller, Dan Pritikin |
Near Optimal Bounds for Steiner Trees in the Hypercube. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Pinyan Lu, Mingji Xia |
Computational Complexity of Holant Problems. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick |
Entangled Games Are Hard to Approximate. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Johan Håstad |
Randomly Supported Independence and Resistance. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alasdair Urquhart |
A Near-Optimal Separation of Regular and General Resolution. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Brent Waters |
Lossy Trapdoor Functions and Their Applications. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan |
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via Quantum Walk. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
Rank-Pairing Heaps. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoya Svitkina, Lisa Fleischer |
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
Optimal Cover of Points by Disks in a Simple Polygon. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
Matching Vector Codes. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Partha Niyogi, Stephen Smale, Shmuel Weinberger |
A Topological View of Unsupervised Learning from Noisy Data. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Cachin, Idit Keidar, Alexander Shraer |
Fail-Aware Untrusted Storage. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel A. Spielman, Shang-Hua Teng |
Spectral Sparsification of Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng Shao, Jennifer L. Welch, Evelyn Pierce, Hyunyoung Lee |
Multiwriter Consistency Conditions for Shared Memory Registers. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Dana Ron |
On Proximity-Oblivious Testing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Sherstov |
The Pattern Matrix Method. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske |
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
An Expansion Tester for Bounded Degree Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser, J. M. Landsberg, Laurent Manivel, Jerzy Weyman |
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihai Patrascu |
Unifying the Landscape of Cell-Probe Lower Bounds. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Amnon Ta-Shma |
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan O'Donnell, Rocco A. Servedio |
The Chow Parameters Problem. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Shalev-Shwartz, Ohad Shamir, Karthik Sridharan |
Learning Kernel-Based Halfspaces with the 0-1 Loss. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Valiant |
Testing Symmetric Properties of Distributions. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
Truthful Approximation Schemes for Single-Parameter Agents. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Vahab S. Mirrokni, Jan Vondrák |
Maximizing Non-monotone Submodular Functions. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson |
Hardness of Precedence Constrained Scheduling on Identical Machines. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Adriana Karagiozova |
Terminal Backup, 3D Matching, and Covering Cubic Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiran S. Kedlaya, Christopher Umans |
Fast Polynomial Factorization and Modular Composition. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer, Volker Heun |
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. |
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 | Nitin Saxena, C. Seshadhri |
An Almost Optimal Rank Bound for Depth-3 Identities. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan |
A Better Algorithm for Random k-SAT. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Ralf Thöle |
Approximation Algorithms for Scheduling Parallel Jobs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")