default search action
40. MFCS 2015: Milan, Italy
- Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella:
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. Lecture Notes in Computer Science 9235, Springer 2015, ISBN 978-3-662-48053-3 - Fidaa Abed
, Ioannis Caragiannis, Alexandros A. Voudouris
Near-Optimal Asymmetric Binary Matrix Partitions. 1-13 - Eric Allender
Dual VP Classes. 14-25 - Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On Tinhofer's Linear Programming Approach to Isomorphism Testing. 26-37 - Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar:
On the Complexity of Noncommutative Polynomial Factorization. 38-49 - Martijn Baartse, Klaus Meer:
An Algebraic Proof of the Real Number PCP Theorem. 50-61 - Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). 62-74 - Neal Barcelo, Peter Kling
On the Complexity of Speed Scaling. 75-89 - Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Almost All Functions Require Exponential Energy. 90-101 - Surender Baswana, Keerti Choudhary:
On Dynamic DFS Tree in Directed Graphs. 102-114 - Rémy Belmonte, Fedor V. Fomin
Metric Dimension of Bounded Width Graphs. 115-126 - Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
Equality, Revisited. 127-138 - Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. 139-150 - Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. 151-162 - Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with Subset State Witnesses. 163-174 - Andrei A. Bulatov, Evgeny S. Skvortsov:
Phase Transition for Local Search on Planted SAT. 175-186 - Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say:
Optimal Bounds for Estimating Entropy with PMF Queries. 187-198 - Adam Case, Jack H. Lutz:
Mutual Dimension and Random Sequences. 199-210 - Lin Chen
Optimal Algorithms and a PTAS for Cost-Aware Scheduling. 211-222 - Ruiwen Chen:
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. 223-234 - Daniyar Chumbalov, Andrei E. Romashchenko
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem. 235-247 - Andreas Cord-Landwehr, Pascal Lenzner:
Network Creation Games: Think Global - Act Local. 248-260 - Claude Crépeau, Raza Ali Kazmi:
Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem. 261-273 - Giovanni Di Crescenzo, Brian A. Coan, Jonathan Kirsch:
Efficient Computations over Encrypted Data Blocks. 274-286 - Michael Etscheid, Stefan Kratsch, Matthias Mnich
Polynomial Kernels for Weighted Problems. 287-298 - Stefan Fafianie, Stefan Kratsch:
A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time. 299-310 - Diodato Ferraioli, Carmine Ventre
Metastability of Asymptotically Well-Behaved Potential Games - (Extended Abstract). 311-323 - Hervé Fournier, Nutan Limaye, Meena Mahajan
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. 324-335 - Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. 336-347 - Robert Ganian
Algorithmic Applications of Tree-Cut Width. 348-360 - Ignacio García-Marco
Log-Concavity and Lower Bounds for Arithmetic Circuits. 361-371 - Torben Hagerup:
Easy Multiple-Precision Divisors and Word-RAM Constants. 372-383 - Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and the Structure of NC1. 384-394 - Tatiana Romina Hartinger, Matthew Johnson
The Price of Connectivity for Cycle Transversals. 395-406 - Udo Hoffmann, Linda Kleist
Upper and Lower Bounds on Long Dual Paths in Line Arrangements. 407-419 - Sune K. Jakobsen:
A Numbers-on-Foreheads Game. 420-431 - Dmitry Kosolobov:
Faster Lightweight Lempel-Ziv Parsing. 432-444 - Daniel König, Markus Lohrey:
Parallel Identity Testing for Skew Circuits with Big Powers and Applications. 445-458 - Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape. 459-471 - Andrew McGregor, David Tench
Densest Subgraph in Dynamic Graph Streams. 472-482 - Saad Mneimneh, Saman Farhat:
The Offline Carpool Problem Revisited. 483-492 - Sandro Montanari, Paolo Penna:
On Sampling Simple Paths in Planar Graphs According to Their Lengths. 493-504 - Moritz Mühlenthaler:
Degree-Constrained Subgraph Reconfiguration is in P. 505-516 - Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. 517-528 - Mona Rahn, Guido Schäfer:
Efficient Equilibria in Polymatrix Coordination Games. 529-541 - Markus L. Schmid:
Finding Consensus Strings with Small Length Difference Between Input and Solution Strings. 542-554 - Henning Schnoor, Oliver Woizekowski:
Active Linking Attacks. 555-566 - Martijn van Ee, René Sitters:
On the Complexity of Master Problems. 567-576 - Xiaowei Wu
Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs. 577-588 - Meirav Zehavi
Maximum Minimal Vertex Cover Parameterized by Vertex Cover. 589-600 - Quan Zu, Miaomiao Zhang, Bin Yu:
Fast Dynamic Weight Matchings in Convex Bipartite Graphs. 601-612
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-12-15 01:33 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: