Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 56
Volume 56, Number 1, January 2015
- Roberto Solis-Oba, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. 1-2 - Marc P. Renault
, Adi Rosén:
On Online Algorithms with Advice for the k-Server Problem. 3-21 - Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. 22-40 - Rolf Harren, Walter Kern:
Improved Lower Bound for Online Strip Packing. 41-72 - Tomás Ebenlendr, Jirí Sgall:
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. 73-81 - Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam:
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. 82-95 - David B. Shmoys, Gwen Spencer:
Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat. 96-134 - Thomas Erlebach, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. 135-136 - János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. 137-155 - Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. 156-180 - Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. 181-196 - Stefan Dobrev, Rastislav Královic, Richard Královic:
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. 197-219 - Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods. 220-250 - Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. 251-290
Volume 56, Number 2, February 2015
- Amir Pourabdollah, Tim J. Brailsford:
On the Turing Completeness of the Semantic Web. 291-308 - Leah Epstein, Hanan Zebedat-Haider:
Rent or Buy Problems with a Fixed Time Horizon. 309-329 - Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. 330-346 - Min Zhou, Fei He, Xiaoyu Song, Shi He, Gangyi Chen, Ming Gu:
Estimating the Volume of Solution Space for Satisfiability Modulo Linear Real Arithmetic. 347-371 - Harry Buhrman, Bruno Loff, Leen Torenvliet:
Hardness of Approximation for Knapsack Problems. 372-393 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Sitting Closer to Friends than Enemies, Revisited. 394-405 - R. Mareay:
Topological Approach to Multivalued Information System. 406-417 - Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Generalized River Crossing Problems. 418-435
Volume 56, Number 3, April 2015
- Elvira Mayordomo, Wolfgang Merkle:
Editorial. 437-438 - Santiago Figueira, André Nies:
Feasible Analysis, Randomness, and Base Invariance. 439-464 - Kenshi Miyabe:
Schnorr Triviality and Its Equivalent Notions. 465-486 - Christopher P. Porter:
Trivial Measures are not so Trivial. 487-512 - Andrei E. Romashchenko, Alexander Shen:
Topological Arguments for Kolmogorov Complexity. 513-526 - Stephen G. Simpson:
Symbolic Dynamics: Entropy = Dimension = Complexity. 527-543 - Kohtaro Tadaki, Norihisa Doi:
Cryptography and Algorithmic Randomness. 544-580 - N. V. Vinodchandran, Marius Zimand:
On Optimal Language Compression for Sets in PSPACE/poly. 581-590
Volume 56, Number 4, May 2015
- Juhani Karhumäki, Edward A. Hirsch:
Preface. 591-592 - Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs. 593-611 - Romeo Rizzi, Florian Sikora:
Some Results on More Flexible Versions of Graph Motif. 612-629 - Evgeny Demenkov, Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin:
New Lower Bounds on Circuit Size of Multi-output Functions. 630-642 - Daniil Musatov:
On Extracting Space-bounded Kolmogorov Complexity. 643-661 - Christos A. Kapoutsis, Giovanni Pighizzini:
Two-Way Automata Characterizations of L/poly Versus NL. 662-685 - Volker Diekert, Manfred Kufleitner:
Omega-Rational Expressions with Bounded Synchronization Delay. 686-696 - Prateek Karandikar, Philippe Schnoebelen:
Generalized Post Embedding Problems. 697-716
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-25 05:27 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:
