default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. TAMC 2013: Hong Kong, China
- T.-H. Hubert Chan, Lap Chi Lau, Luca Trevisan:
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7876, Springer 2013, ISBN 978-3-642-38235-2 - Lin Chen
, Deshi Ye, Guochuan Zhang:
Online Scheduling on a CPU-GPU Cluster. 1-9 - Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios:
Throughput Maximization for Speed-Scaling with Agreeable Deadlines. 10-19 - Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Algorithms for Minimizing Flow Time. 20-31 - Tetsuo Asano, Amr Elmasry, Jyrki Katajainen:
Priority Queues and Sorting for Read-Only Data. 32-41 - Mingfei Li, Chu Chung Christopher Ma, Li Ning:
(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs. 42-51 - Hee-Kap Ahn, Sang Won Bae, Wanbin Son:
Group Nearest Neighbor Queries in the L 1 Plane. 52-61 - Alexandru Popa:
Modelling the Power Supply Network - Hardness and Approximation. 62-71 - Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem. 72-83 - Manu Agarwal, Ragesh Jaiswal, Arindam Pal:
k-means++ under Approximation Stability. 84-95 - Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. 96-107 - Jan Kratochvíl, Torsten Ueckerdt:
Non-crossing Connectors in the Plane. 108-120 - Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu:
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. 121-132 - Nathanael L. Ackerman, Cameron E. Freer:
A Notion of a Computational Step for Partial Combinatory Algebras. 133-143 - Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang:
Selection by Recursively Enumerable Sets. 144-155 - Oscar H. Ibarra, Shinnosuke Seki:
On the Boundedness Property of Semilinear Sets. 156-168 - Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. 169-180 - Michael Brand:
Computing with and without Arbitrary Large Numbers. 181-192 - Alejandro López-Ortiz, Alejandro Salinger:
On the Sublinear Processor Gap for Parallel Architectures. 193-204 - Marius Zimand:
On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs. 205-211 - Tor Lattimore, Marcus Hutter:
On Martin-Löf Convergence of Solomonoff's Mixture. 212-223 - Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. 224-235 - Nan Liu, Daming Zhu:
The Algorithm for the Two-Sided Scaffold Filling Problem. 236-247 - Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. 248-259 - Andrew Chester, Riccardo Dondi, Anthony Wirth:
Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs. 260-271 - Yukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang:
Obnoxious Facility Game with a Bounded Service Range. 272-281 - Hongfeng Wu, Rongquan Feng:
Efficient Self-pairing on Ordinary Elliptic Curves. 282-293 - Hirotoshi Takebe, Keisuke Tanaka:
Grey-Box Public-Key Steganography. 294-305 - Anthony Perez:
Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems. 306-318 - Yixin Cao, Jianer Chen:
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. 319-330 - Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector Connectivity in Graphs. 331-342 - Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège:
Trees in Graphs with Conflict Edges or Forbidden Transitions. 343-354
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-02-19 00:49 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:
