default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMedAlg 2012: Kibbutz Ein Gedi, Israel
- Guy Even, Dror Rawitz:
Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7659, Springer 2012, ISBN 978-3-642-34861-7 - Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:
Detecting Approximate Periodic Patterns. 1-12 - Grey Ballard, James Demmel, Olga Holtz
, Benjamin Lipshitz, Oded Schwartz:
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication. 13-36 - Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Multicast Routing for Energy Minimization Using Speed Scaling. 37-51 - Guy Baram, Tami Tamir:
Reoptimization of the Minimum Total Flow-Time Scheduling Problem. 52-66 - Neal Barcelo, Miao Zhou, Daniel Cole, Michael Nugent, Kirk Pruhs:
Energy Efficient Caching for Phase-Change Memory. 67-81 - Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Shortest-Elapsed-Time-First on a Multiprocessor. 82-92 - Gernot Veit Batz, Robert Geisberger, Dennis Luxen, Peter Sanders, Roman Zubkov:
Efficient Route Compression for Hybrid Route Planning. 93-107 - Shiri Chechik, Quentin Godfroy, David Peleg:
Multipath Spanners via Fault-Tolerant Spanners. 108-119 - Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. 120-133 - Fabio Cunial:
Faster Variance Computation for Patterns with Gaps. 134-147 - Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. 148-158 - Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Experimental Analysis of Rumor Spreading in Social Networks. 159-173 - Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. 174-187 - Fabian Fuchs, Markus Völker, Dorothea Wagner:
Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks. 188-202 - Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler:
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. 203-218 - Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner:
An Efficient Generator for Clustered Dynamic Random Networks. 219-233 - Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn:
Slow Down and Sleep for Profit in Online Deadline Scheduling. 234-247 - Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander Sirotkin, Denis Tugaryov:
FIFO Queueing Policies for Packets with Heterogeneous Processing. 248-260
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-09-19 23:50 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:
