default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 44
Volume 44, Number 1, 2015
- Vladimir Kolmogorov, Johan Thapper
, Stanislav Zivný:
The Power of Linear Programming for General-Valued CSPs. 1-36 - T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. 37-53 - Fedor V. Fomin, Ioan Todinca, Yngve Villanger:
Large Induced Subgraphs via Triangulations and CMSO. 54-87 - Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time. 88-113 - Martin Grohe, Dániel Marx:
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. 114-159 - Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. 160-192 - Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. 193-242
Volume 44, Number 2, 2015
- Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. 243-289 - András A. Benczúr, David R. Karger:
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. 290-319 - David R. Karger, Matthew S. Levine:
Fast Augmenting Paths by Random Sampling from Residual Graphs. 320-339 - Pavel Hrubes, Iddo Tzameret:
Short Proofs for the Determinant Identities. 340-383 - David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati:
Fixed-Parameter Algorithms for Finding Agreement Supertrees. 384-410 - Eric Blais, Amit Weinstein, Yuichi Yoshida:
Partially Symmetric Functions Are Efficiently Isomorphism Testable. 411-432 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. 433-466 - Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec:
Anisotropic Delaunay Mesh Generation. 467-512
Volume 44, Number 3, 2015
- Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. 513-539 - Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing Probability Distributions using Conditional Samples. 540-616 - Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. 617-668 - Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. 669-697 - David Bruce Wilson, Uri Zwick:
A Forward-Backward Single-Source Shortest Paths Algorithm. 698-739 - Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Pattern Formation by Oblivious Asynchronous Mobile Robots. 740-785 - Eryk Kopczynski, Tony Tan:
Regular Graphs and the Spectra of Two-Variable Logic with Counting. 786-818 - Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer:
Minimum Congestion Mapping in a Cloud. 819-843 - Yoann Dieudonné, Andrzej Pelc, Vincent Villain:
How to Meet Asynchronously at Polynomial Cost. 844-867 - Gianluca De Marco, Dariusz R. Kowalski:
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel. 868-888
Volume 44, Number 4, 2015
- Mikhail Belkin, Kaushik Sinha:
Polynomial Learning of Distribution Families. 889-911 - Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. 912-943 - Sariel Har-Peled, Nirman Kumar:
Approximating Minimization Diagrams and Generalized Proximity Search. 944-974 - Lior Kamma, Robert Krauthgamer, Huy L. Nguyen:
Cutting Corners Cheaply, or How to Remove Steiner Points. 975-995 - Michael Elkin, Shay Solomon:
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones. 996-1025 - Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella:
Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization. 1026-1088 - Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. 1089-1118 - Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. 1119-1153 - Philip N. Klein, Neal E. Young:
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. 1154-1172
Volume 44, Number 5, 2015
- Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. 1173-1201 - Takuro Fukunaga, Zeev Nutov, R. Ravi:
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. 1202-1229 - Dorit Aharonov, Lior Eldar:
Quantum Locally Testable Codes. 1230-1262 - Felix A. Fischer, Max Klimm:
Optimal Impartial Selection. 1263-1285
- Tim Roughgarden:
Special Section on the Fifty-Third IEEE Annual Symposium on Foundations of Computer Science (FOCS 2012). 1286 - Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. 1287-1324 - Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. 1325-1383 - Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. 1384-1402 - Bernard Chazelle:
Diffusive Influence Systems. 1403-1442 - Andrew Drucker:
New Limits to Classical and Quantum Instance Compression. 1443-1479 - Shafi Goldwasser, Guy N. Rothblum:
How to Compute in the Presence of Leakage. 1480-1549 - Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. 1550-1572 - Shachar Lovett, Raghu Meka:
Constructive Discrepancy Minimization by Walking on the Edges. 1573-1582
Volume 44, Number 6, 2015
- Eric Blais, Li-Yang Tan:
Approximating Boolean Functions with Depth-2 Circuits. 1583-1600 - Mrinal Kumar, Shubhangi Saraf:
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. 1601-1625 - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. 1626-1649 - Nabil H. Mustafa, Rajiv Raman, Saurabh Ray:
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces. 1650-1669 - Eli Ben-Sasson, Noga Ron-Zewi:
From Affine to Two-Source Extractors via Approximate Duality. 1670-1697 - Mark Braverman:
Interactive Information Complexity. 1698-1739 - Vitaly Feldman, David Xiao:
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity. 1740-1764 - Jan Bulánek, Michal Koucký, Michael E. Saks:
Tight Lower Bounds for the Online Labeling Problem. 1765-1797 - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. 1798-1819 - Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. 1820-1847
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-26 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
