You are here: MADALGO Research Publications

Publications

Conference publications

C443 Subtree Isomorphism Revisited
A. Abboud, A. Backurs, T.D. Hansen, V.V. Williams and O. Zamir
Proc. Symposium on Discrete Algorithms (SODA), 2016
10.1137/1.9781611974331.ch88
C442 Towards Tight Bounds for the Streaming Set Cover Problem
S. Har-Peled, P. Indyk, S. Mahabadi and A. Vakilian
Proc. Symposium on Principles of Database Systems (PODS), 2016
C441 Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
M. Cheraghchi and P. Indyk
Proc. Symposium on Discrete Algorithms (SODA), 2016
10.1137/1.9781611974331.ch23
C440 Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
A. Backurs, P. Indyk, I. Razenshteyn and D.P. Woodruff
Proc. Symposium on Discrete Algorithms (SODA), 2016
10.1137/1.9781611974331.ch24
C439 Clairvoyant Mechanisms for Online Auctions
P. Brandes, Z. Huang, H.-H. Su and R. Wattenhofer
Proc. International Conference on Computing and Combinatorics (COCOON), 2016
C438 Dynamic Graph Stream Algorithms in o(n) Space
Z. Huang and P. Peng
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2016
C437 External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates
G.S. Brodal
Proc. Symposium on Theoretical Aspects of Computer Science (STACS), 2016
10.4230/LIPIcs.STACS.2016.23
C436 Higher Lower Bounds from the 3SUM Conjecture
T. Kopelowitz, S. Pettie and E. Porat
Proc. Symposium on Discrete Algorithms (SODA), 2016
10.1137/1.9781611974331.ch89
C435 On the complexity of minimum-link path problems
I. Kostitsnya, M. Löffler, V. Polishchuk and F. Staals
Proc. Symposium on Computational Geometry (SoCG), 2016
C434 Grouping Time-varying Data for Interactive Exploration
A. van Goethem, M. van Kreveld, M. Löffler, B. Speckmann and F. Staals
Proc. Symposium on Computational Geometry (SoCG), 2016
C433 A Refined Definition for Groups of Moving Entities and its Computation
M. van Kreveld, M. Löffler, F. Staals and L. Wiratma
Proc. European Workshop on Computational Geometry (EuroCG), 2016
http://www.eurocg2016.usi.ch/sites/default/files/EuroCG16-BookOfAbstract.pdf
C432 New Results on Trajectory Grouping under Geodesic Distance
M. Löffler, F. Staals and J. Urhausen
Proc. European Workshop on Computational Geometry (EuroCG), 2016
http://www.eurocg2016.usi.ch/sites/default/files/EuroCG16-BookOfAbstract.pdf
C431 Computing River Floods Using Massive Terrain Data
C. Alexander, L. Arge, P.K. Bøcher, M. Revsbæk, B. Sandel, J.-C. Svenning, C. Tsirogiannis, and J. Yang
Proc. International Conference on Geographic Information Science (GIScience), 2016
C430 Fast Phylogenetic Biodiversity Computations Under a Non-Uniform Random Distribution
C. Tsirogiannis and B. Sandel
Proc. International Conference on Research in Computational Molecular Biology (RECOMB), 2016
10.1007/978-3-319-31957-5_16
C429 Approximating Convex Shapes with respect to Symmetric Difference under Homotheties
J. Yon, S.W. Bae, S-W. Cheng, O. Cheong and B.T. Wilkinson
Proc. International Conference on Computational Geometry (SoCG), 2016
C428 Approximating the Simplicial Depth in High Dimensions
P. Afshani, D. R. Sheehy and Y. Stein
Proc. European Workshop on Computational Geometry (EuroCG), 2016
http://www.eurocg2016.usi.ch/sites/default/files/EuroCG16-BookOfAbstract.pdf
C427 Applications of incidence bounds in point covering problems
P. Afshani, E. Berglin, I. van Duijn and J.A.S. Nielsen
Proc. International Conference on Computational Geometry (SoCG), 2016
C426 Data Structure Lower Bounds for Document Indexing Problems
P. Afshani and J.A.S. Nielsen
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2016
C425 How to prove knowledge of small secrets
C. Baum, I. Damgård, K.G. Larsen and M. Nielsen
Proc. International Cryptology Conference (CRYPTO), 2016
C424 Towards Tight Lower Bounds for Range Reporting on the RAM
A. Grønlund and K.G. Larsen
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2016
C423 The Johnson-Lindenstrauss Lemma is Optimal for Linear Dimensionality Reduction
K.G. Larsen and J. Nelson
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2016
C422 Energy-Efficient Algorithms
E.D. Demaine, J. Lynch, G.J. Mirano and N. Tyagi
Proc. ACM Conference on Innovations in Theoretical Computer Science, 2016
10.1145/2840728.2840756
C421 The Fewest Clues Problem
E.D. Demaine, F. Ma, E. Waingarten, A. Schvartzman and S. Aaronson
Proc. International Conference on Fun with Algorithms, 2016
C420 Super Mario Bros. is Harder/Easier than We Thought
E.D. Demaine, G. Viglietta and A. Williams
Proc. International Conference on Fun with Algorithms, 2016
C419 Who Needs Crossings? Hardness of Plane Graph Rigidity
Z. Abel, E.D. Demaine, M.L. Demaine, S. Eisenstat, J. Lynch and T.B. Schardl
Proc. International Conference on Computational Geometry (SoCG), 2016
C418 An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
R. Duan, J. Garg and K. Mehlhorn
Proc. Symposium on Discrete Algorithms (SODA), 2016
10.1137/1.9781611974331.ch7
C417 GPU Multisplit
S. Ashkiani, A. Davidson, U. Meyer and J. Owens
Proc. Symposium on Principles and Practice of Parallel Programming (PPoPP), 2016
10.1145/2851141.2851169
C416 Generating Massive Scale-Free Networks under Resource Constraints
U. Meyer and M. Penschuck
Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2016
10.1137/1.9781611974317.4
C415 Tight Hardness Results for LCS and Other Sequence Similarity Measures
A. Abboud, A. Backurs and V. A. Williams
Proc. Symposium on Foundations of Computer Science (FOCS), 2015
10.1109/FOCS.2015.14
C414 Sparse Solutions to Nonnegative Linear Systems and Applications
A. Bhaskara, A. Theertha and M. Zadimoghaddam
Proc. International Conference on Artificial Intelligence and Statistics (AISTATS), 2015
http://jmlr.org/proceedings/papers/v38/bhaskara15.html
C413 Online Stochastic Matching with Unequal Probabilities
A. Mehta, B. Waggoner and M. Zadimoghaddam
Proc. Symposium on Discrete Algorithms (SODA), 2015
10.1137/1.9781611973730.92
C412 A Dissimilarity Measure for Comparing Origami Crease Patterns
S. M. Oh, G. T. Toussaint, E. D. Demaine and M. L. Demaine
Proc. International Conference on Pattern Recognition Applications and Methods (ICPRAM), 2015
10.5220/0005291203860393
C411 Folding a Paper Strip to Minimize Thickness
E. D. Demaine, D. Eppstein, A. Hesterberg, H. Ito, A. Lubiw, R. Uehara and Y. Uno
Proc. International Workshop on Algorithms and Computation (WALCOM), 2015
10.1007/978-3-319-15612-5_11
C410 New Geometric Algorithms for Staged Self-Assembly
E. D. Demaine, S. Fekete and A. Schmidt
Proc. European Workshop on Computational Geometry (EuroCG), 2015
C409 Particle computation: Device fan-out and binary memory
H. M. Shad, R. Morris-Wright, E. D. Demaine, S. P. Fekete and A. Becker
Proc. IEEE International Conference on Robotics and Automation (ICRA), 2015
10.1109/ICRA.2015.7139951
C408 Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals
A. T. Becker, E. D. Demaine, S. P. Fekete, H. M. Shad and R. Morris-Wright
Multimedia Exposition in Proc. Symposium on Computational Geometry (SoCG), 2015
10.4230/LIPIcs.SOCG.2015.16
C407 Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
E. D. Demaine, V. Gopal and W. Hasenplaugh
Proc. Workshop on Algorithms and Data Structures (WADS), 2015
10.1007/978-3-319-21840-3_21
C406 Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing
E. D. Demaine, T. Kaler, Q. Liu, A. Sidford and A. Yedidia
Proc. Workshop on Algorithms and Data Structures (WADS), 2015
10.1007/978-3-319-21840-3_22
C405 New Geometric Algorithms for Fully Connected Staged Self-Assembly
E. D. Demaine, S. Fekete, C. Scheffer and A. Schmidt
Proc. International Conference on DNA Computing and Molecular Programming, 2015
10.1007/978-3-319-21999-8_7
C404 New Unconditional Hardness Results for Dynamic and Online Problems
R. Clifford, A. Grønlund and K. G. Larsen
Proc. Symposium on Foundations of Computer Science (FOCS), 2015
10.1109/FOCS.2015.71
C403 If the Current Clique Algorithms are Optimal, So is Valiant's Parser
A. Abboud, A. Backurs and V. A. Williams
Proc. Symposium on Foundations of Computer Science (FOCS), 2015
10.1109/FOCS.2015.16
C402 Sorting and Permuting without Bank Conflicts on GPUs
P. Afshani and N. Sitchinava
Proc. European Symposium on Algorithms (ESA), 2015
10.1007/978-3-662-48350-3_2
C401 Computing River Floods Using Massive Terrain Data
C. Alexander, L. Arge, P. K. Bøcher, M. Revsbæk, B. Sandel, J-C. Svenning, C. Tsirogiannis and J. Yang
Proc. Workshop on Massive Data Algorithmics (MASSIVE), 2015
C400 Fast Computation of Categorical Richness on Raster Data Sets and Related Problems
M. de Berg, C. Tsirogiannis and B.T. Wilkinson
Proc. Workshop on Massive Data Algorithmics (MASSIVE), 2015
C399 Fast Computation of Categorical Richness on Raster Data Sets and Related Problems
M. de Berg, C. Tsirogiannis and B.T. Wilkinson
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2015
10.1145/2820783.2820825
C398 I/O-Efficient Event Based Depression Flood Risk
L. Arge, M. Rav, S. Raza and M. Revsbæk
Proc. Workshop on Massive Data Algorithmics (MASSIVE), 2015
C397 Greedy Is an Almost Optimal Deque
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn and T. Saranurak
Proc. Workshop on Algorithms and Data Structures (WADS), 2015
10.1007/978-3-319-21840-3_13
C396 Pattern-Avoiding Access in Binary Search Trees
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn and T. Saranurak
Proc. Symposium on Foundations of Computer Science (FOCS), 2015
10.1109/FOCS.2015.32
C395 Self-Adjusting Binary Search Trees: What Makes Them Tick?
P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn and T. Saranurak
Proc. European Symposium on Algorithms (ESA), 2015
10.1007/978-3-662-48350-3_26
C394 Mechanisms with monitoring for truthful RAM allocation
A. Kovacs, U. Meyer, and C. Ventre
Proc. Conference on Web and Internet Economics (WINE), 2015
10.1007/978-3-662-48995-6_29
C393 Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
A. Backurs and P. Indyk
Proc. Symposium on the Theory of Computing (STOC), 2015
10.1145/2746539.2746612
C392 Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms
J. Acharya, I. Diakonikolas, C. Hegde, J. Z. Li and L. Schmidt
Proc. Symposium on Principles of Database Systems (PODS), 2015
10.1145/2745754.2745772
C391 Rapid Sampling for Visualizations with Ordering Guarantees
A. Kim, E. Blais, A. G. Parameswaran, P. Indyk, S. Madden and R. Rubinfeld
Proc. International Conference on Very Large Data Bases (VLDB), 2015
http://www.vldb.org/pvldb/vol8/p521-kim.pdf
C390 Practical and Optimal LSH for Angular Distance
A. Andoni, P. Indyk, T. Laarhoven, I. P. Razenshteyn and L. Schmidt
Proc. Advances in Neural Information Processing Systems (NIPS), 2015
https://papers.nips.cc/paper/5893-practical-and-optimal-lsh-for-angular-distance
C389 Seismic feature extraction using steiner tree methods
L. Schmidt, C. Hegde, P. Indyk, L. Lu, X. Chi and D. Hohl
Proc. International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015
10.1109/ICASSP.2015.7178250
C388 A Nearly-Linear Time Framework for Graph-Structured Sparsity
C. Hegde, P. Indyk and L. Schmidt
Proc. International Conference on Machine Learning (ICML), 2015
http://jmlr.org/proceedings/papers/v37/hegde15.html
C387 Sketching and Embedding are Equivalent for Norms.
A. Andoni, R. Krauthgamer and I. Razenshteyn
Proc. Symposium on the Theory of Computing (STOC), 2015
10.1145/2746539.2746552
C386 Robust Hierarchical k-Center Clustering
S. Lattanzi, S. Leonardi, V. Mirrokni and I. Razenshteyn
Proc. Innovations in Theoretical Computer Science (ITCS), 2015
10.1145/2688073.2688104
C385 Restricted Isometry Property for General p-Norms
Z. Allen-Zhu, R. Gelashvili and I. Razenshteyn
Proc. Symposium on Computational Geometry (SoCG), 2015
10.4230/LIPIcs.SOCG.2015.451
C384 Optimal Data-Dependent Hashing for Approximate Near Neighbors
A. Andoni and I. Razenshteyn
Proc. Symposium on Theory of Computing (STOC), 2015
10.1145/2746539.2746553
C383 An I/O-efficient Distance Oracle for Evolving Real-World Graphs
D. Ajwani, U.Meyer and D. Veith
Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2015
10.1137/1.9781611973754.14
C382 Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms
K. G. Larsen, J. Nelson and H. L. Nguyen
Proc. Symposium on Theory of Computing (STOC), 2015
10.1145/2746539.2746542
C381 Approximate Range Emptiness in Constant Time and Optimal Space
M. Goswami, A. Grønlund, K. G. Larsen and R. Pagh
Proc. Symposium on Discrete Algorithms (SODA), 2015
10.1137/1.9781611973730.52
C380 Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
W. Son and P. Afshani
Proc. Conference on Theory and Applications of Models of Computation (TAMC), 2015
10.1007/978-3-319-17142-5_17
C379 Scalable parallelization of skyline computation for multi-core processors
S. Chester, D. Sidlauskas, I. Assent and K. S. Bøgh
Proc. IEEE Conference on Data Engineering (ICDE), 2015
10.1109/ICDE.2015.7113358
C378 Maintaining Contour Trees of Dynamic Terrains
P. K. Agarwal, T. Mølhave, M. Revsbæk, I. Safa, Y. Wang and J. Yang.
Proc. Symposium on Computational Geometry (SoCG), 2015
10.4230/LIPIcs.SOCG.2015.796
C377 Dynamic Set Intersection
T. Kopelowitz, S. Pettie and E. Porat
Proc. Workshop on Algorithms and Data Structures (WADS), 2015
10.1007/978-3-319-21840-3_39
C376 (2Δ-1)-Edge Coloring is Much Easier than Maximal Matching in the Distributed Setting
M. Elkin, S. Pettie and H.-H. Su
Proc. Symposium on Discrete Algorithms (SODA), 2015
10.1137/1.9781611973730.26
C375 Sharp Bounds on Formation-free Sequences
S. Pettie
Proc. Symposium on Discrete Algorithms (SODA), 2015
10.1137/1.9781611973730.40
C374 A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
M. Elkin and S. Pettie
Proc. Symposium on Discrete Algorithms (SODA), 2015
10.1137/1.9781611973730.55
C373 Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
G. S. Brodal, J. S. Nielsen and J. Truelsen
Proc. Workshop on Algorithms and Data Structures (WADS), 2015
10.1007/978-3-319-21840-3_8
C372 Communication Complexity of Approximate Maximum Matching in Distributed Graph
Z. Huang, B. Radunovic, M. Vojnovic and Q. Zhang
Proc. Symposium on Theoretical Aspects of Computer Science (STACS), 2015
10.4230/LIPIcs.STACS.2015.460
C371 Simplifying massive planar subdivisions
L. Arge, J. Truelsen and J. Yang
Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2014
10.1137/1.9781611973198.3
C370 Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements
A. Ene and A. Vakilian
Proc. Symposium on Theory of Computing (STOC), 2014
10.1145/2591796.2591837
C369 Which Concepts are Worth Extracting?
A. Termehchy, A. Vakilian, Y. Chodpathumwan and M. Winslett
Proc. International Conference on the Management of Data (SIGMOD), 2014
10.1145/2588555.2610496
C368 Cooperative weakest link games
Y. Bachrach, O. Lev, S. Lovett, J. S. Rosenschein and M. Zadimoghaddam
Proc. International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2014
http://www.ifaamas.org/Proceedings/aamas2014/aamas/p589.pdf
C367 Particle Computation: Designing Worlds to Control Robot Swarms with Only Global Signals
A. Becker, E. D. Demaine, S. Fekete and J. McLurkin
Proc. International Conference on Robotics and Automation (ICRA), 2014
10.1109/ICRA.2014.6907856
C366 An End-To-End Approach to Making Self-Folded 3D Surface Shapes by Uniform Heating
B. An, S. Miyashita, M. T. Tolley, D. M. Aukes, L. Meeker, E. D. Demaine, M. L. Demaine, R. J. Wood and D. Rus
Proc. International Conference on Robotics and Automation (ICRA), 2014
10.1109/ICRA.2014.6907045
C365 Continuously Flattening Polyhedra Using Straight Skeletons
Z. Abel, E. D. Demaine, M. L. Demaine, J.-I. Itoh, A. Lubiw, C. Nara and J. O'Rourke
Proc. Symposium on Computational Geometry (SoCG), 2014
10.1145/2582112.2582171
C364 Fun with Fonts: Algorithmic Typography
E. D. Demaine and M. L. Demaine
Proc. International Conference on Fun with Algorithms (FUN), 2014
10.1007/978-3-319-07890-8_2
C363 Swapping Labeled Tokens on Graphs
K. Yamanaka, E. D. Demaine, T. Ito, J. Kawahara, M. Kiyomi, Y. Okamoto, T. Saitoh, A. Suzuki, K. Uchizawa and T. Uno
Proc. International Conference on Fun with Algorithms (FUN), 2014
10.1007/978-3-319-07890-8_31
C362 Playing Dominoes is Hard, Except by Yourself
E. D. Demaine, F. Ma and E. Waingarten
Proc. International Conference on Fun with Algorithms (FUN), 2014
10.1007/978-3-319-07890-8_12
C361 Classic Nintendo Games are (Computationally) Hard
G. Aloupis, E. D. Demaine, A. Guo and G. Viglietta
Proc. International Conference on Fun with Algorithms (FUN), 2014
10.1007/978-3-319-07890-8_4
C360 One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
E. D. Demaine, M. L. Demaine, S. P. Fekete, M. J. Patitz, R. T. Schweller, A. Winslow and D. Woods
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2014
10.1007/978-3-662-43948-7_31
C359 Canadians Should Travel Randomly
E. D. Demaine, Y. Huang, C.-S. Liao and K. Sadakane
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2014
10.1007/978-3-662-43948-7_32
C358 GHz-wide sensing and decoding using the sparse Fourier transform
H. Hassanieh, L. Shi, O. Abari, E. Hamed and D. Katabi
Proc. INFOCOM, 2014
10.1109/INFOCOM.2014.6848169
C357 Better embeddings for planar Earth-Mover Distance over sparse sets
A. Backurs and P. Indyk
Proc. Symposium on Computational Geometry (SoCG), 2014
10.1145/2582112.2582120
C356 Nearly Linear-Time Model-Based Compressive Sensing
C. Hegde, P. Indyk and L. Schmidt
Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2014
10.1007/978-3-662-43948-7_49
C355 A Fast Approximation Algorithm for Tree-Sparse Recovery
C. Hegde, P. Indyk and L. Schmidt
Proc. International Symposium on Information Theory (ISIT), 2014
10.1109/ISIT.2014.6875152
C354 Automatic Fault Localization Using the Generalized Earth Mover's Distance
L. Schmidt, C. Hegde, P. Indyk, J. Kane, L. Lu and D. Hohl
Proc. International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2014
10.1109/ICASSP.2014.6855186
C353 Sample-Optimal Fourier Sampling in Any Constant Dimension
P. Indyk and M. Kapralov
Proc. Symposium on Foundations of Computer Science (FOCS), 2014
10.1109/FOCS.2014.61
C352 On Streaming and Communication Complexity of the Set Cover Problem
E.D. Demaine, P. Indyk, S. Mahabadi and A. Vakilian
Proc. International Symposium Distributed Computing (DISC), 2014
10.1007/978-3-662-45174-8_33
C351 Composable Core-sets for Diversity and Coverage Maximization
P. Indyk, S.Mahabadi, M. Mahdian and V. S. Mirrokni
Proc. Symposium on Principles of Database Systems (PODS), 2014
10.1145/2594538.2594560
C350 Top-k Term-Proximity in Succinct Space
J. I. Munro, G. Navarro, J. S. Nielsen, R. Shah and S. V. Thankachan
Proc. International Symposium on Algorithms and Computation (ISAAC), 2014
10.1007/978-3-319-13075-0_14
C349 Almost-Tight Distributed Minimum Cut Algorithms
D. Nanongkai and H.-H. Su
Proc. International Symposium Distributed Computing (DISC), 2014
10.1007/978-3-662-45174-8_30
C348 Threesomes, Degenerates, and Love Triangles
A. Grønlund and S. Pettie
IEEE Symposium on Foundations of Computer Science (FOCS 2014), 2014
10.1109/FOCS.2014.72
C347 Robust Set Reconciliation
D. Chen, C. Konrad, K. Yi, W. Yu and Q. Zhang
Proc. International Conference on Management of Data (SIGMOD), 2014
10.1145/2588555.2610528
C346 Top-k point of interest retrieval using standard indexes.
A. Skovsgaard and C.S. Jensen
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2014
10.1145/2666310.2666399
C345 Hashcube: A Data Structure for Space- and Query-Efficient Skycube Compression
K. S. Bøgh, S. Chester, D. Sidlauskas and I. Assent
Proc. International Conference on Conference on Information and Knowledge Management (CIKM), 2014
10.1145/2661829.2661891
C344 Spatial Joins in Main Memory: Implementation Matters!
D. Sidlauskas and C. S. Jensen
Proc. International Conference on Very Large Data Bases (VLDB), 2014
http://www.vldb.org/pvldb/vol8/p97-sidlauskas.pdf
C343 New algorithms for computing phylogenetic biodiversity.
C.Tsirogiannis, B.Sandel and A. Kalvisa.
Proc. Workshop on Algorithms in Bioinformatics (WABI), 2014
10.1007/978-3-662-44753-6_15
C342 How to Influence People with Partial Incentives
E. D. Demaine, M. Hajiaghayi, H. Mahini, D. L. Malec, S. Raghavan, A. Sawant and M. Zadimoghaddam
Proc. International World Wide Web Conference (WWW), 2014
10.1145/2566486.2568039
C341 Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Z. Abel, E. D. Demaine, M. L. Demaine, D. Eppstein, A. Lubiw and R. Uehara
Proc. International Symposium on Graph Drawing (GD), 2014
10.1007/978-3-662-45803-7_23
C340 Approximation-Tolerant Model-Based Compressive Sensing
C. Hegde, P. Indyk and L. Schmidt
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.113
C339 Beyond Locality-Sensitive Hashing
A. Andoni, P. Indyk, H.L. Nguyen and I. Razenshteyn
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.76
C338 (Nearly) Sample-Optimal Sparse Fourier Transform
P. Indyk, M. Kapralov and E. Price
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.36
C337 GPU-based Computing of Repeated Range Queries over Moving Objects
C. Silvestri, F. Lettich, S. Orlando and C.S. Jensen
Proc. Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP), 2014
10.1109/PDP.2014.27
C336 Stochastic skyline route planning under time-varying uncertainty
B. Yang, C. Guo, C. S. Jensen, M. Kaul and S. Shang
Proc. International Conference on Data Engineering (ICDE), 2014
10.1109/ICDE.2014.6816646
C335 Using Cameras to Improve Wi-Fi Based Indoor Positioning
L Radaelli, Y. Moses and C.S. Jensen
Proc. International Symposium on Web and Wireless Geographical Information Systems (W2GIS), 2014
10.1007/978-3-642-55334-9_11
C334 Equivalence between Priority Queues and Sorting in External Memory
Z. Wei and K. Yi
Proc. European Symposium on Algorithms (ESA), 2014
10.1007/978-3-662-44777-2_68
C333 On the Scalability of Computing Triplet and Quartet Distances
M.K. Holt, J. Johansen and G.S. Brodal
Proc.Workshop on Algorithm Engineering and Experiments (ALENEX), 2014
10.1137/1.9781611973198.2
C332 Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)
D.Belazzougui, G. S. Brodal and J. S. Nielsen
Proc. Workshops on Algorithm Theory (SWAT), 2014
10.1007/978-3-319-08404-6_3
C331 Brief Announcement: A Distributed Minimum Cut Approximation Scheme
H.-H. Su
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014
10.1145/2612669.2612706
C330 (Near) Optimal Resource-Competitive Broadcast with Jamming
S. Gilbert, V. King, S. Pettie, E. Porat, J. Saia and M. Young
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014
10.1145/2612669.2612679
C329 Distributed Algorithms for the Lovász Local Lemma and Graph Coloring
K-M. Chung, S. Pettie and H.-H. Su
Proc. Symposium on Principles of Distributed Computing (PODC), 2014
10.1145/2611462.2611465
C328 The Communication Complexity of Distributed epsilon-Approximations
Z. Huang and K. Yi
Proc. Symposium on Foundations of Computer Science (FOCS), 2014
10.1109/FOCS.2014.69
C327 Amortized bounds for dynamic orthogonal range reporting
B. T. Wilkinson
Proc. European Symposium on Algorithms (ESA), 2014
10.1007/978-3-662-44777-2_69
C326 I/O-efficient Range Minima Queries
P. Afshani and N. Sitchinava
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2014
10.1007/978-3-319-08404-6_1
C325 Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
P. Afshani, T.M. Chan and K. Tsakalidis
Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2014
10.1007/978-3-662-43948-7_7
C324 Concurrent Range Reporting in Two-Dimensional Space
P. Afshani, C. Sheng, Y. Tao and B.T. Wilkinson
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.73
C323 Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges
P. Afshani and K. Tsakalidis
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.102
C322 Fast Computation of Output-Sensitive Maxima in a Word RAM
P. Afshani
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.104
C321 Optimal Planar Orthogonal Skyline Counting Queries
G. S. Brodal and K. G. Larsen
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2014
10.1007/978-3-319-08404-6_10
C320 On Hardness of Several String Indexing Problems
K.G. Larsen, I.J. Munro, J.S. Nielsen and S.V. Thankachan
Proc. Symposium on Combinatorial Pattern Matching (CPM), 2014
10.1007/978-3-319-07566-2_25
C319 Near-Optimal Labeling Schemes for Nearest Common Ancestors
S. Alstrup, E. B. Halvorsen and K.G. Larsen,
Proc. Symposium on Discrete Algorithms (SODA), 2014
10.1137/1.9781611973402.72
C318 A Clustering Approach to the Discovery of Points of Interest from Geo-Tagged Microblog Posts
A. Skovsgaard, D. Sidlauskas and C.S. Jensen
Proc. International Conference on Mobile Data Management (MDM), 2014
10.1109/ICDE.2014.6816647
C317 Scalable Top-k Spatio-Temporal Term Querying
A. Skovsgaard, D. Sidlauskas, and C.S. Jensen
Proc. International Conference on Data Engineering (ICDE), 2014
10.1109/ICDE.2014.6816647
C316 Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing
N. Sundaram, A. Turmukhametova, N. Satish, T. Mostak, P. Indyk, S. Madden and P. Dubey
Proc. International Conference on Very Large Data Bases (VLDB), 2013
http://www.vldb.org/pvldb/vol6/p1930-sundaram.pdf
C315 Variations on Instant Insanity
E.D. Demaine, M.L. Demaine, S. Eisenstat, T.D. Morgan and R. Uehara
Proc. Conference on Space Efficient Data Structures, Streams and Algorithms, 2013
C314 The Query Complexity of Finding a Hidden Permutation
P. Afshani, M. Agrawal, B. Doerr, C. Doerr, K. G. Larsen, K. Mehlhorn
Proc. Conference on Space Efficient Data Structures, Streams and Algorithms, 2013
C313 A Survey on Priority Queues
G.S. Brodal
Proc. Conference on Space Efficient Data Structures, Streams and Algorithms, 2013
C312 Bicriteria Online Matching: Maximizing Weight and Cardinality
N. Korula, V.S. Mirrokni and M. Zadimoghaddam
Proc. International Conference on Web and Internet Economics (WINE), 2013
C311 Revenue Maximization with Nonexcludable Goods
M. Bateni, N. Haghpanah, B. Sivan and M. Zadimoghaddam
Proc. International Conference on Web and Internet Economics (WINE), 2013
C310 Constrained Binary Identification Problem
A. Karbasi and M. Zadimoghaddam
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2013
10.4230/LIPIcs.STACS.2013.550
C309 Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's''
E.D. Demaine and M. Zadimoghaddam
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.99
C308 Algorithms for Designing Pop-Up Cards
Z. Abel, E.D. Demaine, M.L. Demaine, S. Eisenstat, A. Lubiw, A. Schulz, D. Souvaine, G. Viglietta and A. Winslow
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2013
10.4230/LIPIcs.STACS.2013.269
C307 Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM
S. Cannon, E.D. Demaine, M.L. Demaine, S. Eisenstat, M.J. Patitz, R. Schweller, S.M. Summers and A. Winslow
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2013
10.4230/LIPIcs.STACS.2013.172
C306 Combining Binary Search Trees
E.D. Demaine, J. Iacono, S. Langerman and O. Ozkan
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2013
C305 The two-handed tile assembly model is not intrinsically universal
E.D. Demaine, M.J. Patitz, T.A. Rogers, R.T. Schweller, S.M. Summers and D. Woods
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2013
C304 Blame Trees
E.D. Demaine, P. Panchekha, D. Wilson and E.Z. Yang
Proc. Algorithms and Data Structures Symposium (WADS), 2013
C303 Euclidean spanners in high dimensions
S. Har-Peled, P. Indyk and A. Sidiropoulos
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.57
C302 Shift Finding in Sub-linear Time
A. Andoni, H. Hassanieh, P. Indyk and D. Katabi
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.33
C301 Lower Bounds for Adaptive Sparse Recovery
E. Price and D. Woodruff
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.47
C300 Sample-optimal average-case sparse fourier transform in two dimensions
B. Ghazi, H. Hassanieh, P. Indyk, D. Katabi, E. Price and L. Shi
Proc. Allerton Conference, 2013
10.1109/Allerton.2013.6736670
C299 On Model-Based RIP-1 Matrices
P. Indyk and I. Razenshteyn
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2013
10.1007/978-3-642-39206-1_48
C298 Real-time recommendation of diverse related articles
S. Abbar, S. Amer-Yahia, P. Indyk and S. Mahabadi
Proc. International conference on World Wide Web (WWW), 2013
http://www2013.org/proceedings/p1.pdf
C297 The Constrained Earth Movers Distance Model, with Applications to Compressive Sensing
L. Schmidt, C. Hegde and P. Indyk
Proc. International Conference on Sampling Theory and Applications (SampTA), 2013
http://www.eurasip.org/Proceedings/Ext/SampTA2013/papers/p428-schmidt.pdf
C296 Compressive sensing using locality-preserving matrices
E. Grant and P. Indyk
Proc. Symposium on Computational Geometry (SoCG), 2013
C295 Diverse near neighbor problem
S. Abbar, S. Amer-Yahia, P. Indyk, S. Mahabadi and K.R. Varadarajan
Proc. Symposium on Computational Geometry (SoCG), 2013
C294 Nearly Optimal Linear Embeddings into Very Low Dimensions
E. Grant, C. Hegde and P. Indyk
Proc. Global Conference on Signal and Information Processing (GlobalSIP), 2013
http://people.csail.mit.edu/chinmay/files/papers/globalsip_embed.pdf
C293 iPark: Identifying Parking Spaces from Trajectories
B. Yang, N. Fantini and C.S. Jensen
Proc. International Conference on Extending Database Technology (EDBT), 2013
http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a63-yang.pdf
C292 Towards Context-Aware Search and Analysis on Social Media Data
L.R.A. Derczynski, B. Yang and C.S. Jensen
Proc. International Conference on Extending Database Technology (EDBT), 2013
http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a13-derczynski.pdf
C291 EcoTour: Reducing the Environmental Footprint of Vehicles Using Eco-Routes
O. Andersen, C.S. Jensen, K. Torp and B. Yang
Proc. International Conference on Mobile Data Management, 2013
C290 Hybrid Indoor Positioning With Wi-Fi and Bluetooth: Architecture and Performance
A. Baniukevic, C.S. Jensen and H. Lu
Proc. International Conference on Mobile Data Management, 2013
C289 Identifying Typical Movements Among Indoor Objects - Concepts and Empirical Study
L. Radaelli, D. Sabonis, H. Lu and C.S. Jensen
Proc. International Conference on Mobile Data Management, 2013
C288 Building Accurate 3D Spatial Networks to Enable Next Generation Intelligent Transportation Systems
M. Kaul, B. Yang and C.S. Jensen
Proc. International Conference on Mobile Data Management, 2013
C287 Routing Service Quality - Local Driver Behavior Versus Routing Services
V. Ceikute and C.S. Jensen
Proc. International Conference on Mobile Data Management, 2013
C286 Indoor Positioning using Wi-Fi - How Well Is the Problem Understood?
M.B. Kjærgaard, M.V. Krarup, A. Stisen, T.S. Prentow, H. Blunck, K. Grønbæk and C.S. Jensen
Proc. International Conference on Indoor Positioning and Indoor Navigation, 2013
C285 Trajectory Based Optimal Segment Computation in Road Network Databases
X. Li, V. Ceikute, C.S. Jensen and K.-L. Tan
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2013
10.1145/2525314.2525444
C284 Towards Fully Organic Indoor Positioning
L. Radaelli and C.S. Jensen
Proc. International Workshop on Indoor Spatial Awareness, 2013
C283 An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
A. Beckmann, U. Meyer, and D. Veith
Proc. European Symposium on Algorithms (ESA), 2013
C282 Improved space bounds for strongly competitive randomized paging algorithms
G. Moruz and A. Negoescu
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2013
C281 The Cost of Address Translation
T. Jurkiewicz and K. Mehlhorn
Proc. Workhop on Algorithm Engineering and Experiments (ALENEX), 2013
10.1137/1.9781611972931.13
C280 Morphing Planar Graph Drawings with a Polynomial Number of Steps
S. Alamdari, P. Angelini, T.M. Chan, G. Di Battista, F. Frati, A. Lubiw, M. Patrignani, V. Roselli, S. Singla and B.T. Wilkinson
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.119
C279 Adaptive and Approximate Orthogonal Range Counting
T. M. Chan and B. T. Wilkinson
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.18
C278 Compressed Static Functions with Applications
D. Belazzougui and R. Venturini
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.17
C277 Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
E. Verbin and W. Yu
Proc. Symposium on Combinatorial Pattern Matching (CPM), 2013
10.1007/978-3-642-38905-4_24
C276 The Space Complexity of 2-Dimensional Approximate Range Counting
Z. Wei and K. Yi
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.19
C275 I/O-Efficient Planar Range Skyline and Attrition Priority Queues
C. Kejlberg-Rasmusen, Y. Tao, J. Yoon, K. Tsichlas and K. Tsakalidis
Proc. Symposium on Principles of Database Systems (PODS), 2013
C274 Fast Distributed Coloring Algorithms for Triangle-Free Graphs
S. Pettie and H.-H. Su
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2013
C273 Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree
G.S. Brodal, R. Fagerberg, C.N.S Pedersen, T. Mailund and A. Sand
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.130
C272 A practical O(n·log2 n) time algorithm for computing the triplet distance on binary trees
A. Sand, G.S. Brodal, R. Fagerberg, C.N.S Pedersen and T. Mailund
Proc. Asia Pacific Bioinformatics Conference (APBC), 2013
C271 The Encoding Complexity of Two Dimensional Range Minimum Data Structures
G.S. Brodal, A. Brodnik and P. Davoodi
Proc. European Symposium on Algorithms (ESA), 2013
C270 Multiway simple cycle separators and I/O-efficient algorithms for planar graphs
L. Arge, F. van Walderveen and N. Zeh
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.65
C269 On (Dynamic) Range Maximum Queries in External Memory
L. Arge, J. Fischer, P. Sanders and N. Sitchinava
Proc. Algorithms and Data Structures (WADS), 2013
C268 Computing betweenness centrality in external memory
L. Arge, M.T. Goodrich and F. van Walderveen
Proc. IEEE International Symposium on Big Data, 2013
C267 RAM-Efficient External Memory Sorting
L. Arge and M. Thorup
Proc. International Symposium on Algorithms and Computation (ISAAC), 2013
10.1007/978-3-642-45030-3_46
C266 Algorithms for Computing Prominence on Grid Terrains
L. Arge, M de Berg and C. Tsirogiannis
Proc. International Conference on Advances in Geographic Information System (ACM-GIS), 2013
C265 An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
L. Arge, G.S. Brodal, J. Truelsen and C. Tsirogiannis
Proc. European Symposium on Algorithms (ESA), 2013
C264 Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
C. Tsirogiannis and B. Sandel
Proc. Workshop on Algorithms in Bioinformatics (WABI), 2013
C263 Uncovering the Missing Routes : An Algorithmic Study on the Illicit Antiquities Trade Network
Chr. Tsirogiannis and Con. Tsirogiannis
Proc. Annual Conference on Computer Applications and Quantitative Methods in Archaeology (CAA), 2013
C262 Succinct Sampling from Discrete Distributions
K. Bringmann and K.G. Larsen
Proc. ACM Symposium on Theory of Computing (STOC), 2013
C261 Near-Optimal Range Reporting Structures for Categorical Data
K.G. Larsen and F. van Walderveen
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.20
C260 Alliances and Bisection Width for Planar Graphs
M. Olsen and M. Revsbæk
Proc. International Workshop on Algorithms and Computation (WALCOM), 2013
C259 Spatial Keyword Querying (invited paper)
X. Cao, L. Chen, G. Cong, C. S. Jensen, Q. Qu, A. Skovsgaard, D. Wu and M. L. Yiu
Proc. International Conference on Conceptual Modeling (ER), 2012
10.1007/978-3-642-34002-4_2
C258 Upgrading Uncompetitive Products Economically
H. Lu and C. S. Jensen
Proc. International Conference on Data Engineering (ICDE), 2012
10.1109/ICDE.2012.92
C257 A Foundation for Efficient Indoor Distance-Aware Query Processing
H. Lu, X. Cao and C. S. Jensen
Proc. International Conference on Data Engineering (ICDE), 2012
10.1109/ICDE.2012.44
C256 Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads
D. Sidlauskas, S. Saltenis and C. S. Jensen
Proc. International Conference on the Management of Data (SIGMOD), 2012
10.1145/2213836.2213842
C255 Effective Caching of Shortest Paths for Location-Based Services
J. Rishede, M. L. Yiu and C. S. Jensen
Proc. International Conference on the Management of Data (SIGMOD), 2012
10.1145/2213836.2213872
C254 A Comparison of the Use of Virtual Versus Physical Snapshots for Supporting Update-Intensive Workloads
D. Sidlauskas, C. S. Jensenand S. Saltenis
Proc. International Workshop on Data Management on New Hardware (DaMoN), 2012
10.1145/2236584.2236585
C253 Cooperative Scalable Moving Continuous Query Processing
X. Li, P. Karras, L. Shi, K.-L. Tan and C. S. Jensen
Proc. International Conference on Mobile Data Management (MDM), 2012
10.1109/MDM.2012.20
C252 EcoMark: Evaluating Models of Vehicular Environmental Impact
C. Guo, Y. Ma, B. Yang, C. S. Jensen and M. Kaul
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2012
10.1145/2424321.2424356
C251 Efficiently Learning from Revealed Preference
M. Zadimoghaddam and A. Roth
Proc. International Workshop on Internet and Network Economics, 2012
10.1007/978-3-642-35311-6_9
C250 Approximating Shortest Paths in Spatial Social Networks
C. Ratti and C. Sommer
Proc. International Conference on Social Computing, 2012
10.1109/SocialCom-PASSAT.2012.132
C249 Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries
S. Lim, C. Sommer, E. Nikolova and D. Rus
Proc. Robotics: Science and Systems VIII, 2012
http://www.roboticsproceedings.org/rss08/p32.html
C248 Refold Rigidity of Convex Polyhedra
E. D. Demaine, M.L. Demaine, J-i. Itoh, A. Lubiw, C. Nara and J. O'Rourke
Proc. European Workshop on Computational Geometry, 2012
C247 Picture-Hanging Puzzles
E.D. Demaine, M.L. Demaine, Y. N. Minsky, J.S.B. Mitchell, R.L. Rivest and M. Patrascu
Proc. International Conference on Fun with Algorithms, 2012
10.1007/978-3-642-30347-0_11
C246 Shift Finding in Sub-linear Time
A. Andoni, H. Hassanieh, P. Indyk and D. Katabi
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.33
C245 Lower Bounds for Adaptive Sparse Recovery
E. Price and D. Woodruff
Proc. Symposium on Discrete Algorithms (SODA), 2013
10.1137/1.9781611973105.47
C244 Focal Plane Array Folding for Efficient Information Extraction and Tracking
L. Hamilton, D. Parker, C. Yu and P. Indyk
Proc. Applied Imagery Patterns Recognition Workshop (AIPR), 2012
10.1109/AIPR.2012.6528209
C243 Applications of the Shannon-Hartley Theorem to Data Streams and Sparse Recovery
E. Price and D. Woodruff
Proc. International Symposium on Information Theory (ISIT), 2012
10.1109/ISIT.2012.6283954
C242 Faster GPS Via the Sparse Fourier Transform
H. Hassanieh, F. Adib, D. Katabi and P. Indyk
Proc. International Conference on Mobile Computing and Networking (MOBICOM), 2012
10.1145/2348543.2348587
C241 Efficient and Reliable Low-Power Backscatter Networks
J. Wang, H. Hassanieh, D. Katabi and P. Indyk
Proc. International Conference on Mobile Computing and Networking (SIGCOMM), 2012
10.1145/2342356.2342364
C240 Approximating and Testing k-Histogram Distributions in Sub-linear Time
P. Indyk, R. Levi and R. Rubinfeld
Proc. Symposium on Principles of Database Systems (PODS), 2012
10.1145/2213556.2213561
C239 Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs
M. Wibral, P. Wollstadt, U. Meyer, N. Pampu, V.Priesemann and R. Vicente
Proc. International Confonference in Medicine & Biology Society (EMBC), 2012
10.1109/EMBC.2012.6346764
C238 Counting Arbitrary Subgraphs in Data Streams
D. Kane, K. Mehlhorn, T. Sauerwald and H. Sun
Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2012
10.1007/978-3-642-31585-5_53
C237 I/O-efficient Hierarchical Diameter Approximation
D. Ajwani, U. Meyer and D. Veith
Proc. European Symposium on Algorithms (ESA), 2012
10.1007/978-3-642-33090-2_8
C236 A parallel buffer tree
N. Sitchinava and N. Zeh
Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012
10.1145/2312005.2312046
C235 Audio Quality Assurance: An Application of Cross Correlation
B. Ammitzbøll Jurik and J.A.S. Nielsen
Proc. iPRES Conference, 2012
http://phaidra.univie.ac.at/o:294083
C234 Compressed String Dictionary Look-up with Edit Distance One
D. Belazzougui and R. Venturini
Proc. Symposium on Combinatorial Pattern (CPM), 2012
10.1007/978-3-642-31265-6_23
C233 Parikh matching in the streaming model
L. K. Lee, M. Lewenstein and Q. Zhang.
Proc. International Symposium on String Processing and Information Retrieval (SPIRE), 2012
10.1007/978-3-642-34109-0_35
C232 Efficient Communication Protocols for Deciding Edit Distance
H. Jowhari
Proc. European Symposium on Algorithms (ESA), 2012
10.1007/978-3-642-33090-2_56
C231 Linear-Space Data Structures for Range Minority Query in Arrays
T. M. Chan, S. Durocher, M. Skala, and B. T. Wilkinson
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2012
10.1007/978-3-642-31155-0_26
C230 Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
P. Afshani
Proc. ACM Symposium on Computational Geometry (SoCG), 2012
10.1145/2261250.2261301
C229 Lower Bounds for Sorted Geometric Queries in the I/O Model
P. Afshani and N. Zeh
Proc. European Symposium on Algorithms (ESA), 2012
10.1007/978-3-642-33090-2_6
C228 Fast Generation of Multiple Resolution Instances of Raster Data Sets
L. Arge, H. Haverkort and C. Tsirogiannis
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2012
10.1145/2424321.2424329
C227 Efficient Computation of Popular Phylogenetic Tree Measures
C. Tsirogiannis, B. Sandel and D. Cheliotis
Proc. Workshop on Algorithms in Bioinformatics (WABI), 2012
10.1007/978-3-642-33122-0_3
C226 Sparser Johnson-Lindenstrauss Transforms
D. M. Kane and J. Nelson
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.94
C225 Simultaneous approximations for adversarial and stochastic online budgeted allocation
V.S. Mirrokni, S. O. Gharan and M. Zadimoghaddam
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.134
C224 Directed Nowhere Dense Classes of Graphs
S. Kreutzer and S. Tazari
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.123
C223 Shortest-Path Queries for Complex Networks: Exploiting Low Tree-width Outside the Core
T. Akiba, C. Sommer and K-i Kawarabayashi
Proc. International Conference on Extending Database Technology (EDBT), 2012
10.1145/2247596.2247614
C222 Exact Distance Oracles for Planar Graphs
S. Mozes and C. Sommer
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.19
C221 Nearly Optimal Sparse Fourier Transform
H. Hassanieh, P. Indyk, D. Katabi and E. Price
Proc. Symposium on Theory of Computing (STOC), 2012
10.1145/2213977.2214029
C220 Simple and Practical Algorithm for Sparse Fourier Transform
H. Hassanieh, P. Indyk, D. Katabi and E. Price
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.93
C219 Engineering Efficient Paging Algorithms
G. Moruz, A. Negoescu, C. Neumann and V. Weichert
Proc. Symposium on Experimental Algorithms (SEA), 2012
10.1007/978-3-642-30850-5_28
C218 Outperforming LRU via Competitive Analysis on Parametrized Inputs for Paging
G. Moruz and A. Negoescu
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.132
C217 A structural analysis of the A5/1 state transition graph
A. Beckmann, J. Fedorowicz, J.Keller and U. Meyer
Proc. Workshop on Graph Inspection and Traversal Engineering (GRAPHite), 2012
10.4204/EPTCS.99.4
C216 I/O-efficient approximation of graph diameter by parallel cluster growing - a first experimental study
D. Ajwani, A. Beckmann, U. Meyer and D. Veith
Proc. Workshop on Parallel Systems and Algorithms (PASA), 2012
http://subs.emis.de/LNI/Proceedings/Proceedings200/493.pdf
C215 Two Dimensional Range Minimum Queries and Fibonacci Lattices
G.S Brodal, P. Davoodi, M. Lewenstein, R. Raman and S. S. Rao
Proc. European Symposium on Algorithms (ESA), 2012
10.1007/978-3-642-33090-2_20
C214 Strict Fibonacci Heaps
G.S. Brodal, G. Lagogiannis and R.E. Tarjan.
Proc. Symposium on Theory of Computing (STOC), 2012
10.1145/2213977.2214082
C213 Fully Persistent B-trees
G.S. Brodal, S. Sioutas, K. Tsakalidis and K. Tsichlas
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.51
C212 Succinct Representations of Binary Trees for Range Minimum Queries
P. Davoodi, R. Raman and S. S. Rao
Proc. International Computing and Combinatorics Conference (COCOON), 2012
10.1007/978-3-642-32241-9_34
C211 The Relationship between Inner Product and Counting Cycles
X. Sun, C. Wang and W. Yu
Proc. Latin American Theoretical Informatics Symposium (LATIN), 2012
10.1007/978-3-642-29344-3_54
C210 Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property
G.S. Brodal and C. Kejlberg-Rasmussen
Proc. Symposium on Theoretical Aspects of Computer Science (STACS), 2012
10.4230/LIPIcs.STACS.2012.112
C209 Finger search in the implicit model
G. S. Brodal, J. A. S. Nielsen and J. Truelsen
Proc. International Symposium on Algorithms and Computation (ISAAC), 2012
10.1007/978-3-642-35261-4_55
C208 Non-clairvoyant weighted flow time scheduling with rejection penalty
H.L. Chan, S.H. Chan, T.W. Lam, L.K. Lee, and J. Zhu
Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012
10.1145/2312005.2312050
C207 Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
E. Verbin and Q. Zhang
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2012
10.1007/978-3-642-31594-7_70
C206 Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
J. M. Phillips, E. Verbin and Q. Zhang
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.42
C205 Tight Bounds for Distributed Functional Monitoring
D.P. Woodruff and Q. Zhang
Proc. Symposium on Theory of Computing (STOC), 2012
10.1145/2213977.2214063
C204 Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
Z. Huang, K. Yi and Q. Zhang,
Proc. Symposium on Principles of Database Systems (PODS), 2012
10.1145/2213556.2213596
C203 Simplifying Massive Contour Maps
L. Arge, L. Deleuran, T. Mølhave, M. Revsbæk and J. Truelsen
Proc. European Symposium on Algorithms (ESA), 2012
10.1007/978-3-642-33090-2_10
C202 Higher Cell Probe Lower Bounds for Evaluating Polynomials
K. G. Larsen
Proc. Symposium on Foundations of Computer Science (FOCS), 2012
10.1109/FOCS.2012.21
C201 Improved Range Searching Lower Bounds
K. G. Larsen and H. L. Nguyen
Proc. Symposium on Computational Geometry (SoCG), 2012
10.1145/2261250.2261275
C200 Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model
P. Afshani, L. Arge and K. G. Larsen
Proc. Symposium on Computational Geometry (SoCG), 2012
10.1145/2261250.2261299
C199 The Cell Probe Complexity of Dynamic Range Counting
K. G. Larsen
Proc. Symposium on Theory of Computing (STOC), 2012
10.1145/2213977.2213987
C198 Linear-Space Data Structures for Range Mode Query in Arrays
T. M. Chan, S. Durocher, K. G. Larsen, J. Morrison and B. T. Wilkinson
Proc. Symposium on Theoretical Aspects of Computer Science (STACS), 2012
10.4230/LIPIcs.STACS.2012.290
C197 I/O-Efficient Data Structures for Colored Range and Prefix Reporting
K. G. Larsen and R. Pagh
Proc. Symposium on Discrete Algorithms (SODA), 2012
10.1137/1.9781611973099.49
C196 Computing betweenness centrality in external memory
L. Arge, M.T. Goodrich and F. van Walderveen
Workshop on Massive Data Algorithmics (MASSIVE), 2012
C195 Two-Dimensional Range Diameter
P. Davoodi, M. Smid and F. van Walderveen
Proc. Latin American Symposium on Theoretical Informatics (LATIN), 2012
10.1007/978-3-642-29344-3_19
C194 Embedding Stacked Polytopes on a Polynomial-Size Grid
E. D. Demaine and A. Schulz
Proc. Symposium on Discrete Algorithms (SODA), 2011
C193 Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor
E. D. Demaine, M. J. Patitz, R. T. Schweller and S. M. Summers
Proc. Symposium on Theoretical Aspects of Computer Science (STACS), 2011
C192 Contraction Decomposition in H-Minor-Free Graphs and Algorithmic Applications
E. D. Demaine, M. Hajiaghayi and K. Kawarabayashi
Proc. Symposium on Theory of Computing (STOC), 2011
C191 A generalization of the source unfolding of convex polyhedra
E. D. Demaine and A. Lubiw
Proc. Spanish Meeting on Computational Geometry, 2011
C190 Meshes preserving minimum feature size
G. Aloupis, E. D. Demaine, M. L. Demaine, V. Dujmovic and J. Iacono
Proc. Spanish Meeting on Computational Geometry, 2011
C189 O(1)-Approximations for Maximum Movement Problems
P. Berman, E. D. Demaine and M. Zadimoghaddam
Proc. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2011
C188 Lossless Fault-Tolerant Data Structures with Additive Overhead
P. Christiano, E. D. Demaine and S. Kishore
Proc. International Workshop on Algorithms and Data Structures (WADS), 2011
C187 Flattening Fixed-Angle Chains Is Strongly NP-Hard
E. D. Demaine and S. Eisenstat
Proc. International Workshop on Algorithms and Data Structures (WADS), 2011
C186 Algorithms for Solving Rubik's Cubes
E. D. Demaine, M. L. Demaine, S. Eisenstat, A. Lubiw and A. Winslow
Proc. European Symposium on Algorithms (ESA), 2011
C185 One-Dimensional Staged Self-Assembly
E. D. Demaine, S. Eisenstat, M. Ishaque and A. Winslow
Proc. International Conference on DNA Computing and Molecular Programming, 2011
C184 Folding Equilateral Plane Graphs
Z. Abel, E. D. Demaine, M. L. Demaine, S. Eisenstat, J. Lynch, T. B. Schardl and I. Shapiro-Ellowitz
Proc. International Symposium on Algorithms and Computation (ISAAC), 2011
C183 Online Stochastic Weighted Matching: Improved Approximation Algorithms
B. Haeupler, V. Mirrokni and M. Zadimoghaddam
Proc. Workshop on Internet & Network Economics, 2011
C182 Compression with Graphical Constraints: An Interactive Browser
A. Karbasi and M. Zadimoghaddam
Proc. International Symposium on Information Theory (ISIT), 2011
C181 Optimal-Time Adaptive Tight Renaming, with Applications to Counting
D. Alistarh, J. Aspnes, K. Censor-Hillel, S. Gilbert and M. Zadimoghaddam
Proc. Symposium on Principles of Distributed Computing (PODC), 2011
C180 Approximate Distance Queries for Weighted Polyhedral Surfaces
H. N. Djidjev and C. Sommer
Proc. European Symposium on Algorithms (ESA), 2011
C179 Sparse Spanners vs. Compact Routing
C. Gavoille and C. Sommer
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011
C178 Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus, and Minor-Free Graphs
K. Kawarabayashi, P. N. Klein and C. Sommer
Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2011
C177 Sparse recovery with partial support knowledge
D. B. Khanh and P. Indyk
Proc. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2011
C176 Almost Optimal Explicit Johnson-Lindenstrauss Transformations
D. M. Kane, R. Meka and J. Nelson
Proc. International Workshop on Randomization and Computation (RANDOM ), 2011
C175 Fast Moment Estimation in Data Streams in Optimal Space
D. M. Kane, J. Nelson, E. Porat and D. P. Woodruff
Proc. Symposium on Theory of Computing (STOC), 2011
C174 (1+eps)-approximate sparse recovery
E. Price and D. P. Woodruff
Proc. Symposium on Foundations of Computer Science (FOCS), 2011
C173 Compressive Sensing with Local Geometric Features
R. Gupta, P. Indyk, E. Price and Y. Rachlin
Proc. Symposium on Computational Geometry (SoCG), 2011
C172 On the Power of Adaptivity in Sparse Recovery
P. Indyk, E. Price and D. P. Woodruff
Proc. Symposium on Foundations of Computer Science (FOCS), 2011
C171 K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
P. Indyk and E. Price
Proc. Symposium on Theory of Computing (STOC), 2011
C170 Efficient Sketches for the Set Query Problem
E. Price
Proc. Symposium on Discrete Algorithms (SODA), 2011
C169 Approximate Counting of Cycles in Streams
M. Manjunath, K. Mehlhorn, K. Panagiotou and H. Sun
Proc. European Symposium on Algorithms (ESA), 2011
C168 New bounds for old algorithms: On the average-case behavior of classic single-source shortest path approaches
U. Meyer, A. Negoescu and V. Weichert
Proc. Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS), 2011
C167 The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems
E. Verbin and W. Yu
Proc. Symposium on Discrete Algorithms (SODA), 2011
C166 Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet
P. Davoodi and S. Srinivasa Rao
Proc. Theory and Applications of Models of Computation (TAMC), 2011
C165 Geometric Computations on Indecisive Points
A.G. Jørgensen, M. Loffler and J. Phillips
Proc. International Workshop on Algorithms and Data Structures (WADS), 2011
C164 Sleep management on multiple machines for energy and flow time
S.H. Chan, T.W. Lam, L.K. Lee, C.M. Liu and H.F. Ting
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2011
C163 Engineering a Topological Sorting Algorithm for Massive Graphs
D. Ajwani, A. Cosgaya-Lozano and N. Zeh
Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2011
C162 Edit Distance to Monotonicity in Sliding Windows
H.L. Chan, T.W. Lam, L.K. Lee, J. Pan, H.F. Ting and Q. Zhang
Proc. International Symposium on Algorithms and Computation (ISAAC), 2011
C161 Integer Representations towards Efficient Counting in the Bit Probe Model
G.S. Brodal, M. Greve, V. Pandey and S.S. Rao
Proc. Conference on Theory and Applications of Models of Computation (TAMC), 2011
C160 Dynamic Planar Range Maxima Queries
G.S. Brodal and K. Tsakalidis
Proc. International Colloquium on Automata, Languages, and Programming (ICALP), 2011
C159 Path Minima Queries in Dynamic Weighted Trees
G.S. Brodal, P. Davoodi, and S.S. Rao
Proc. Workshop on Algorithms and Data Structures (WADS), 2011
C158 OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
G.S. Brodal, G. Moruz, and A. Negoescu
Proc. Workshop on Approximation and Online Algorithms (WAOA), 2011
C157 Ordered and Unordered Top-K Range Reporting in Large Data Sets
P. Afshani, G.S. Brodal and N. Zeh
Proc. Symposium on Discrete Algorithms (SODA), 2011
C156 Improved Space Bounds for Cache-Oblivious Range Reporting
P. Afshani and N. Zeh
Proc. Symposium on Discrete Algorithms (SODA), 2011
C155 Computing Homotopic Line Simplification in a Plane
M. A. Abam, S. Daneshpajouh, L. Deleuran, S. Ehsani and M. Ghodsi
Proc. European Workshop on Computational Geometry (EuroCG), 2011
C154 Sorting, Searching, and Simulation in the MapReduce Framework
M.T. Goodrich, N. Sitchinava and Q. Zhang
Proc. International Symposium on Algorithms and Computation (ISAAC), 2011
C153 I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors
D. Ajwani, N. Sitchinava and N. Zeh
Proc. International Symposium on Parallel and Distributed Processing (IPDPS), 2011
C152 Flow on Noisy Terrains: An Experimental Evaluation
H.Haverkort and C. Tsirogiannis
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2011
C151 Exact and Approximate Computations of Watersheds on Triangulated Terrains
M. de Berg and C. Tsirogiannis
Proc. International Conference on Advances in Geographic Information Systems (ACM-GIS), 2011
C150 On Range Searching in the Group Model and Combinatorial Discrepancy
K. G. Larsen
Proc. Symposium on Foundations of Computer Science (FOCS), 2011
C149 Orthogonal Range Searching on the RAM, Revisited
T. M. Chan, K. G. Larsen and M. Patrascu
Proc. Symposium on Computational Geometry (SoCG), 2011
C148 (Approximate) Uncertain Skylines
P. Afshani, P. K. Agarwal, L. Arge, K. G. Larsen and J. M. Phillips
Proc. International Conference on Database Theory (ICDT), 2011
C147 Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures
A. G. Jorgensen and K. G. Larsen,
Proc. Symposium on Discrete Algorithms (SODA), 2011
C146 Sensing and Classifying Impairments of GPS Reception on Mobile Devices
H. Blunck, M. B. Kjærgaard and T. S. Toftegaard
Proc. International Conference on Pervasive Computing (Pervasive), 2011
C145 The Coin Problem and Pseudorandomness for Branching Programs
J. Brody and E. Verbin
Proc. Symposium on Foundations of Computer Science (FOCS), 2010
C144 Resilient kd-trees: K-means in space revisited
F. Gieseke, G. Moruz and J. Vahrenhold
Proc. Conference on Data Mining (ICDM), 2010
C143 D2-Tree: A New Overlay with Deterministic Bounds
G.S Brodal, Ss.Sioutas, K. Tsichlas and C. Zaroliagis
Proc. International Symposium on Algorithms and Computation (ISAAC), 2010
C142 Cleaning Massive Sonar Point Clouds
L. Arge, K. D. Larsen, T. Mølhave and F. van Walderveen
Proc. International Conference on Advances in Geographic Information System (ACM-GIS), 2010
C141 A Cache-oblivious Implicit Dictionary with the Working Set Property
G. S. Brodal, C. Kejlberg-Rasmussen and J. Truelsen
Proc. International Symposium on Algorithms and Computation (ISAAC), 2010
C140 Constant Price of Anarchy in Network Creation Games via Public Service Advertising
E.D. Demaine and M. Zadimoghaddam
Proc. International Workshop on Algorithms and Models for the Web-Graph, 2010
C139 Coverage with k-Transmitters in the Presence of Obstacles
B. Ballinger, N. Benbernou, P. Bose, M. Damian, E.D. Demaine, V. Dujmovic, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristan, D. Souvaine and R. Uehara
Proc. International Conference on Combinatorial Optimization and Applications (COCOA), 2010
C138 Submodular Secretary Problem and Extensions
M. Bateni, M.H. Hajiaghayi and M. Zadimoghaddam
Proc. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2010
C137 Minimizing the Diameter of a Network using Shortcut Edge
E.D. Demaine and M. Zadimoghaddam
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2010
C136 Basic Network Creation Games
N. Alon, E.D. Demaine, M. Hajiaghayi and T. Leighton
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010
C135 Collaborative Scoring in the Presence of Malicious Players
S. Gilbert, R. Guerraoui, F. Malakouti and M. Zadimoghaddam
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010
C134 Scheduling to Minimize Power Consumption using Submodular Functions
E.D. Demaine and M. Zadimoghaddam
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010
C133 Matching Points with Things
G. Aloupis, J. Cardinal, S. Collette, E.D. Demaine, M.L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara and P. Taslakian
Proc. Latin American Theoretical Informatics Symposium (LATIN), 2010
C132 Reconfigurable Asynchronous Logic Automata
N. Gershenfeld, D. Dalrymple, K. Chen, A. Knaian, F. Green, E.D. Demaine, S. Greenwald and P. Schmidt-Nielsen
Proc. Symposium on Principles of Programming Langauges (POPL), 2010
C131 Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
E.D. Demaine, M. Hajiaghayi and K. Kawarabayashi
Proc. Symposium on Discrete Algorithms (SODA), 2010
C130 Shape Replication Through Self-Assembly and RNase Enzymes
Z. Abel, N. Benbernou, M. Damian, E.D. Demaine, M.L. Demaine, R. Flatland, S. Kominers and R. Schwelle
Proc. Symposium on Discrete Algorithms (SODA), 2010
C129 Geometric Algorithms for Private-Cache Chip Multiprocessors
D. Ajwani, N. Sitchinava and N. Zeh
Proc. European Symposium on Algorithms (ESA), 2010
C128 On Space Efficient Two Dimensional Range Minimum Data Structures
G.S. Brodal, P. Davoodi and S.S. Rao
Proc. European Symposium on Algorithms (ESA), 2010
C127 I/O-Efficient Computation of Water Flow Across a Terrain
L. Arge, M. Revsbæk and Norbert Zeh
Proc. Symposium on Computational Geometry (SoCG), 2010
C126 Scalable Algorithms for Large High-Resolution Terrain Data
T. Mølhave, P.K. Agarwal, L. Arge and M. Revsbæk
Proc. International Conference on Computing for Geospatial Research & Application (COM.GEO), 2010
C125 I/O-Efficient Orthogonal Range Reporting in Three and Higher Dimensions
P. Afshani, L. Arge and K.D Larsen
Proc. Workshop on Massive Data Algorithmics (MASSIVE), 2010
C124 Orthogonal Range Reporting: Query Lower Bounds, Optimal Structures in 3-d, and Higher Dimensional Improvements
P. Afshani, L. Arge and K.D. Larsen
Proc. Symposium on Computational Geometry (SoCG), 2010
C123 Parallel external memory graph algorithms
L. Arge, M.T. Goodrich and N. Sitchinava
Proc. International Parallel & Distributed Processing Symposium (IPDPS), 2010
C122 Indoor Positioning using GPS Revisited
M.B. Kjærgaard, H. Blunck, T. Godsk, T. Toftkjær, D.L. Christensen, and K. Grønbæk
Proc. International Conference on Pervasive Computing (Pervasive), 2010
C121 New constructions of SSPDs and their applications
M.A. Abam and S. Har-Peled
Proc. Symposium on Computational Geometry (SoCG), 2010
C120 Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees
A. Kaporis, A.N. Papadopoulos, S. Sioutas, K. Tsakalidis and K. Tsichlas
Proc. International Conference on Database Theory (ICDT), 2010
C119 Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff
G.S. Brodal, E. Demaine, J. T. Fineman, J. Iacono, S. Langerman and J.I. Munro
Proc. Symposium on Discrete Algorithms (SODA), 2010
C118 Maximizing PageRank with new Backlinks
M. Olsen
Proc. International Conference on Algorithms and Complexity (CIAC), 2010
C117 Cell Probe Lower Bounds and Approximations for Range Mode
M. Greve, A.G. Jørgensen, K.D. Larsen and J. Truelsen
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2010
C116 Energy-Efficient Sorting using Solid State Disks
A. Beckmann, U. Meyer, P. Sanders and J. Singler
Proc. International IEEE Green Computing Conference, 2010
C115 On the Exact Space Complexity of Sketching and Streaming Small Norms
D.M. Kane, J. Nelson and D.P. Woodruff
Proc. Symposium on Discrete Algorithms (SODA), 2010
C114 Bounded Independence Fools Degree-2 Threshold Functions
I. Diakonikolas, D.M. Kane and J. Nelson
Proc. Symposium on Foundations of Computer Science (FOCS), 2010
C113 Fast Manhattan Sketches in Data Streams
J. Nelson and D.P. Woodruff
Proc. Symposium on Principles of Database Systems (PODS), 2010
C112 An Optimal Algorithm for the Distinct Elements Problem
D.M. Kane, J. Nelson and D.P. Woodruff
Proc. Symposium on Principles of Database Systems (PODS), 2010
C111 Efficiently Decodable Non-adaptive Group Testing
P. Indyk, H.Q. Ngo and A. Rudra
Proc. Symposium on Discrete Algorithms (SODA), 2010
C110 Lower Bounds for Sparse Recovery
K. Do Ba, P. Indyk, E. Price and D.P. Woodruff
Proc. Symposium on Discrete Algorithms (SODA), 2010
C109 Shortest Paths in Directed Planar Graphs with Negative Lengths: A Linear-Space O(n log2 n)-Time Algorithm
P. Klein, S. Mozes and O. Weimann
Proc. Symposium on Discrete Algorithms (SODA), 2009
C108 Fast RNA Structure Alignment for Crossing Input Structures
R. Backofen, G. Landau, M. Möhl, D. Tsur and O. Weimann
Proc. Symposium on Combinatorial Pattern Matching (CPM), 2009
C107 Computing the Girth of a Planar Graph in O(n log n) time
R. Yuster and O. Weimann
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C106 Sorting and Selection with Imprecise Comparisons
M. Ajtai, V. Feldman, A. Hassidim and J. Nelson
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C105 Efficient Reconfiguration of Lattice-Based Modular Robots
G. Aloupis, N. Benbernou, M. Damian, E. Demaine, R. Flatland, J. Iacono and S. Wuhrer
Proc. European Conference on Mobile Robots, 2009
C104 A Distributed Boundary Detection Algorithm for Multi-Robot Systems
J. McLurkin and E. Demaine
Proc. International Conference on Intelligent Robots and Systems, 2009
C103 The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
J. Cardinal, E. Demaine, S. Fiorini, G. Joret, I. Newman and O. Weimann
Proc. Workshop on Internet and Network Economics (WINE), 2009
C102 The Price of Anarchy in Cooperative Network Creation Games
E. Demaine, M. Hajiaghayi, H. Mahini and M. Zadimoghaddam
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2009
C101 Additive Approximation Algorithms for List-Coloring Minor-Closed Class of Graphs
E. Demaine, K. Kawarabayashi and M. Hajiaghayi
Proc. Symposium on Discrete Algorithms (SODA), 2009
C100 The Geometry of Binary Search Trees
E. Demaine, D. Harmon, J. Iacono, D. Kane and M. Patrascu
Proc. Symposium on Discrete Algorithms (SODA), 2009
C99 Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
E. Demaine, G. Borradaile and S. Tazari
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2009
C98 Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
E. Demaine, M. Hajiaghayi and P. Klein
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C97 Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
E. Demaine, M. Hajiaghayi and K. Kawarabayashi
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C96 Reconfiguration of List Edge-Colorings in a Graph
T. Ito, M. Kaminski and E. Demaine
Proc. Algorithms and Data Structures Symposium (WADS), 2009
C95 A Pseudopolynomial algorithm for Alexandrov's Theorem
E. Demaine, D. Kane and G. Price
Proc. Algorithms and Data Structures Symposium (WADS), 2009
C94 Minimal Locked Trees
B. Ballinger, D. Charlton, E. Demaine, M. Demaine, J. Iacono, C-H. Liu and S-H. Poon
Proc. Algorithms and Data Structures Symposium (WADS), 2009
C93 Minimizing Movement: Fixed-Parameter Tractability
E. Demaine, M. Hajiaghayi, and D. Marx
Proc. European Symposium on Algorithms (ESA), 2009
C92 Algorithmic Folding Complexity
J. Cardinal, E. Demaine, M. Demaine, S. Imahori, S. Langerman and R. Uehara
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C91 Folding a Better Checkerboard
E. Demaine, M. Demaine, G. Konjevod and R. Lang
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C90 External Sampling
A. Andoni, P. Indyk, K. Onak and R. Rubinfeld
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C89 Efficient Sketches for Earth-Mover Distance, with Applications
A. Andoni, K. Do Ba, P. Indyk and D. Woodruff
Proc. Symposium on Foundations of Computer Science (FOCS), 2009
C88 Sequential Sparse Matching Pursuit
R. Berinde and P. Indyk
Proc. Allerton Conference, 2009
C87 Overcoming the L1 Non-embeddability Barrier: Algorithms for Product Metrics
A. Andoni, P. Indyk and R. Krauthgamer
Proc. Symposium on Discrete Algorithms (SODA), 2009
C86 Approximate Line Nearest Neighbor in High Dimensions
A. Andoni, P. Indyk, R. Krauthgamer and H.L. Nguyen
Proc. Symposium on Discrete Algorithms (SODA), 2009
C85 I/O-Efficient Contour Tree Simplification
L. Arge and M. Revsbæk
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C84 Parallel External Memory Model
L. Arge, M.T. Goodrich and N. Sitchinava
Proc. Workshop on Theory and Many-Cores, 2009
C83 Instance-optimal Geometric Algorithms
P. Afshani, J. Barbay and T. Chan
Proc Symposium on Foundations of Computer Science (FOCS), 2009
C82 Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space
P. Afshani, C. Hamilton and N. Zeh
Proc. Symposium on Computational Geometry (SoCG), 2009
C81 A Unified Approach for Cache-Oblivious Range Reporting and Approximate Range Counting
P. Afshani, C. Hamilton and N. Zeh
Proc. Symposium on Computational Geometry (SoCG), 2009
C80 Orthogonal Range Reporting in Three and Higher Dimensions
P. Afshani, L. Arge and K. Dalgaard Larsen
Proc Symposium on Foundations of Computer Science (FOCS), 2009
C79 Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
M. de Berg and P. Hachenberger
Proc. International Symposium on Experimental Algorithms (SEA), 2009
C78 Impacts of 21st Century Sea-level Rise on a Danish Major City - An Assessment Based on Fine-resolution Digital Topography and a New Flooding Algorithm
J. E. Moeslund, P. K. Bøcher, J.-C. Svenning, T. Mølhave and L. Arge
IOP Conference Series: Earth and Environmental Science 8, 2009
C77 More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
R. Grossi, A. Orlandi, R. Raman and S. Srinivasa Rao
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2009
C76 Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes
R. Pagh and S. Srinivasa Rao
Proc. Symposium on Principles of Database Systems (PODS), 2009
C75 Universal Succinct Representations of Trees?
A. Farzan, R. Raman and S. Srinivasa Rao
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C74 On P-complete Problems in Memory Hierarchy Models
D. Ajwani
Proc. Workshop on Massive Data Algorithmics (MASSIVE), 2009
C73 On the Power of the Semi-Separated Pair Decomposition
M. Abam, P. Carmi, M. Farshi and M. Smid
Proc. Algorithms and Data Structures Symposium (WADS), 2009
C72 Kinetic Spanners in Rd
M. Abam and M. de Berg
Proc. Symposium on Computational Geometry (SoCG), 2009
C71 Geometric Spanners for Weighted Point Sets
M. Abam, M. de Berg, M. Farshi, J. Gudmundsson and M. Smid
Proc. European Symposium on Algorithms (ESA), 2009
C70 Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees
A. Kaporis, A.N. Papadopoulos, S. Sioutas, K. Tsakalidis and K. Tsichlas
Proc. International Conference on Database Theory (ICDT), 2009
C69 Fault Tolerant External Memory Algorithms
G. S. Brodal, A. Jørgensen and T. Mølhave
Proc. Algorithms and Data Structures Symposium (WADS), 2009
C68 Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
G. S. Brodal, A. Kaporis, S. Sioutas, K. Tsakalidis and K. Tsichlas
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C67 Online Sorted Range Reporting
G. S. Brodal, R. Fagerberg, M. Greve and A. López-Ortiz
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C66 Data Structures for Range Median Queries
G. S. Brodal and A. Jørgensen
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C65 Building a Parallel Pipelined External Memory Algorithm Library
A. Beckmann, R. Dementiev and J. Singler
Proc. International Symposium on Parallel and Distributed Processing (IPDPS), 2009
C64 Breadth First Search on Massive Graphs
D. Ajwani, R. Dementiev, U. Meyer and V. Osipov
Proc. Ninth DIMACS Implementation Challenge: The Shortest Path Problem, 2009
C63 Via Detours to I/O-Efficient Shortest Paths
U. Meyer
Proc. Efficient Algorithms - Essays dedicated to Kurt Mehlhorn on the Occasion of his 60th birthday, 2009
C62 Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
U. Meyer and V. Osipov
Proc. Workshop on Algorithm Engineering and Experiments (ALENEX), 2009
C61 On Computational Models for Flash Memory Devices
D. Ajwani, A. Beckmann, R. Jacob, U. Meyer and G. Moruz
Proc. Symposium on Experimental Algorithms (SEA), 2009
C60 Counting in the Presence of Memory Faults
G. Brodal, A. Jørgensen, G. Moruz and T. Mølhave
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C59 Online Paging for Flash Memory Devices
A. Kovacs, U. Meyer, G. Moruz and A. Negoescu
Proc. International Symposium on Algorithms and Computation (ISAAC), 2009
C58 A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
D. Hermelin, G. M. Landau, S. Landau and O. Weimann
Proc. International Symposium on Theoretical Aspects of Computer Science (STACS), 2009
C57 On Cartesian Trees and Range Minimum Queries
E. Demaine, G. Landau and O. Weimann
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2009
C56 Recovery of Clustered Sparse Signal from Compressive Measurements
V. Cevher, C. Hegde, P. Indyk and R. G. Baraniuk
Proc. International Conference on Sampling Theory and Applications (SAMPTA), 2009
C55 Space-optimal Heavyhitters with Strong Error Bounds
R. Berinde, G. Cormode, P. Indyk and M. Strauss
Proc. Symposium on Principles of Database Systems (PODS), 2009
C54 Fault-Tolerant Conflict-Free Coloring
M.A. Abam, M. de Berg, and S-H. Poon
Proc. Canadian Conference on Computational Geometry, 2008
C53 Combining Geometry and Combinatorics: A Unified Approach to Sparse Signal Recovery (invited paper)
R. Berinde, A. Gilbert, P. Indyk, H. Karloff and M. Strauss
Proc. Allerton Conference, 2008
C52 Practical Near-Optimal Sparse Recovery in the L1 Norm (invited paper)
R. Berinde, P. Indyk and M. Ruzic
Proc. Allerton Conference, 2008
C51 Compressing Binary Decision Diagrams
E. R. Hansen, S. S. Rao and P. Tiedemann
European Conference on Artificial Intelligence (ECAI), 2008
C50 Hinged Dissections Exist
E. Demaine, T. G. Abbott, Z. Abel, D. Charlton, M. L. Demaine and S. D. Kominers
Proc. Symposium on Computational Geometry (SoCG), 2008
C49 Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
E. Demaine, M. Buadoiu, M. Hajiaghayi, A. Sidiropoulos and M. Zadimoghaddam
Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2008
C48 Reconfiguration of Cube-Style Modular Robots Using O(log n) Parallel Moves
E. Demaine, G. Aloupis, S. Collette, S. Langerman, V. Sacristan and S. Wuhrer
Proc. International Symposium on Algorithms and Computation (ISAAC), 2008
C47 On the Complexity of Reconfiguration Problems
E. Demaine, T. Ito, Ni. J. A. Harvey, C. H. Papadimitriou, M. Sideri, R. Uehara and Yushi Uno
Proc. International Symposium on Algorithms and Computation (ISAAC), 2008
C46 Tight Lower Bounds for Selection in Randomly Ordered Streams
A. Chakrabarti, T.S. Jayram and M. Patrascu
Proc. Symposium on Discrete Algorithms (SODA), 2008
C45 Finding an Optimal Tree Searching Strategy in Linear Time
S. Mozes, K. Onak and Oren Weimann
Proc. Symposium on Discrete Algorithms (SODA), 2008
C44 Dynamic Connectivity: Connecting to Networks and Geometry
T. Chan, M. Patrascu and L. Roditty
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C43 Hardness of Nearest Neighbor under L-infinity
A. Andoni, D. Croitoru and M. Patrascu
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C42 Sketching and Streaming Entropy via Approximation Theory
N. J. A. Harvey, J. Nelson and K. Onak
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C41 Inapproximability for metric embeddings into Rd
J. Matousek and A. Sidiropoulos
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C40 Circular Partitions with Applications to Visualization and Embeddings
K. Onak and A. Sidiropoulos
Proc. Symposium on Computational Geometry (SoCG), 2008
C39 Declaring Independence via the Sketching of Sketches
P. Indyk and A. McGregor
Proc. Symposium on Discrete Algorithms (SODA), 2008
C38 Earth Mover Distance over High-Dimensional Spaces
A. Andoni, P. Indyk and R. Krauthgamer
Proc. Symposium on Discrete Algorithms (SODA), 2008
C37 Explicit Constructions for Compressed Sensing of Sparse Signals
P. Indyk
Proc. Symposium on Discrete Algorithms (SODA), 2008
C36 On Distributing Symmetric Streaming Computations
J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein and Z. Svitkina
Proc. Symposium on Discrete Algorithms (SODA), 2008
C35 I/O-efficient Algorithms for Computing Contour Lines on a Terrain
P.K. Agarwal, L. Arge, T. Mølhave and B. Sadri
Proc. Symposium on Computational Geometry (SoCG), 2008
C34 Cache-Oblivious Red-Blue Line Segment Intersection
L. Arge, T. Mølhave and N. Zeh
Proc. European Symposium on Algorithm (ESA), 2008
C33 Fundamental Parallel Algorithms for Private-Cache Chip Multiprocessors
L. Arge, M.T. Goodrich, M. Nelson and N. Sitchinava
Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), 2008
C32 A Simple and Efficient Kinetic Spanner
M.A. Abam, M. de Berg and J. Gudmundsson
Proc. Symposium on Computational Geometry (SoCG), 2008
C31 The Computational Complexity of Link Building
M. Olsen
Proc. International Conference on Computing and Combinatorics (COCOON), 2008
C30 On the Redundancy of Succinct Data Structures
A. Golynski, R. Raman and S. S. Rao
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2008
C29 External Memory Planar Point Location with Logarithmic Updates
L. Arge, G. S. Brodal and S. S. Rao
Proc. Symposium on Computational Geometry (SoCG), 2008
C28 Selecting Sums in Arrays
G. S. Brodal and A. G. Jørgensen
Proc. International Symposium on Algorithms and Computation (ISAAC), 2008
C27 On Trade-Offs in External-Memory Diameter Approximation
U. Meyer
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2008
C26 On Dynamic Breadth-First Search in External-Memory
U. Meyer
Proc. Symposium on Theoretical Aspects (STACS), 2008
C25 Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
D. Ajwani, I. Malinger, U. Meyer and S. Toledo
Proc. Workshop on Experimental Algorithms (WEA), 2008
C24 Confluently Persistent Tries for Efficient Version Control
E. Demaine, S. Langerman and E. Price
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), 2008
C23 Succincter
M. Patrascu
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C22 (Data) STRUCTURES
M. Patrascu
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C21 Near-Optimal Sparse Recovery in the L1 norm
M. Ruzic and P. Indyk
Proc. Symposium on Foundations of Computer Science (FOCS), 2008
C20 Nash Stability in Additively Separable Hedonic Games is NP-hard
M. Olsen
Proc. Conference on Computability in Europe (CiE), 2007
C19 On the Size of Succinct Indices
A. Golynski, R. Grossi, A. Gupta, R. Raman and S. S. Rao
Proc. European Symposium on Algorithms (ESA), 2007
C18 Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
M. A. Bender, G. S. Brodal, R. Fagerberg, R. Jacob and E. Vicari
Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007
C17 The ComBack Method - Extending Hash Compaction with Backtracking
M. Westergaard, L. M. Kristensen, G. S. Brodal and L. Arge
Proc. International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency (ICATPN), 2007
C16 Multiple pass streaming algorithms for learning mixtures of distributions in Rd
K. Chang
Proc. Algorithmic Learning Theory (ALT), 2007
C15 Average-Case Analysis of Online Topological Ordering
T. Friedrich and D. Ajwani
Proc. International Symposium on Algorithms and Computation (ISAAC), 2007
C14 Indexing a Dictionary for Subset Matching Queries
G. M. Landau, D. Tsur and O. Weimann
Proc. Symposium on String Processing and Information Retrieval (SPIRE), 2007
C13 Lower Bounds for 2-Dimensional Range Counting
M. Patrascu
Proc. ACM Symposium on Theory of Computing (STOC), 2007
C12 Scheduling to Minimize Gaps and Power Consumption
E. D. Demaine, M. Ghodsi, M. Hajiaghayi, A. S. Sayedi-Roshkhar and M. Zadimoghaddam
Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007
C11 Cache-Oblivious Streaming B-trees
M. A. Bender, M. Farach-Colton, J. T. Fineman, Y. Fogel, B. C. Kuszmaul and J. Nelson
Proc. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007
C10 An Optimal Decomposition Algorithm for Tree Edit Distance
E. D. Demaine, S. Mozes, B. Rossman and O. Weimann
Proc. International Colloquium on Automata, Languages and Programming (ICALP), 2007
C9 Radix Sorting With No Extra Space
G. Franceschini, S. Muthukrishnan, and M. Patrascu
Proc. European Symposium on Algorithms (ESA), 2007
C8 Planning for Fast Connectivity Updates
M. Patrascu and Mikkel Thorup
Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 2007
C7 TerraStream: From Elevation Data to Watershed Hierarchies
P. K. Agarwal, L. Arge, A. Danner, H. Mitasova, T. Mølhave and K. Yi
Proc. ACM International Symposium on Advances in Geographical Information Systems (ACM-GIS), 2007
C6 Optimal Resilient Dynamic Dictionaries
G. S. Brodal, R. Fagerberg, I. Finocchi, F. Grandoni, G. Italiano, A. G. Jørgensen, G. Moruz and T. Mølhave
Proc. European Symposium on Algorithms (ESA), 2007
C5 Resilient Priority Queues
G. Jørgensen, G. Moruz and T. Mølhave
Proc. International Workshop on Algorithms and Data Structures (WADS), 2007
C4 Dynamic Matchings in Convex Bipartite Graphs
G. S. Brodal, L. Georgiadis, K. A. Hansen and I. Katriel
Proc. International Symposium on Mathematical Foundations of Computer Science (MFCS), 2007
C3 A Linear Time Algorithm for the k Maximal Sums Problem
G. S. Brodal and A. G. Jørgensen
Proc. International Symposium on Mathematical Foundations of Computer Science (MFCS), 2007
C2 Sketching Information Divergences
S. Guha, P. Indyk and A. McGregor
Proc. Annual Conference on Learning Theory (COLT), 2007
C1 Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
B. Escoffier, G. Moruz and A. Ribichini
Proc. International Symposium on Mathematical Foundations of Computer Science (MFCS), 2007

Journal publications

J204 Succinct Dynamic Cardinal Trees
D. Arroyuelo, P. Davoodi and S.S. Rao
Algorithmica 74(2), 2016
10.1007/s00453-015-9969-x
J203 Phylogenetic assemblage structure of North American trees is more strongly shaped by glacial-interglacial climate variability in gymnosperms than in angiosperms
Z. Ma, B. Sandel and J.-C. Svenning
Ecology and Evolution 6, 2016
10.1002/ece3.2100
J202 Genetic, spatial, and social relationships among adults in a group of Howler Monkeys (Alouatta palliata) from Barro Colorado Island, Panama
K. Milton, D.A. Nolin, K. Ellis, J. Lozier, B. Sandel and E. Lacey
Primates 57, 2016
10.1007/s10329-016-0523-5
J201 Climate and topography explain range sizes of terrestrial vertebrates
Y. Li, X. Li, B. Sandel, D. Blank, Z. Liu, X. Liu and S. Yan.
Nature Climate Change 6, 2016
10.1038/nclimate2895
J200 Patterns and drivers of plant functional group dominance across the Western Hemisphere - a macroecological re-assessment based on a massive novel botanical dataset
K. Engemann, B. Sandel, B.J. Enquist, P.M. Jørgensen, N.J.B. Kraft, A. Marcuse-Kubitza, B. McGill, N. Morueta-Holme, R.K. Peet, C. Violle, S. Wiser and J.-C. Svenning
Botanical Journal of the Linnean Society 180, 2016
10.1111/boj.12362
J199 Delineating probabilistic species pools in ecology and biogeography
D. N. Karger, A. Cord, M. Kessler, H. Kreft, I. Kühn, S. Pompe, B. Sandel, J. Sarmento-Cabral, A. Smith, J.-C. Svenning, H. Tuomisto, P. Weigelt and K. Wesche
Global Ecology and Biogeography 25, 2016
10.1111/geb.12422
J198 Megafauna extinction, tree species range reduction, and carbon storage in Amazonian forests
C. Doughty, A. Wolf, N. Morueta-Holme, P.M. Jørgensen, B. Sandel, C. Violle, B. Boyle, N.J.B. Kraft, R.K. Peet, B.J. Enquist, J.-C. Svenning, S. Blake and M. Galetti
Ecography 39, 2016
10.1111/ecog.01587
J197 High plant endemism in China is partially linked to reduced glacial-interglacial climate change
G. Feng, L. Mao, B. Sandel, N.G. Swenson and J.-C. Svenning
Journal of Biogeography 43, 2016
10.1111/jbi.12613
J196 High proportion of smaller-ranged hummingbird species coincides with ecological specialization across the Americas
J. Sonne, A.M. Martin González, P.K. Maruyama, B. Sandel, S. Abrahamczyk, R. Alarcon, A.C. Araujo, F.P. Araujo, S.M. de Azevedo Jr., A.C. Baquero, D. Nogues-Bravo, P.A. Cotton., T.T. Ingversen, G. Kohler, C. Lara, F.M.G. Las-Casas, A.O. Machado, C.G. Machado, M.A. Maglianesi, A.C. Moura, G.M. Olivera, P.E.Oliveira, J.F. Ornelas, L. da Cruz Rodrigues, L. Rosero-Lasprilla, A.M. Rui, M. Sazima, M. Schleuning, A. Timmermann, I.G. Varassin, J. Vinzentin-Bugoni, Z. Wang, S. Watts, J. Fjeldså, J.-C. Svenning, C. Rahbek and B. Dalsgaard
Proceedings of the Royal Society B,. 283, 2016
10.1098/rspb.2015.2512
J195 Reply to Rubenstein and Rubenstein: Time to move on from ideological debates on rewilding
J-C. Svenning, P.B.M. Pedersen, C.J. Donlan, R. Ejrnaes, S. Faurby, M. Galetti, D.M. Hansen, B. Sandel, C.J. Sandom, J.W. Terborgh and F.W.M. Vera
Proceedings of the National Academy of Sciences, USA 113, 2016
10.1073/pnas.1521891113
J194 Science for a wilder Anthropocene - synthesis and future directions for rewilding research
J-C. Svenning, P.B.M. Pedersen, C.J. Donlan, R. Ejrnaes, S. Faurby, M. Galetti, D.M. Hansen, B. Sandel, C.J. Sandom, J.W. Terborgh and F.W.M. Vera
Proceedings of the National Academy of Sciences, 113, 2016
10.1073/pnas.1502556112
J193 Folding a paper strip to minimize thickness
E.D. Demaine, D. Eppstein, A. Hesterberg, H. Ito, A. Lubiw, R. Uehara and Y. Uno
Journal of Discrete Algorithms 36, 2016
10.1016/j.jda.2015.09.003
J192 The Two-Handed Tile Assembly Model is not Intrinsically Universal
E.D. Demaine, M.J. Patitz, T.A. Rogers, R.T. Schweller, S.M. Summers and D. Woods
Algorithmica 74(2), 2016
10.1007/s00453-015-9976-y
J191 Linear-time algorithm for sliding tokens on trees
E. D. Demaine, M. L. Demaine, E. Fox-Epstein, D. A. Hoang, T. Ito, H. Ono, Y. Otachi, R. Uehara and T. Yamada
Theoretical Computer Science 600, 2015
10.1016/j.tcs.2015.07.037
J190 Fun with Fonts: Algorithmic Typography
E. D. Demaine and M. L. Demaine
Theoretical Computer Science 586, 2015
10.1016/j.tcs.2015.01.054
J189 Zig-Zag Numberlink is NP-Complete
A. B. Adcock, E. D. Demaine, M. L. Demaine, M. P. O'Brien, F. Reidl, F. S. Villaamil and B. D. Sullivan
Journal of Information Processing 23(3), 2015
10.2197/ipsjjip.23.239
J188 Swapping Labeled Tokens on Graphs
K. Yamanaka, E. D. Demaine, T. Ito, J. Kawahara, M. Kiyomi, Y. Okamoto, T. Saitoh, A. Suzuki, K. Uchizawa and T. Uno
Theoretical Computer Science 586, 2015
10.1016/j.tcs.2015.01.052
J187 Classic Nintendo Games are (Computationally) Hard
G. Aloupis, E. D. Demaine, A. Guo and G. Viglietta
Theoretical Computer Science 586, 2015
10.1016/j.tcs.2015.02.037
J186 You Should Be Scared of German Ghost
E. D. Demaine, F. Ma, M. Susskind and E. Waingarten
Journal of Information Processing 23(3), 2015
http://doi.org/10.2197/ipsjjip.23.293
J185 Approximation Algorithms for Model-Based Compressive Sensing
C. Hegde, P. Indyk and L. Schmidt
IEEE Transactions of Information Theory 61(9), 2015
10.1109/TIT.2015.2457939
J184 A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions
P. Wollstadt, U. Meyer, and M. Wibral
PLoS ONE, 10(10), 2015
10.1371/journal.pone.0140530
J183 Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures
J. Brody and K. G. Larsen
Theory of Computing 11(19), 2015
10.4086/toc.2015.v011a019
J182 OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm,
G. S. Brodal, G. Moruz and A. Negoescu
Theory of Computing Systems 56(1), 2015
10.1007/s00224-012-9427-y
J181 RAM-efficient External Memory Sorting
L. Arge and M. Thorup
Algoritmica 73(4), 2015
10.1007/s00453-015-0032-8
J180 Geographical imbalances and divides in the scientific production of climate change knowledge
M. Pasgaard, N. Strange, B. Dalsgaard, P.K.M. Mendonça and B. Sandel
Global Environmental Change 35, 2015
10.1016/j.gloenvcha.2015.09.018
J179 The influence of paleoclimate on present-day patterns in biodiversity and ecosystems.
J-C. Svenning, W. Eiserhardt, S. Normand, A. Ordonez and B. Sandel
Annual Reviews in Ecology, Evolution and Systematics 46, 2015
10.1146/annurev-ecolsys-112414-054314
J178 Late Cenozoic climate change and the phylogenetic structure of regional conifer floras worldwide
Sandel, B., A.G. Gutiérrez, P.B. Reich, F. Schrodt, J. Dickie and J. Kattge
Global Ecology and Biogeography 24(10), 2015
10.1111/geb.12350
J177 Estimating the missing species bias in plant trait measurements
B. Sandel, A.G. Gutiérrez, P.B. Reich, F. Schrodt, J. Dickie and J. Kattge
Journal of Vegetation Science 26(5), 2015
10.1111/jvs.12292
J176 Linking environmental filtering and disequilibrium to biogeography with a community climate framework
B. Blonder, D. Nogués-Bravo, M.K. Borregaard, J. Donoghue II, P.M. Jørgensen, N.J.B. Kraft, J.-P. Lessard, N. Morueta-Holme, B. Sandel, J.-C. Svenning, C. Violle, C. Rahbek and B.J. Enquist
Ecology 96(4), 2015
10.1890/14-0589.1
J175 Worst-Case Optimal Tree Layout in External Memory
E. D. Demaine, J. Iacono and S. Langerman
Algorithmica 72(2), 2015
10.1007/s00453-013-9856-2
J174 Cost-Effective Database Design For Information Extraction
A. Termehchy, A. Vakilian, Y. Chodpathumwan and M. Winslett
ACM Transactions on Database Systems 40(2), 2015
10.1145/2716321
J173 The optimal structure of algorithms for alpha-paging.
A. Kovacs, U. Meyer, G. Moruz and A. Negoescu
Information Processing Letters, 115(12), 2015
10.1016/j.ipl.2015.07.011
J172 On Hardness of Several String Indexing Problems
K. G. Larsen, J. I. Munro, J. S. Nielsen and S. Thankachan
Theoretical Computer Science 582, 2015
10.1016/j.tcs.2015.03.026
J171 Linear-Space Data Structures for Range Minority Query in Arrays
T. M. Chan, S. Durocher, M. Skala and B. T. Wilkinson
Algorithmica 72(4), 2015
10.1007/s00453-014-9881-9
J170 Towards a taxonomy of spatial scale-dependence
B. Sandel
Ecography 38(4), 2015
10.1111/ecog.01034
J169 Limited sampling hampers ''big data'' estimation of species richness in a tropical biodiversity hotspot.
K. Engemann, B. Enquist, B. Sandel, B. Boyle, P. Jørgensen, N. Morueta-Holme, R. Peet, C. Violle and J.-C. Svenning
Ecology and Evolution 5(3), 2015
10.1002/ece3.1405
J168 Macroecological trends in nestedness and modularity of seed-dispersal networks.
E. Sebastián-González, B. Sandel, B. Dalsgaard and P. Guimarães
Global Ecology and Biogeography 24(3), 2015
10.1111/geb.12270
J167 Three Generalizations of Davenport-Schinzel Sequences
S. Pettie
SIAM Journal on Discrete Mathematics 29(4), 2015
10.1137/140968574
J166 Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
S. Pettie
Journal of Graph Algorithms and Applications 19(1), 2015
10.7155/jgaa.00365
J165 Distributed Coloring Algorithms for Triangle-Free Graphs
S. Pettie and H.-H. Su
Information and Computation 243, 2015
10.1016/j.ic.2014.12.018
J164 D2-Tree: A New Overlay with Deterministic Bounds
G. S. Brodal, S. Sioutas, K. Tsichlas and C. Zaroliagis
Algorithmica 72(3), 2015
10.1007/s00453-014-9878-4
J163 Group Nearest-Neighbor Queries in the L1 Plane
W. Son, H.-K. Ahn and S. W. Bae
Theoretical Computer Scienc 592, 2015
10.1016/j.tcs.2015.05.011
J162 Approximability of the Subset Sum Reconfiguration Problem
T. Ito and E. D. Demaine
Journal of Combinatorial Optimization 28(3), 2014
10.1007/s10878-012-9562-z
J161 Computational Complexity of Piano-Hinged Dissections
Z. Abel, E. D. Demaine, M. L. Demaine, T. Horiyama and R. Uehara
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 97-A(6), 2014
http://search.ieice.org/bin/summary.php?id=e97-a_6_1206
J160 Computational complexity and an integer programming model of Shakashaka
E. D. Demaine, Y. Okamoto, R. Uehara and Y. Uno
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 97-A(6), 2014
http://search.ieice.org/bin/summary.php?id=e97-a_6_1213
J159 Covering Folded Shapes
O. Aichholzer, G. Aloupis, E. D. Demaine, M. L. Demaine, S. P. Fekete, M. Hoffmann, A. Lubiw, J. Snoeyink and A. Winslow
Journal of Computational Geometry 5(1), 2014
http://jocg.org/index.php/jocg/article/view/160
J158 Picture-Hanging Puzzles
E. D. Demaine, M. L. Demaine, Y. N. Minsky, J. S. B. Mitchell, R. L. Rivest and M. Patrascu
Theory of Computing Systems 54(4), 2014
10.1007/s00224-013-9501-0
J157 A method for building self-folding machines
S. Felton, M. Tolley, E. Demaine, D. Rus and R. Wood
Science 345(6197), 2014
10.1126/science.1252610
J156 Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data
A. C. Gilbert, P. Indyk, M. Iwen and L. Schmidt
Signal Processing Magazine 31(5), 2014
10.1109/MSP.2014.2329131
J155 On a Model of Virtual Address Translation
T. Jurkiewicz and K. Mehlhorn
Journal of Experimental Algorithmics 19, 2014
10.1145/2656337
J154 Computing k Centers over Streaming Data for Small k
H.-K. Ahn, H.-S. Kim, S.-S. Kim and W. Son
International Journal of Computational Geometry and Applications 24(2), 2014
10.1142/S0218195914500058
J153 Establishing macroecological trait datasets: digitalization, extrapolation and validation of diet preferences in terrestrial mammals worldwide
Kissling, D., L. Dalby, C. Fløjgaard, J. Lenoir, B. Sandel, C. Sandom, K. Trøjelsgaard, J.-C. Svenning.
Ecology and Evolution 4(14), 2014
10.1002/ece3.1136
J152 Global Late Quaternary megafauna extinctions linked to humans, not climate change.
Sandom, C., S. Faurby, B. Sandel, J.-C. Svenning
Proceedings of the Royal Society B: Biological Sciences 281(1787), 2014
10.1098/rspb.2013.3254
J151 Integer representations towards efficient counting in the bit probe model
G. S. Brodal, M. Greve, V. Pandey and S. S. Satti
Journal of Discrete Algorithms 26, 2014
10.1016/j.jda.2013.11.001
J150 Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
G. Borradaile, E. D. Demaine and S.Tazari
Algorithmica 68(2), 2014
10.1007/s00453-012-9662-2
J149 Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm
M. Damian, E. D. Demaine and R. Flatland
Graphs and Combinatorics 30(1), 2014
10.1007/s00373-012-1257-9
J148 UNO is hard, even for a single player
E. D. Demaine, M. L. Demaine, R. Uehara, T. Uno and Y. Uno
Theoretical Computer Science 521, 2014
10.1016/j.tcs.2013.11.023
J147 Minimizing Movement: Fixed-Parameter Tractability
E. D. Demaine, M. Hajiaghayi and D. Marx
ACM Transactions on Algorithms 11(2), 2014
10.1145/2650247
J146 Engineering Efficient Paging Algorithms
G. Moruz, A. Negoescu, C.Neumann and V. Weichert
Journal of Experimental Algorithmics 19, 2014
10.1145/2670127
J145 Using Incomplete Information for Complete Weight Annotation of Road Networks
B. Yang, B., M. Kaul and C.S. Jensen
IEEE Transactions on Knowledge and Data Engineering 26(5), 2014
10.1109/TKDE.2013.89
J144 Personalized Trajectory Matching in Spatial Networks
S. Shang, R. Ding, K. Zheng, C.S. Jensen, P. Kalnis and X. Zhou
The VLDB Journal 23(3), 2014
10.1007/s00778-013-0331-0
J143 Computing Homotopic Line Simplification in a Plane
M. Abam, S. Daneshpajouh, L. Deleuran, S. Ehsani and M. Ghodsi
Computational Geometry: Theory and Applications 47(7), 2014
10.1016/j.comgeo.2014.02.002
J142 Indexing for Summary Queries: Theory and Practice
K. Yi, L. Wang and Z. Wei
ACM Transactions on Database Systems, 2014
10.1145/2508702
J141 tqDist: A Library for Computing the Quartet and Triplet Distances Between Binary or General Trees
A. Sand, M.K. Holt, J. Johansen, G.S. Brodal, T. Mailund and C.N.S. Pedersen
Bioinformatics 30(14), 2014
10.1093/bioinformatics/btu157
J140 Dynamic 3-sided planar range queries with expected doubly-logarithmic time
G. S. Brodal, A. C. Kaporis, A. N. Papadopoulos, S. Sioutas, K. Tsakalidis and K. Tsichlas
Theoretical Computer Science 526, 2014
10.1016/j.tcs.2014.01.014
J139 A second look at counting triangles in graph streams
G. Cormode and H. Jowhari
Theoretical Computer Science 552, 2014
10.1016/j.tcs.2014.07.025
J138 On Range Searching in the Group Model and Combinatorial Discrepancy
K.G. Larsen
SIAM Journal on Computing 43(2), 2014
10.1137/120865240
J137 Linear-Space Data Structures for Range Mode Query in Arrays
T.M. Chan, S. Durocher, K.G. Larsen, J. Morrison and B.T. Wilkinson
Theory of Computing Systems 55(4), 2014
10.1007/s00224-013-9455-2
J136 Processing of Extreme Moving-Object Update and Query Workloads in Main Memory
D. Sidlauskas, S. Saltenis and C.S. Jensen
The VLDB Journal 23(5), 2014
10.1007/s00778-014-0353-2
J135 Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
C. Tsirogiannis and B. Sandel
Algorithms for Molecular Biology 9(15), 2014
10.1186/1748-7188-9-15
J134 Functional trait space and the latitudinal diversity gradient
C. Lamanna, B. Blonder, C. Violle, N.J.B. Kraft, B. Sandel, I. Simova, J. Donoghue, J.-C. Svenning, B. McGill, V. Buzzard, B. Boyle, S. Dolins, P.M. Jørgensen, A. Marcuse-Kubitza, N. Morueta-Holme, R.K. Peet, W.H. Piel, J. Regetz, M. Schildhauer, N. Spencer, B. Theirs, S.K. Wiser and B.J. Enquist
Proceedings of the National Academy of Sciences 111(38), 2014
10.1073/pnas.1317722111
J133 Global distribution and drivers of language extinction risk
T. Amano, B. Sandel, H. Eager, E. Bulteau, J.-C. Svenning, B. Dalsgaard, C. Rahbek, R.G. Davies and W.J. Sutherland
Proceedings of the Royal Academy of Science B: Biological Sciences 281(1793), 2014
10.1098/rspb.2014.1574
J132 Ecological traits influence the phylogenetic structure of bird species co-occurrences worldwide
J.Y. Barnagaud, W.D. Kissling, B. Sandel, W. Eiserhardt, H. Balslev, C.H. Sekercioglu, B. Enquist, C. Tsirogiannis and J.-C. Svenning
Ecology Letters 17(7), 2014
10.1111/ele.12285
J131 Determinants of bird species richness, endemism, and island network roles in Wallacea and the West Indies: is geography sufficient or does current and historical climate matter?
Dalsgaard, B., D.W. Carstensen, J. Fjeldså, P.K. Maruyama, C. Rahbek, B. Sandel, J. Sonne, J.-C. Svenning, Z. Wang and W.J. Sutherland
Ecology and Evolution 4(20), 2014
10.1002/ece3.1276
J130 Macroecological evidence for competitive regional-scale interactions between the two major clades of mammal carnivores (Feliformia and Caniformia)
R. Ø. Pedersen, B. Sandel and J.-C. Svenning
PLoS ONE 9(6), 2014
10.1371/journal.pone.0100553
J129 Relative roles of local disturbance, current climate and palaeoclimate in determining phylogenetic and functional diversity in Chinese forests
G. Feng, X.C. Mi, P.K. Bøcher, L.F. Mao, B. Sandel, M. Cao, W.H. Ye, Z.Q. Hao, H.D. Gong, Y.T. Zhang, X.H. Zhao, G.Z. Jin, K.P. Ma and J.-C. Svenning
Biogeosciences 11, 2014
10.5194/bg-11-1361-2014
J128 Ecological, historical and evolutionary determinants of modularity in weighted seed-dispersal networks
M. Schleuning, L. Ingmann, R. Strauß, S. Fritz, B. Dalsgaard, D.M. Dehling, M. Plein, F.V. Saavedra, B. Sandel, J.-C. Svenning, K. Böhning-Gaese and C.F. Cormann
Ecology Letters 17(4), 2014
10.1111/ele.12245
J127 Regional-scale mapping of tree cover, height and main phenological tree types using airborne laser scanning data
C. Alexander, P.K. Bøcher, L. Arge and J.-C. Svenning
Remote Sensing of Environment 147, 2014
10.1016/j.rse.2014.02.013
J126 Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
P. Afshani
International Journal of Computational Geometry and Applications 23 (4-5), 2013
10.1142/S0218195913600054
J125 On the hierarchy of distribution-sensitive properties for data structures
A. Elmasry, A. Farzan and J. Iacono
Acta Informatica 50(4), 2013
J124 Submodular secretary problem and extensions
M. Bateni, M. Hajiaghayi and M. Zadimoghaddam
ACM Transactions on Algorithms 9(4), 2013
J123 Folding Equilateral Plane Graphs
Z. Abel, E.D. Demaine, M.L. Demaine, S. Eisenstat, J. Lynch, T.B. Schardl and I. Shapiro-Ellowitz
International Journal of Computational Geometry and Applications 23(2), 2013
J122 Scheduling to Minimize Gaps and Power Consumption
E.D. Demaine, M. Ghodsi, M. Hajiaghayi, A.S. Sayedi-Roshkhar and M. Zadimoghaddam
Journal of Scheduling 16(2), 2013
J121 Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
Z. Abel, E.D. Demaine, M.L. Demaine, S. Eisenstat, J. Lynch and T.B. Schardl
Journal of Information Processing 21(3), 2013
https://www.jstage.jst.go.jp/article/ipsjjip/21/3/21_368/_pdf
J120 Efficient Reconfiguration of Lattice-Based Modular Robots
G. Aloupis, N. Benbernou, M. Damian, E.D. Demaine, R. Flatland, J. Iacono and S. Wuhrer
Computational Geometry: Theory and Applications 46(8), 2013
J119 Refold Rigidity of Convex Polyhedra
E.D. Demaine, M.L. Demaine, J. Itoh, A. Lubiw, C. Nara and J. O'Rourke
Computational Geometry: Theory and Applications 46(8), 2013
J118 One-Dimensional Staged Self-Assembly
E.D. Demaine, S. Eisenstat, M. Ishaque and A. Winslow
Natural Computing 12(2), 2013
J117 Basic Network Creation Games
N. Alon, E.D. Demaine, M. Hajiaghayi and T. Leighton
SIAM Journal on Discrete Mathematics 27(2), 2013
J116 Non-crossing matchings of points with geometric objects
G. Aloupis, J. Cardinal, S. Collette, E.D. Demaine, M.L. Demaine, M. Dulieu, R. Fabila-Monroy, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara and P. Taslakian
Computational Geometry: Theory and Applications 46(1), 2013
J115 The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
J. Cardinal, E.D. Demaine, S. Fiorini, G. Joret, I. Newman and O. Weimann
Journal of Combinatorial Optimization 25(1), 2013
J114 Bounded-Degree Polyhedronization of Point Sets
G. Barequet, N. Benbernou, D. Charlton, E.D. Demaine, M.L. Demaine, M. Ishaque, A. Lubiw, A. Schulz, D.L. Souvaine, G.T. Toussaint and A. Winslow
Computational Geometry: Theory and Applications 46(2), 2013
J113 Constructing Points through Folding and Intersection
S. Butler, E.D. Demaine, R. Graham and T. Tachi
International Journal of Computational Geometry and Applications 23(1), 2013
J112 Coverage with k-Transmitters in the Presence of Obstacles
B. Ballinger, N. Benbernou, P. Bose, M. Damian, E.D. Demaine, V. Dujmovic, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristan, D. Souvaine and R. Uehara
Journal of Combinatorial Optimization 25(2), 2013
J111 Efficiently Adapting Graphical Models for Cardinality Estimation
K. Tzoumas, A. Deshpande and C.S. Jensen
The VLDB Journal 22(1), 2013
J110 Spatial Keyword Query Processing: An Experimental Evaluation
L. Chen, G. Cong, C.S. Jensen and D. Wu
Proceedings of the VLDB Endowment 6(3), 2013
http://www.vldb.org/pvldb/vol6/p217-chen.pdf
J109 Moving Spatial Keyword Queries: Formulation, Methods, and Analysis
D. Wu, M. L. Yiu and C.S. Jensen
ACM Transactions on Database Systems 38(1), 2013
J108 Travel Cost Inference from Sparse, Spatio-Temporally Correlated Time Series Using Markov Models
B. Yang, C. Guo and C.S. Jensen
Proceedings of the VLDB Endowment 6(9), 2013
http://www.vldb.org/pvldb/vol6/p769-yang.pdf
J107 GroupFinder: A New Approach to Top-K Point-of-Interest Group Retrieval
K. S. Bøgh, A. Skovsgaard and C.S. Jensen
Proceedings of the VLDB Endowment 6(12), 2013
http://www.vldb.org/pvldb/vol6/p1226-skovsgaard.pdf
J106 Finding Shortest Paths on Terrains by Killing Two Birds with One Stone
M. Kaul, R.C.-W. Wong, B. Yang and C.S. Jensen
Proceedings of the VLDB Endowment 7(1), 2013
http://www.vldb.org/pvldb/vol7/p73-kaul.pdf
J105 Effective Online Group Discovery in Trajectory Databases
X. Li, V. Ceikute, C.S. Jensen and K.-L. Tan
IEEE Transactions on Knowledge and Data Engineering 25(12), 2013
J104 Algorithm Engineering für moderne Hardware
U. Meyer and V. Weichert
Informatik-Spektrum, 2013
J103 Cache-Oblivious Hashing
R. Pagh, Z. Wei, K. Yi and Q. Zhang
Algorithmica, 2013
J102 Mergeable Summaries
P.K. Agarwal, G. Cormode, Z. Huang, J.M. Phillips, Z. Wei and K. Yi.
ACM Transactions on Database Systems 38(4), 2013
J101 Optimal Tracking of Distributed Heavy Hitters and Quantiles
K. Yi and Q. Zhang
Algorithmica 65(1), 2013
10.1007/s00453-011-9584-4
J100 Algorithms for Computing the Triplet and Quartet Distances for Binary and General Trees
A. Sand, M.K. Holt, J. Johansen, R. Fagerberg, G.S. Brodal, C.N.S Pedersen and T. Mailund
MDPI Biology - Special Issue on Developments in Bioinformatic Algorithms 2(4), 2013
10.3390/biology2041189
J99 Integer Representations towards Efficient Counting in the Bit Probe Model
G.S. Brodal, M. Greve, V. Pandey and S. S. Rao
Journal of Discrete Algorithms, 2013
J98 A practical O(n·log2 n) time algorithm for computing the triplet distance on binary trees
A. Sand, G.S. Brodal, R. Fagerberg, C.N.S. Pedersen and T. Mailund
BMC Bioinformatics 14, 2013
10.1186/1471-2105-14-S2-S18
J97 Efficient external memory structures for range-aggregate queries
P.K. Agarwal, L. Arge, S. Govindarajan, J. Yang and K. Yi
Computational Geometry: Theory and Application 46(3), 2013
J96 Alliance Partitions and Bisection Width for Planar Graphs
M. Olsen and M. Revsbæk
Journal of Graph Algorithms and Applications 17(6), 2013
http://doi.org/10.7155/jgaa.00307
J95 Human impacts drive a global topographic signature in tree cover
B. Sandel and J.-C. Svenning
Nature Communications 4, 2013
J94 Characterizing scale-dependent community assembly using the functional-diversity-area relationship
A.B. Smith, B. Sandel, N.J.B. Kraft and S. Carey
Ecology 94(11), 2013
J93 Disequilibrium vegetation dynamics under future climate change
J.-C. Svenning and B. Sandel
American Journal of Botany, 2013
J92 Historical climate-change influences modularity of pollination networks
B. Dalsgaard, K. Trøjelsgaard, A.M. Martin González, D. Nogués-Bravo, J. Ollerton, T. Petanidou, B. Sandel, M. Schleuning, Z. Wang, C. Rahbek, W.J. Sutherland, J.-C. Svenning and J.M. Olesen
Ecography 36(12), 2013
J91 Mammal predator and prey species richness are strongly linked at macroscales
C. Sandom, L. Dalby, C. Fløjgaard, W.D. Kissling, J. Lenoir, B. Sandel, K. Trøjelsgaard, R. Ernæs and J.-C. Svenning
Ecology 94(5), 2013
J90 Airborne laser scanner (LiDAR) proxies for understory light conditions
C. Alexander, J. E. Moeslund, P. K. Bøcher, L. Arge and J.-C. Svenning
Remote Sensing of Environment 134, 2013
J89 Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region
J. E. Moeslund, L Arge, P. K. Bøcher, T. Dalgaard, M. V. Odgaard, B. Nygaard and J.-C. Svenning
Ecosphere 4(7), 2013
http://www.esajournals.org/doi/full/10.1890/ES13-00134.1
J88 Topography as a driver of local terrestrial vascular plant diversity patterns
J. E. Moeslund, L. Arge, P. K. Bøcher, T. Dalgaard and J.-C. Svenning
Nordic Journal of Botany 31(2), 2013
J87 Topographically controlled soil moisture drives plant diversity patterns within grasslands
J. E. Moeslund, L. Arge, P. K. Bøcher, T. Dalgaard, R. Ejrnæs, M. V. Odgaard and J.-C. Svenning
Biodiversity and Conservation 22(10), 2013
J86 SWORS: A System for the Efficient Retrieval of Relevant Spatial Web Objects
X. Cao, G. Cong, C. S. Jensen, J. J. Ng, B. C. Ooi, N.-T. Phan and and D. Wu
Proceedings of the VLDB Endowment 5(12), 2012
http://vldb.org/pvldb/vol5/p1914_xincao_vldb2012.pdf
J85 Outsourced Similarity Search on Metric Data Assets
M. Yiu, L., I. Assent, C. S. Jensen and P. Kalnis
IEEE Transactions on Knowledge and Data Engineering 24(2), 2012
10.1109/TKDE.2010.222
J84 Approaches to Exploring Category Information for Question Retrieval in Community Question Answer Archives
X. Cao, G. Cong, B. Cui, C. S. Jensen and Q. Yuan
ACM Transactions on Information Systems 30(2), 2012
10.1145/2180868.2180869
J83 Joint Top-K Spatial Keyword Query Processing
D. Wu, M. L. Yiu, G. Cong and C. S. Jensen
IEEE Transaction on Knowledge and Data Engineering 24(10), 2012
10.1109/TKDE.2011.172
J82 A Framework for Efficient Spatial Web Object Retrieval
D. Wu, G. Cong and C. S. Jensen
VLDB Journal 21(6), 2012
10.1007/s00778-012-0271-0
J81 Faster approximation schemes and parameterized algorithms on (odd-) H-minor-free graphs
S. Tazari
Theoretical Computer Science 417, 2012
10.1016/j.tcs.2011.09.014
J80 Computing hypergraph width measures exactly
L. Moll, S. Tazari and M. Thurley
Information Processing Letters 112(6), 2012
10.1016/j.ipl.2011.12.002
J79 Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising
E.D. Demaine and M. Zadimoghaddam
Internet Mathematics 8(1-2), 2012
10.1080/15427951.2012.625251
J78 Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
E.D. Demaine, M.L. Demaine and R. Uehara
Algorithms 5(1), 2012
10.3390/a5010148
J77 Ghost Chimneys
D. Charlton, E.D. Demaine, M.L. Demaine, V. Dujmovic, P. Morin and R. Uehara
International Journal of Computational Geometry and Applications 22(3), 2012
10.1142/S0218195912500057
J76 Compressive Sensing with Local Geometric Features
R. Gupta, P. Indyk, E. Price and Y. Rachlin
International Journal of Computational Geometry and Applications 22(4), 2012
10.1142/S0218195912600102
J75 Continental-scale variability in browser diversity is a major driver of diversity patterns in acacias across Africa
M. Greve, A.M. Lykke, C.W. Fagg, J. Bogaert, I. Friis, R. Marchant, A.R. Marshall, J. Ndayishimiye, B. Sandel, C. Sandom, M. Schmidt, J.R. Timberlake, J.J. Wieringa, G. Zizka and J.-C. Svenning
Journal of Ecology 100, 2012
10.1111/j.1365-2745.2012.01994.x
J74 Hinged Dissections Exist
T.G. Abbott, Z. Abel, D. Charlton, E.D. Demaine, M.L. Demaine and S.D. Kominers
Discrete & Computational Geometry 47(1), 2012
10.1007/s00454-010-9305-9
J73 On k-convex polygons
O. Aichholzer, F. Aurenhammer, E.D. Demaine, F. Hurtado, P. Ramos and J. Urrutia
Computational Geometry: Theory and Applications 45(3), 2012
10.1016/j.comgeo.2011.09.001
J72 The Price of Anarchy in Network Creation Games
E.D. Demaine, M. Hajiaghayi, H. Mahini and M. Zadimoghaddam
ACM Transactions on Algorithms 8(2), 2012
10.1145/2151171.2151176
J71 Resilient K-d Trees: K-Means in Space Revisited.
F. Gieseke, G. Moruz and J. Vahrenhold
Frontiers of Computer Science 6(2), 2012
10.1109/ICDM.2010.94
J70 I/O-efficient shortest path algorithms for undirected graphs with random and bounded edge lengths
U. Meyer and N. Zeh
ACM Transactions on algorithms 8(3), 2012
10.1145/2229163.2229166
J69 Continuos sampling from distributed streams
G. Cormode, S. Muthukrishnan, K. Yi and Q. Zhang
Journal of the ACM 59(2), 2012
10.1145/2160158.2160163
J68 Continuous monitoring of distributed data streams over a time-based sliding window
H.L. Chan, T.W. Lam, L.K. Lee and H.F. Ting
Algorithmica 62(3-4), 2012
10.1007/s00453-011-9506-5
J67 OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
G.S. Brodal, G. Moruz and A. Negoescu
Theory of Computing Systems 56(1), 2012
10.1007/s00224-012-9427-y
J66 On Space Efficient Two Dimensional Range Minimum Data Structures
G. S. Brodal, P. Davoodi and S. S. Rao
Algorithmica 63(4), 2012
10.1007/s00453-011-9499-0
J65 External memory planar point location with logarithmic updates
L. Arge, G.S. Brodal and S. S. Rao
Algorithmica 63(1-2), 2012
10.1007/s00453-011-9541-2
J64 An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
P. K. Agarwal, L. Arge, H. Kaplan, E. Molad, R. E. Tarjan and K Yi
SIAM Journal on Computing 41(1), 2012
10.1137/10078791X
J63 (Approximate) Uncertain Skylines
P. Afshani, P. K. Agarwal, L. Arge, K. G. Larsen and J. M. Phillips
Theory of Computing Systems 52(3), 2012
10.1007/s00224-012-9382-7
J62 Climate change and the invasion of California by grasses
B. Sandel and E. Dangremond
Global Change Biology 18(1), 2012
10.1111/j.1365-2486.2011.02480.x
J61 Specialization of Mutualistic Interaction Networks Decreases toward Tropical Latitudes
M. Schleuning, J. Fründ, A-M. Klein, S. Abrahamczyk, R. Alarcón, M. Albrecht, G.K.S. Andersson, S. Bazarian, K. Böhning-Gaese, R. Bommarco, B. Dalsgaard, D.M. Dehling, A. Gotlieb, M. Hagen, T. Hickler, A. Holzschuh, C.N. Kaiser-Bunbury, H. Kreft, R.J. Morris, B. Sandel, W.J. Sutherland, J-C. Svenning, T. Tscharntke, S. Watts, C.N. Weiner, M. Werner, N.M. Williams, C. Winqvist, C.F. Dormann and N. Blüthgen
Current Biology 22(20), 2012
10.1016/j.cub.2012.08.015
J60 Scale and diversity following manipulation of productivity and disturbance in Californian coastal grasslands.
B. Sandel and J. Corbin
Journal of Vegetation Science 23(5), 2012
10.1111/j.1654-1103.2012.01406.x
J59 Four-Dimensional Hilbert Curves for R-Trees
H. Haverkort and F. van Walderveen
Journal of Experimental Algorithmics 16, 2011
J58 The Stackelberg Minimum Spanning Tree Game
J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman and O. Weimann
Algorithmica 59(2), 2011
J57 Covering points by disjoint boxes with outliers
H. Ahn, S. Bae, E. D. Demaine, M. L. Demaine, S. Kim, M. Korman, I. Reinbacher and W. Son
Computational Geometry: Theory and Applications 44(3), 2011
J56 On the Complexity of Reconfiguration Problems
T. Ito, E. D. Demaine, N. J. A. Harvey, C. H. Papadimitriou, M. Sideri, R. Uehara and Y. Uno
Theoretical Computer Science 412(12-14), 2011
J55 Computing Signed Permutations of Polygons
G. Aloupis, P. Bose, E. D. Demaine, S. Langerman, H. Meijer, M. Overmars and G. T. Toussaint
International Journal of Computational Geometry and Applications 21(1), 2011
J54 Programmable Assembly With Universally Foldable Strings (Moteins)
K. C. Cheung, E. D. Demaine, J. Bachrach and S. Griffith
IEEE Transactions on Robotics 27(4), 2011
J53 Algorithmic Folding Complexity
J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, T. Ito, M. Kiyomi, S. Langerman, R. Uehara and T. Uno
Graphs and Combinatorics 27(3), 2011
J52 Continuous Blooming of Convex Polyhedra
E. D. Demaine, M. L. Demaine, V. Hart, J. Iacono, S. Langerman and J. O'Rourke
Graphs and Combinatorics 27(3), 2011
J51 (Non)existence of Pleated Folds: How Paper Folds Between Creases
E. D. Demaine, M. L. Demaine, V. Hart, G. N. Price and T. Tachi
Graphs and Combinatorics 27(3), 2011
J50 Efficient constant-velocity reconfiguration of crystalline robots
G. Aloupis, S. Collette, M. Damian, E. D. Demaine, R. Flatland, S. Langerman, J. O'Rourke, V. Pinciu, S. Ramaswami, V. Sacristan and S. Wuhrer
Robotica 29(1), 2011
J49 Planning to Fold Multiple Objects from a Single Self-Folding Sheet
B. An, N. Benbernou, E. D. Demaine and D. Rus
Robotica 29(1), 2011
J48 Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town?
E. D. Demaine, S. P. Fekete, G. Rote, N. Schweer, D. Schymura and M. Zelke
Computational Geometry: Theory and Applications 44(2), 2011
J47 Energy-Efficient Sorting using Solid State Disks
A. Beckman, U. Meyer, P. Sanders and J. Singler
Sustainable Computing: Informatics and Systems 1(2), 2011
J46 On the Complexity of Problems on Simple Games
J. Freixas, X. Molinero, M. Olsen and M. J. Serna
RAIRO - Operations Research 45(4), 2011
J45 Out-of-Order Event Processing in Kinetic Data Structures
M. A. Abam, P. K. Agarwal, M. de Berg and H. Yu
Algorithmica 60(2), 2011
J44 Geometric Spanners for Weighted Point Sets
M. A. Abam, M. de Berg, M. Farshi, J. Gudmundsson and M. H. M. Smid
Algorithmica 61(1), 2011
J43 Kinetic Spanners in Rd
M. A. Abam and M. de Berg
Discrete & Computational Geometry 45(4), 2011
J42 Sorting and Selection in Posets
C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld and E. Verbin
SIAM Journal of Computing, 2011
J41 Approximating frequent items in asynchronous data stream over a sliding window
H.L. Chan, T.W. Lam, L.K. Lee and H.F. Ting
Algorithmica 4(3), 2011
J40 The Cost of Cache-Oblivious Searching
M.A. Bender, G.S. Brodal, R. Fagerberg, D. Ge, S. He, H. Hu, J. Iacono and A. López-Ortiz
Algorithmica 61(2), 2011
J39 Faster Algorithms for Computing Longest Common Increasing Subsequences
M. Kutz, G.S. Brodal, K. Kaligosi and I. Katriel
Journal of Discrete Algorithms 9(4), 2011
J38 Towards Optimal Range Medians
G.S. Brodal, B. Gfeller, A.G. Jørgensen and P. Sanders
Theoretical Computer Science 412(24), 2011
J37 Cache-Oblivious Range Reporting With Optimal Queries Requires Superlinear Space
P. Afshani, C. Hamilton and N. Zeh
Discrete & Computational Geometry 45(4), 2011
J36 Using plant functional traits to guide restoration: A case study in California coastal grassland
B. Sandel, M. Krupa and J. Corbin
Ecosphere 2, 2011
J35 Specialization in Plant-Hummingbird Networks Is Associated with Species Richness, Contemporary Precipitation and Quaternary Climate-Change Velocity
B. Dalsgaard, E. Magård, J. Fjeldså, A.M. Martín González, C. Rahbek, J. Olesen, J. Ollerton, R. Alarcón, A.C. Araujo, P.A. Cotton, C. Lara, C.G. Machado, I. Sazima, M. Sazima, A. Timmermann, S. Watts, B. Sandel, W. Sutherland and J.-C. Svenning
PLoS ONE 6, 2011
J34 The influence of Late Quaternary climate-change velocity on species endemism
B. Sandel, L. Arge, B. Dalsgaard, R. Davies, K. Gaston, W. Sutherland and J.-C. Svenning
Science 334, 2011
J33 Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR
J. E. Moeslund, L. Arge, P. K. Bøcher, B. Nygaard and J.-C. Svenning
Wetlands 31(3), 2011
J32 Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
C. Demetrescu, B. Escoffier, G. Moruz and A. Ribichini
Theoretical Computer Science 411(44-46), 2010
J31 Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
M.A. Bender, G.S. Brodal, R. Fagerberg, R. Jacob and E. Vicari
Theory of Computing Systems 47(4), 2010
J30 A compact data structure for representing a dynamic multiset
J. Katajainen and S. S. Rao
Information Processing Letters 110(23), 2010
J29 A General Approach for Cache-Oblivious Range Reporting and Approximate Range Counting
P. Afshani, C. Hamilton and N. Zeh
Computational geometry: Theory and applications 43(8), 2010
J28 I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis
P.K. Agarwal, L. Arge and K. Yi
ACM Transactions on Algorithms 7(1), 2010
J27 Locked and Unlocked Chains of Planar Shapes
R. Connelly, E.D. Demaine, M.L. Demaine, S. Fekete, S. Langerman, J. S. B. Mitchell, A. Ribó and G. Rote
Discrete & Computational Geometry 44(2), 2010
J26 Integer Point Sets Minimizing Average Pairwise L1 Distance: What is the Optimal Shape of a Town?
E.D. Demaine, S.P. Fekete, G. Rote, N. Schweer, D. Scymura and M. Zelke
Computational Geometry: Theory and Applications 44(2), 2010
J25 Grid Vertex-Unfolding Orthostacks
E.D. Demaine, J. Iacono and S. Langerman
International Journal of Computational Geometry and Applications 20(3), 2010
J24 Deploying Sensor Networks with Guaranteed Fault Tolerance
J.L. Bredin, E.D. Demaine, M. Hajiaghayi and D. Rus
IEEE/ACM Transactions on Networking 18(1), 2010
J23 Programmable matter by folding
E. Hawkes, B. An, N. M. Benbernou, H. Tanaka, S. Kim, E.D. Demaine, D. Rus and R.J. Wood
Proceedings of the National Academy of Sciences of the United States of America 107(28), 2010
J22 Motif discovery in physiological datasets: A methodology for inferring predictive elements
P. Indyk, Z. Syed, C. Stultz, M. Kellis and J. Guttag
ACM Transactions on Knowledge Discovery in Data 4(1), 2010
J21 In-Place Algorithms for Computing (Layers of) Maxima
H. Blunck and J. Vahrenhold
Algorithmica 57(1), 2010
J20 Average-case Analysis of Incremental Topological Ordering
D. Ajwani and T. Friedrich
Discrete Applied Mathematics 158, 2010
J19 A Simple and Efficient Kinetic Spanner
M.A. Abam, M. de Berg and J. Gudmundsson
Computational Geometry: Theory and Applications 43(3), 2010
J18 Streaming Algorithms for Line Simplification
M.A. Abam, M. de Berg, P. Hachenberger and A. Zarei
Discrete & Computational Geometry 43(3), 2010
J17 Confluently Persistent Tries for Efficient Version Control
E.D. Demaine, S. Langerman and E. Price
Algorithmica 57(3), 2010
J16 Sparse Recovery Using Sparse Matrices
P. Indyk and A. Gilbert
Proceedings of the IEEE June 2010, 2010
J15 Wrapping Spheres with Flat Paper
E.D. Demaine, M.L. Demaine, J. Iacono and S. Langerman
Computational Geometry: Theory and Applications, 42(8), 2009
J14 The Price of Anarchy in Network Creation Games
E.D. Demaine, M. Hajiaghayi, H. Mahini and M. Zadimoghaddam
ACM SIGECOM Exchanges, 8(2), 2009
J13 Dynamic Ham-Sandwich Cuts in the Plane
T. Abbott, M. Burr, T. Chan, E. Demaine, M. Demaine, J. Hugg, D. Kane, S. Langerman, J. Nelson, E. Rafalin, K. Seyboth and V. Yeung
Computational Geometry: Theory and Applications, 42(5), 2009
J12 Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
E. Demaine, M. Hajiaghayi and K. Kawarabayashi
Algorithmica, 54(2), 2009
J11 Minimizing Movement
E. Demaine, M. Hajiaghayi, H. Mahini, A. Sayedi-Roshkhar, S. Oveisgharan and M. Zadimoghaddam
ACM Transactions on Algorithms, 5(3), 2009
J10 Refolding Planar Polygons
H. Iben, J. O'Brien and E. Demaine
Discrete & Computational Geometry, 41(3), 2009
J9 Cache-Oblivious R-Trees
L. Arge, M. de Berg and H. Haverkort
Algorithmica, 53(1), 2009
J8 Optimal External-Memory Planar Point Enclosure
L. Arge, V. Samoladas and K. Yi
Algorithmica, 54(3), 2009
J7 Kinetic kd-Trees and Longest-Side kd-Trees
M. Abam, M. de Berg and B. Speckmann
SIAM Journal of Computing, 39(4), 2009
J6 Region-Fault Tolerant Geometric Spanners
M. Abam, M. de Berg, M. Farshi and J. Gudmundsson
Discrete & Computational Geometry, 41(4), 2009
J5 Nash Stability in Additively Separable Hedonic Games and Community Structures
M. Olsen
Theory of Computing Systems, 45(4), 2009
J4 The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
L. Arge, M. de Berg, H. J. Haverkort and K. Yi
ACM Transactions on Algorithms, 4(1), 2008
J3 Computing the All-Pairs Quartet Distance on a set of Evolutionary Trees
M. Stissing, T. Mailund, C. N. S. Pedersen, G. S. Brodal and R. Fagerberg
Journal of Bioinformatics and Computational Biology, 6(1), 2008
J2 An O(n2.75) Algorithm for Incremental Topological Ordering
D. Ajwani, T. Friedrich and U. Meyer
ACM Transactions on Algorithms, 4(4), 2008
J1 On the Adaptiveness of Quicksort
G. S. Brodal, R. Fagerberg and G. Moruz
ACM Journal of Experimental Algorithmics, 12, 2007

Thesis

T88 Algorithms for Finding Dominators in Directed Graphs
H.K. Christensen
MS Thesis AU, 2016
http://www.cs.au.dk/~gerth/advising/thesis/henrik-knakkegaard-christensen.pdf
T87 Range Mode Queries in Arrays
J. Landbo and C. Green
MS Thesis AU, 2016
http://www.cs.au.dk/~gerth/advising/thesis/casper_green-jakob_landbo.pdf
T86 Cohesion in scientific collaboration and citation networks
D. Roß
MS Thesis FRA, 2015
T85 STXXL - Paging-Algorithmen
N. Schepsen
BS Thesis FRA, 2015
T84 The Sparse Fourier Transform: Theory & Practice
H. Hassanieh
PhD Thesis MIT, 2015
T83 Orthogonal Range Searching in 2D with Ball Inheritance
M. Ravn
MS Thesis AU, 2015
T82 Geometric Measures of Depth
T. Sandholt and M. B. Christensen
MS Thesis AU, 2015
T81 Pathfinding in Two-dimensional Worlds
A. S-H. Vinther and M. S-H. Vinther
MS Thesis AU, 2015
T80 Intersection of Convex Objects in the Plane
L. Walther
MS Thesis AU, 2015
T79 Computing Set Operations on Simple Polygons Using Binary Space Partition Trees
S. N. Madsen and R. Hallenberg-Larsen
MS Thesis AU, 2015
T78 On the Complexity of Red-Black Trees for Higher Dimensions
M. E. Hougaard
MS Thesis AU, 2015
T77 Event Detection in Soccer using Spatio-Temporal Data
J. C. C. Jensen
MS Thesis AU, 2015
T76 Engineering Rank and Select Queries on Wavelet Trees
J. H. Knudsen and R. L. Pedersen
MS Thesis AU, 2015
T75 On the Practicality of Data-Oblivious Sorting
K. V. Ebbesen
MS Thesis AU, 2015
T74 Algorithms for Computing Convex Hulls Using Linear Programming
B. Mortensen
MS Thesis AU, 2015
T73 Monte Carlo Evaluation of Financial Options Using a GPU
C. Jespersen
MS Thesis AU, 2015
T72 Implicit Data Structures, Sorting, and Text Indexing
J. S. Nielsen
PhD Thesis AU, 2015
T71 Efficient Algorithms for Handling Massive Terrains
J. Yang
PhD Thesis AU, 2015
T70 Space Efficient Data Structures and External Terrain Algorithms
J. Truelsen
PhD Thesis AU, 2015
T69 Online Allocation Algorithms with Applications in Computational Advertising
Morteza Zadimoghaddam
PhD Thesis MIT, 2014
T68 Eine adaptive Tabusuche für das Vehicle Routing Problem mit Zeitfenstern
Samir van de Sand
MS Thesis FRA, 2014
T67 Indexing, Query Processing, and Clustering of Spatio-Temporal Text Objects
A. Skovsgaard
PhD Thesis AU, 2014
T66 Handling Massive and Dynamic Terrain Data
M. Revsbæk
PhD Thesis AU, 2014
T65 Algorithms for Computing Convex Hulls Using Linear Programming
B. Mortensen
MS Thesis AU, 2014
T64 Hashing and Random Graphs
J. Kunert
MS Thesis AU, 2014
T63 Orthogonal Range Skyline Counting Queries
D. W. Petersen
MS Thesis AU, 2014
T62 An Experimental Comparison of Max Flow Algorithms
J.M. Friis and S.B. Olesen
MS Thesis AU, 2014
T61 Indicering af spatio-tekstuelle data - et empirisk studie
C.W. Schmidt
MS Thesis AU, 2013
T60 Locating Points of Interest Based on Geo- tagged Tweets
F. Mogensen
MS Thesis AU, 2013
T59 Approximate Nearest Neighbor And Its Many Variants
S. Mahabadi
MS Thesis MIT, 2013
T58 Model-Based Compressive Sensing with Earth Mover's Distance Constraints
L. Schmidt
MS Thesis MIT, 2013
T57 Sparse Recovery and Fourier Sampling
E. Price
PhD Thesis MIT, 2013
T56 Inferring Groups of Objects, Preferred Routes, and Facility Locations from Trajectories
V. Ceikute
PhD Thesis AU, 2013
T55 Shortest Paths with Multiple Constraints in Flight Networks
S. Bechtold
MS Thesis FRA, 2013
T54 Interaktive Stadtplanungsmaßnahmen auf der GPU
A. Kehlenbach
MS Thesis FRA, 2013
T53 An efficient implementation of PARTITION2
S. Försch
MS Thesis FRA, 2013
T52 Improved results for (h,k)-paging
D. Frascaria
MS Thesis FRA, 2013
T51 I/O-effiziente Durchmesser-Approximierung auf gewichteten Graphen
T. Timmer
MS Thesis FRA, 2013
T50 Effiziente Algorithmen auf Eingebetteten Plattformen
D. Pick
MS Thesis FRA, 2013
T49 Design of Competitive Paging Algorithms with Good Behaviour in Practice
A. Negoescu
PhD Thesis FRA, 2013
T48 Range Minimum Data Structures
J. Schou
MS Thesis AU, 2013
T47 Computing Triplet and Quartet Distances
M. Holt and J. Johansen
MS Thesis AU, 2013
T46 Engineering a Fast Fourier Transform
J. Fogh
MS Thesis AU, 2013
T45 Dynamic Data Structures: The Interplay of Invariants and Algorithm
C.Kejlberg-Rasmussen
PhD Thesis AU, 2013
T44 Models and Techniques for Proving Data Structure Lower Bounds
K.G. Larsen
PhD Thesis AU, 2013
T43 Representations for Path Finding in Planar Environments
A. Koefoed-Hansen
MS Thesis AU, 2012
T42 A Compressive Sensing Algorithm for Attitude Determination
R. Gupta
MS Thesis MIT, 2012
T41 Map Folding
T. Morgan
MS Thesis MIT, 2012
T40 An efficient implementation of the optimal paging algorithm
E. Deza
BS Thesis FRA, 2012
T39 A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions by Identifying Alternative Paths with Similar Weights
P. Wollstadt
BS Thesis FRA, 2012
T38 k-Dimensionale Orthogonale Bereichsanfragen für GPUs auf großen Instanzen
M. Sturmann
MS Thesis FRA, 2012
T37 Implementation of an External-Memory Diameter Approximation
D. Veith
MS Thesis FRA, 2012
T36 Practical Paging Algorithms
C. Neumann
MS Thesis FRA, 2012
T35 Homotopic Polygonal Line Simplification
L. Deleuran
PhD Thesis AU, 2012
T34 External Memory Graph Algorithms and Range Searching Data Structures
F. van Walderveen
PhD Thesis AU, 2012
T33 The role of topography in determining local plant diversity patterns across Denmark
J. E. Moeslund
PhD Thesis AU, 2012
T32 Sketching and Streaming High-Dimensional Vectors
J. Nelson
PhD Thesis MIT, 2011
T31 Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency
K. Tsakalidis
PhD Thesis AU, 2011
T30 Data Structures: Range Queries and Space Efficiency
P. Davoodi
PhD Thesis AU, 2011
T29 On Implicit Dictionaries with the Working-Set Property and Catenable Priority Queues with Attrition
C. Kejlberg-Rasmussen
MS Thesis AU, 2011
T28 Optimal Orthogonal Range Reporting in 3-d
K. G. Larsen
MS Thesis AU, 2011
T27 Experimental Study of Kinetic Geometric t-Spanner Algorithms
J. Suhr Christensen
MS Thesis AU, 2010
T26 Range Media Algorithms
D. Kjær
MS Thesis AU, 2010
T25 Online Sorted Range Reporting and Approximating the Mode
M. Greve
MS Thesis AU, 2010
T24 Working Set Implicit Dictionaries and Range Mode Lower Bounds and Approximations
J. Truelsen
MS Thesis AU, 2010
T23 Fine-resolution geospatial modelling of contemporary and potential future plant diversity in Denmark
J. Moeslund
MS Thesis AU, 2010
T22 Data Structures: Sequence Problems, Range Queries, and Fault Tolerance
A. G. Jørgensen
PhD Thesis AU, 2010
T21 Polygonal Line Simplification
L. Deleuran
MS Thesis AU, 2009
T20 External Memory 3-sided Planar Range Reporting and Persistent B-Trees
K. Tsakalidis
MS Thesis AU, 2009
T19 Two Dimensional Range Minimum Queries
P. Davoodi
MS Thesis AU, 2009
T18 Advances in Sparse Signal Recovery Methods
R. Berinde
MS Thesis MIT, 2009
T17 Radiation parameterization of the climate model COSMO/CLM in CUDA
V. Weichert
MS Thesis FRA, 2009
T16 Accelerating Dynamic Programming
O. Weimann
PhD Thesis MIT, 2009
T15 Implementering og udvikling af maksimum delsum algoritmer
K. Piatkowski
MS Thesis AU, 2009
T14 Searching with Dynamic Optimality: In Theory and Practice
H. B. Kirk
MS Thesis AU, 2009
T13 Handling Massive Terrains and Unreliable Memory, AU
T. Mølhave
PhD Thesis AU, 2009
T12 Link Building
M. Olsen
PhD Thesis AU, 2009
T11 I/O-efficient Processing of LIDAR Data
A. H. Jensen
MS Thesis AU, 2008
T10 I/O-efficient Algorithms for Batched Union-Find with Dynamic Set Properties and its Applications to Hydrological Conditioning
M. Revsbæk
MS Thesis AU, 2008
T9 An optimal minimum spanning tree algorithm
C. Andersen
MS Thesis AU, 2008
T8 En undersøgelse af algoritmer til løsning af generalized movers problem i 3D
J. M. Larsen og M. Nielsen
MS Thesis AU, 2008
T7 Complexity of Union-Split-Find Problems
K. Lai
MS Thesis MIT, 2008
T6 Testing closeness of distributions under the EMD metric
K. Do Ba
MS Thesis MIT, 2008
T5 Traversing large graphs in realistic settings
D. Ajwani
PhD Thesis MPI, 2008
T4 Computational metric embeddings
A. Sidiropoulos
PhD Thesis MIT, 2008
T3 Lower Bound Techniques for Data Structures
M. Patrascu
PhD Thesis MIT, 2008
T2 Hardware-Aware Algorithms and Data Structures
G. Moruz
PhD Thesis AU, 2007
T1 Heuristics for Average Diameter Approximation with External Memory Algorithms
I. Brudaru
MS Thesis MPI, 2007