Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 76
Volume 76, Number 1, September 2016
- Stacey Jeffery, Robin Kothari
, François Le Gall, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. 1-16 - Vladimir Kolmogorov, Rustem Takhanov:
Inference Algorithms for Pattern-Based CRFs on Sequence Data. 17-46 - Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Extending Convex Partial Drawings of Graphs. 47-67 - Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas. 68-87 - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski:
Online Network Design with Outliers. 88-109 - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to Equilibrium of Logit Dynamics for Strategic Games. 110-142 - Dimitris Fotakis, Christos Tzamos:
Strategyproof Facility Location for Concave Cost Functions. 143-167 - Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. 168-194 - Cameron T. Chalk, Dominic A. Fernandez, Alejandro Huerta, Mario A. Maldonado, Robert T. Schweller, Leslie Sweet:
Strict Self-Assembly of Fractals Using Multiple Hands. 195-224 - Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff:
Multi-sided Boundary Labeling. 225-258 - Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. 259-278 - Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen:
Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs. 279-296
Volume 76, Number 2, October 2016
- John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen:
Approximate Well-supported Nash Equilibria Below Two-thirds. 297-319 - Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh:
Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments. 320-343 - Abbas Mehrabian, Nick Wormald:
It's a Small World for Random Surfers. 344-380 - Fatemeh Rajabi-Alni, Alireza Bagheri:
An O(n2) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension. 381-400 - Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. 401-425 - Lee-Ad Gottlieb, Tyler Neylon:
Matrix Sparsification and the Sparse Null Space Problem. 426-444 - J. Ian Munro, Patrick K. Nicholson:
Succinct Posets. 445-473 - Fangqiu Han, Subhash Suri, Xifeng Yan:
Observability of Lattice Graphs. 474-489 - Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy:
Streaming Algorithms for Independent Sets in Sparse Hypergraphs. 490-501 - Michel Raynal, Julien Stainer, Gadi Taubenfeld:
Distributed Universality. 502-535 - Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. 536-568 - Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. 569-594
Volume 76, Number 3, November 2016
- Mark Braverman, David P. Woodruff:
Guest Editorial for Information Complexity and Applications. 595-596 - Gábor Braun, Sebastian Pokutta:
Common Information and Unique Disjointness. 597-629 - Elad Haramaty, Madhu Sudan:
Deterministic Compression with Uncertain Priors. 630-653 - Venkatesan Guruswami, Krzysztof Onak:
Superlinear Lower Bounds for Multipass Graph Processing. 654-683 - Mika Göös, Toniann Pitassi, Thomas Watson:
Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. 684-719 - Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. 720-748 - Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. 749-781 - Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero-Error Average Communication. 782-795 - Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. 796-845 - Mark Braverman, Omri Weinstein:
A Discrepancy Lower Bound for Information Complexity. 846-864
Volume 76, Number 4, December 2016
- Zhipeng Cai, Alexander Zelikovsky:
Computing and Combinatorics. 865-866 - Jianer Chen, Feng Shi, Jianxin Wang:
Approximating Maximum Agreement Forest on Multiple Binary Trees. 867-889 - Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. 890-909 - Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. 910-931 - Alfredo Viola:
Preface-S.I.: LATIN 2014. 932-934 - Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. 935-960 - Volker Diekert, Alexei G. Myasnikov, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. 961-988 - Nicolas Basset:
Counting and Generating Permutations in Regular Classes. 989-1034 - Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
2-Xor Revisited: Satisfiability and Probabilities of Functions. 1035-1076 - Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. 1077-1096 - Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. 1097-1105 - Antoine Genitrini, Cécile Mailler:
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. 1106-1138 - Mário César San Felice, David P. Williamson, Orlando Lee:
A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem. 1139-1157 - Hee-Kap Ahn, Chan-Su Shin:
Guest Editor's Foreword. 1158-1159 - Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals. 1160-1180 - Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. 1181-1202 - Daniel Kane, Osamu Watanabe:
A Short Implicant of a CNF Formula with Many Satisfying Assignments. 1203-1223 - Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. 1224-1244 - Ei Ando, Shuji Kijima:
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution. 1245-1263 - Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. 1264-1275
a service of 
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 2024-04-19 19:20 CEST 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:
