default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEncyclopedia of Algorithms 2016
- Ming-Yang Kao:
Encyclopedia of Algorithms - 2016 Edition. Springer 2016, ISBN 978-1-4939-2863-7
A
- Michele Mosca:
Abelian Hidden Subgroup Problem. 1-5 - Rolf Klein:
Abstract Voronoi Diagrams. 5-8 - Maria-Florina Balcan, Ruth Urner:
Active Learning - Modern Learning Theory. 8-13 - Damien Woods:
Active Self-Assembly and Molecular Robotics with Nubots. 13-18 - Ping Deng, Weili Wu, Eugene Shragowitz, Ding-Zhu Du:
Adaptive Partitions. 18-22 - Shiri Chechik:
Additive Spanners. 22-24 - Tian-Ming Bu:
Adwords Pricing. 24-27 - Marek Chrobak:
Algorithm DC-Tree for k-Servers on Trees. 27-30 - Tal Mor:
Algorithmic Cooling. 30-37 - Ron Lavi:
Algorithmic Mechanism Design. 37-48 - Jesper Jansson, Wing-Kin Sung:
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. 48-52 - Seth Pettie:
All Pairs Shortest Paths in Sparse Graphs. 52-55 - Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication. 55-59 - Edith Cohen:
All-Distances Sketches. 59-64 - Neeldhara Misra:
Alternate Parameterizations. 64-67 - Alejandro López-Ortiz:
Alternative Performance Measures in Online Algorithms. 67-72 - Takeaki Uno:
Amortized Analysis on Enumeration Algorithms. 72-76 - Graham Cormode
:
AMS Sketch. 76-78 - Alejandro López-Ortiz, Alejandro Salinger:
Analyzing Cache Behaviour in Multicore Architectures. 78-82 - Naila Rahman:
Analyzing Cache Misses. 82-86 - Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Applications of Geometric Spanner Networks. 86-90 - Venkatesh Srinivasan:
Approximate Dictionaries. 90-94 - Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Query Time. 94-97 - Ran Duan:
Approximate Matching. 97-99 - Gonzalo Navarro:
Approximate Regular Expression Matching. 99-102 - Gonzalo Navarro:
Approximate String Matching. 102-106 - Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. 106-109 - George B. Mertzios:
Approximating Fixation Probabilities in the Generalized Moran Process. 109-113 - Jittat Fakcharoenphol, Satish Rao, Kunal Talwar:
Approximating Metric Spaces by Tree Metrics. 113-116 - Liam Roditty:
Approximating the Diameter. 116-117 - Pinyan Lu, Yitong Yin:
Approximating the Partition Function of Two-Spin Systems. 117-123 - Nikhil Bansal:
Approximation Schemes for Bin Packing. 123-126 - Joseph S. B. Mitchell:
Approximation Schemes for Geometric Network Optimization Problems. 126-130 - Asaf Levin:
Approximation Schemes for Makespan Minimization. 131-133 - Mohammad Taghi Hajiaghayi, Erik D. Demaine:
Approximation Schemes for Planar Graph Problems. 133-137 - Paul (Pavlos) Spirakis:
Approximations of Bimatrix Nash Equilibria. 137-141 - Mao-cheng Cai, Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market. 141-145 - Paul G. Howard, Jeffrey Scott Vitter:
Arithmetic Coding for Data Compression. 145-150 - Samir Khuller:
Assignment Problem. 150-152 - Maurice Herlihy:
Asynchronous Consensus Impossibility. 152-155 - Xavier Défago:
Atomic Broadcast. 155-160 - Jyrki Kivinen:
Attribute-Efficient Learning. 160-162 - Falk Hüffner:
Automated Search Tree Generation. 162-165
B
- Serge Gaspers:
Backdoors to SAT. 167-170 - Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. 170-174 - Mohammad Taghi Hajiaghayi, Hamid Mahini:
Bargaining Networks. 174-177 - Maurizio Patrignani:
Bend Minimization for Orthogonal Drawings of Plane Graphs. 177-181 - Paul (Pavlos) Spirakis:
Best Response Algorithms for Selfish Routing. 181-183 - Riccardo Dondi, Yuri Pirola:
Beyond Evolutionary Trees. 183-189 - Lhouari Nourine, Jean-Marc Petit:
Beyond Hypergraph Dualization. 189-192 - Abhradeep Thakurta:
Beyond Worst Case Sensitivity in Private Data Analysis. 192-199 - Matthieu Roy:
BG Distributed Simulation Algorithm. 199-203 - Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensionality. 203-207 - David S. Johnson:
Bin Packing. 207-211 - Hiroshi Fujiwara, Koji M. Kobayashi:
Bin Packing with Cardinality Constraints. 211-214 - Leah Epstein:
Bin Packing, Variants. 214-216 - Adnan Aziz, Amit Prakash:
Binary Decision Graph. 216-220 - Adrian Dumitrescu, Csaba D. Tóth:
Binary Space Partitions. 220-223 - Chris Chu:
Block Shaping in Floorplan. 223-227 - Paolo Ferragina, Giovanni Manzini:
Boosting Textual Compression. 228-232 - Fedor V. Fomin, Dimitrios M. Thilikos:
Branchwidth of Graphs. 232-237 - Ravishankar Krishnaswamy:
Broadcast Scheduling - Minimizing Average Response Time. 237-240 - Andrzej Pelc:
Broadcasting in Geometric Radio Networks. 241-244 - Jan Vahrenhold:
B-trees. 244-250 - Paolo Ferragina, Giovanni Manzini:
Burrows-Wheeler Transform. 250-255 - Michael Okun:
Byzantine Agreement. 255-259
C
- Rolf Fagerberg:
Cache-Oblivious B-Tree. 261-264 - Rolf Fagerberg:
Cache-Oblivious Model. 264-269 - Gerth Stølting Brodal:
Cache-Oblivious Sorting. 269-273 - Michael Bader, Tobias Weinzierl:
Cache-Oblivious Spacetree Traversals. 273-277 - Stephen G. Kobourov:
Canonical Orders and Schnyder Realizers. 277-283 - Xavier Défago:
Causal Order, Logical Clocks, State Machine Replication. 283-286 - Lisa Hellerstein:
Certificate Complexity and Exact Learning. 286-290 - Mansoor Alicherry, Randeep Bhatia, Li (Erran) Li:
Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks. 290-295 - Martin D. F. Wong, Hannah Honghua Yang:
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach. 295-301 - Andrew A. Kennings, Igor L. Markov:
Circuit Placement. 301-306 - Hai Zhou:
Circuit Retiming. 306-309 - Hai Zhou:
Circuit Retiming: An Incremental Approach. 309-313 - Etsuji Tomita:
Clique Enumeration. 313-317 - Boaz Patt-Shamir:
Clock Synchronization. 317-321 - Lusheng Wang, Ming Li, Bin Ma:
Closest String and Substring Problems. 321-324 - Jens Gramm:
Closest Substring. 324-326 - Fabrizio Frati:
Clustered Graph Drawing. 326-331 - Pranjal Awasthi:
Clustering Under Stability Assumptions. 331-335 - Noga Alon, Raphael Yuster, Uri Zwick:
Color Coding. 335-338 - Christoforos L. Raptopoulos:
Colouring Non-sparse Random Intersection Graphs. 338-342 - Frank Ruskey:
Combinatorial Gray Code. 342-347 - Robert T. Schweller:
Combinatorial Optimization and Verification in Self-Assembly. 347-349 - Amit Chakrabarti:
Communication Complexity. 349-357 - Ioannis Chatzigiannakis:
Communication in Ad Hoc Mobile Networks Using Random Walks. 357-362 - Shiri Chechik:
Compact Routing Schemes. 362-364 - Tian-Ming Bu:
Competitive Auction. 364-366 - Jin-Yi Cai, Xi Chen, Pinyan Lu:
Complexity Dichotomies for Counting Graph Homomorphisms. 366-369 - Xi Chen:
Complexity of Bimatrix Nash Equilibria. 369-372 - Qizhi Fang:
Complexity of Core. 372-375 - Sharma V. Thankachan:
Compressed Document Retrieval on String Collections. 375-379 - Johannes Fischer:
Compressed Range Minimum Queries. 379-382 - J. Ian Munro, Patrick K. Nicholson:
Compressed Representations of Graphs. 382-386 - Djamal Belazzougui, Veli Mäkinen, Daniel Valenzuela:
Compressed Suffix Array. 386-390 - Luís M. S. Russo:
Compressed Suffix Trees. 390-394 - Veli Mäkinen, Gonzalo Navarro:
Compressed Text Indexing. 394-397 - Gonzalo Navarro, Kunihiko Sadakane:
Compressed Tree Representations. 397-401 - Paolo Ferragina, Srinivasa Rao Satti:
Compressing and Indexing Structured Text. 401-407 - Alistair Moffat:
Compressing Integer Sequences. 407-412 - Michal Pilipczuk:
Computing Cutwidth and Pathwidth of Semi-complete Digraphs. 412-415 - Spyros C. Kontogiannis:
Computing Pure Equilibria in the Game of Parallel Links. 415-421 - Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion. 421-425 - Feng Wang, Ding-Zhu Du, Xiuzhen Cheng:
Connected Dominating Set. 425-430 - Lidong Wu, Huijuan Wang, Weili Wu:
Connected Set-Cover and Group Steiner Tree. 430-432 - Sotiris E. Nikoletseas:
Connectivity and Fault Tolerance in Random Regular Graphs. 432-436 - Bernadette Charron-Bost, André Schiper:
Consensus with Partial Synchrony. 436-441 - Md. Saidur Rahman:
Convex Graph Drawing. 441-446 - Michael Hemmer, Christiane Schmidt:
Convex Hulls. 446-449 - Edith Cohen:
Coordinated Sampling. 449-454 - Shin-ichi Minato:
Counting by ZDD. 454-458 - Madhav Jha:
Counting Triangles in Graph Streams. 458-464 - Graham Cormode:
Count-Min Sketch. 464-468 - Li-Sha Huang:
CPU Time Pricing. 468-470 - Chih-Wei Yi:
Critical Range for Wireless Networks. 471-475 - Adam R. Klivans:
Cryptographic Hardness of Learning. 475-477 - Rasmus Pagh:
Cuckoo Hashing. 478-481 - Rob van Stee:
Current Champion for Online Bin Packing. 481-482 - Stefan Funke:
Curve Reconstruction. 482-485
D
- Yoo-Ah Kim:
Data Migration. 487-491 - Rolf Niedermeier:
Data Reduction for Domination in Graphs. 491-494 - Justin Thaler:
Data Stream Verification. 494-499 - Siu-Wing Cheng:
3D Conforming Delaunay Triangulation. 499-502 - Venkatesan Guruswami:
Decoding Reed-Solomon Codes. 502-506 - Camil Demetrescu, Giuseppe F. Italiano:
Decremental All-Pairs Shortest Paths. 506-509 - Aaron Bernstein:
Decremental Approximate-APSP in Directed Graphs. 509-512 - Wen-Zhan Song, Xiang-Yang Li, Weizhao Wang:
Degree-Bounded Planar Spanner with Low Weight. 512-516 - Martin Fürer:
Degree-Bounded Trees. 516-519 - Olivier Devillers:
Delaunay Triangulation and Randomized Constructions. 519-524 - Dominik Scheder:
Derandomization of \(\boldsymbol{k}\) -SAT Algorithm. 524-528 - Leszek Gasieniec:
Deterministic Broadcasting in Radio Networks. 529-530 - Spyros Angelopoulos:
Deterministic Searching on the Line. 531-533 - Moshe Lewenstein:
Dictionary Matching. 533-538 - Travis Gagie, Giovanni Manzini:
Dictionary-Based Data Compression. 538-543 - Sofya Raskhodnikova, Adam D. Smith:
Differentially Private Analysis of Graphs. 543-547 - Rolf Klein:
Dilation of Geometric Networks. 547-549 - Costas Busch:
Direct Routing Algorithms. 549-553 - Jesper Jansson:
Directed Perfect Phylogeny (Binary Characters). 553-556 - Jie Gao, Xianfeng David Gu, Feng Luo:
Discrete Ricci Flow for Geometric Routing. 556-563 - Liam Roditty:
Distance Oracles for Sparse Graphs. 563-564 - Miklós Csürös:
Distance-Based Phylogeny Reconstruction (Fast-Converging). 564-567 - Olivier Gascuel, Fabio Pardi, Jakub Truszkowski:
Distance-Based Phylogeny Reconstruction: Safety and Edge Radius. 567-571 - Sergio Rajsbaum:
Distributed Algorithms for Minimum Spanning Trees. 572-574 - Alexandre Termier:
Distributed Computing for Enumeration. 574-577 - Tomasz Jurdzinski, Dariusz R. Kowalski:
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. 577-580 - Michel Raynal:
Distributed Snapshots. 581-586 - Devdatt P. Dubhashi:
Distributed Vertex Coloring. 586-589 - Rahul Shah:
Document Retrieval on String Collections. 589-593 - Xiaofeng Gao:
Double Partition. 593-600 - Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. 600-602 - Aaron Bernstein:
Dynamic Approximate-APSP. 602-605 - Renato F. Werneck:
Dynamic Trees. 605-609
E
- Süleyman Cenk Sahinalp:
Edit Distance Under Block Operations. 611-614 - Hung Q. Ngo, Atri Rudra:
Efficient Decodable Group Testing. 614-618 - Andreas Brandstädt, Ragnar Nevries:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. 618-621 - Siu-Ming Yiu, Francis Y. L. Chin:
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds. 621-624 - Klaus Jansen:
Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors. 624-628 - David A. Bader:
Engineering Algorithms for Computational Biology. 628-630 - Christos D. Zaroliagis:
Engineering Algorithms for Large Network Applications. 630-633 - Dan Halperin:
Engineering Geometric Algorithms. 634-638 - Shin-ichi Tanigawa:
Enumeration of Non-crossing Geometric Graphs. 638-640 - Roberto Grossi:
Enumeration of Paths, Cycles, and Spanning Trees. 640-645 - Rezaul Alam Chowdhury:
Equivalence Between Priority Queues and Sorting. 645-650 - Oded Goldreich, Dana Ron:
Estimating Simple Graph Parameters in Sublinear Time. 650-653 - Artur Czumaj:
Euclidean Traveling Salesman Problem. 653-657 - Joshua R. Wang, Richard Ryan Williams:
Exact Algorithms and Strong Exponential Time Hypothesis. 657-661 - Jesper Nederlof:
Exact Algorithms and Time/Space Tradeoffs. 661-664 - Marek Cygan:
Exact Algorithms for Bandwidth. 664-667 - Dieter Kratsch:
Exact Algorithms for Dominating Set. 667-670 - Edward A. Hirsch:
Exact Algorithms for General CNF SAT. 670-674 - Michal Pilipczuk:
Exact Algorithms for Induced Subgraph Problems. 674-678 - Kazuo Iwama:
Exact Algorithms for k SAT Based on Local Search. 678-680 - Fabrizio Grandoni:
Exact Algorithms for Maximum Independent Set. 680-683 - Ryan Williams:
Exact Algorithms for Maximum Two-Satisfiability. 683-688 - Ioan Todinca:
Exact Algorithms for Treewidth. 688-690 - Marcin Pilipczuk:
Exact Algorithms on Graphs of Bounded Average Degree. 691-694 - Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. 694-695 - Ashley Montanaro:
Exact Quantum Algorithms. 695-698 - Constantine G. Evans:
Experimental Implementation of Tile Assembly. 698-702 - Catherine C. McGeoch:
Experimental Methods for Algorithm Analysis. 702-705 - Dominik Scheder:
Exponential Lower Bounds for k-SAT Algorithms. 705-708 - Jeffrey Scott Vitter:
External Sorting and Permuting. 708-715
F
- Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. 717-724 - Rachid Guerraoui:
Failure Detectors. 724-728 - Makoto Yokoo:
False-Name-Proof Auction. 728-731 - Yngve Villanger:
Fast Minimal Triangulation. 731-735 - Petteri Kaski:
Fast Subset Convolution. 735-738 - Christian Wulff-Nilsen:
Faster Deterministic Fully-Dynamic Graph Connectivity. 738-741 - Donghyun Kim, Wei Wang, Weili Wu, Alade O. Tokuta:
Fault-Tolerant Connected Dominating Set. 741-745 - Ben W. Reichardt:
Fault-Tolerant Quantum Computation. 745-749 - Paul Wollan:
Finding Topological Subgraphs. 749-752 - György Dósa:
First Fit Algorithm for Bin Packing. 753-755 - Guy Kortsarz:
Fixed-Parameter Approximability and Hardness. 756-761 - Yoji Kajitani:
Floorplan and Placement. 761-766 - Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. 766-768 - Ulrik Brandes:
Force-Directed Graph Drawing. 768-773 - Jason Cong, Yuzheng Ding:
FPGA Technology Mapping. 773-777 - George Karakostas:
Fractional Packing and Covering Problems. 778-782 - Takashi Washio:
Frequent Graph Mining. 782-785 - Takeaki Uno:
Frequent Pattern Mining. 785-789 - Giuseppe F. Italiano:
Fully Dynamic All Pairs Shortest Paths. 790-792 - Valerie King:
Fully Dynamic Connectivity. 792-793 - Giuseppe F. Italiano:
Fully Dynamic Connectivity: Upper and Lower Bounds. 793-797 - Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity. 797-800 - Giuseppe F. Italiano:
Fully Dynamic Higher Connectivity for Planar Graphs. 800-802 - Giuseppe F. Italiano:
Fully Dynamic Minimum Spanning Trees. 802-805 - Giuseppe F. Italiano:
Fully Dynamic Planarity Testing. 806-808 - Valerie King:
Fully Dynamic Transitive Closure. 808-809
G
- Vijay Sundararajan:
Gate Sizing. 811-814 - Li-Sha Huang:
General Equilibrium. 814-817 - Julia Chuzhoy:
Generalized Steiner Network. 817-819 - René A. Sitters:
Generalized Two-Server Problem. 819-821 - Makoto Yokoo:
Generalized Vickrey Auction. 821-824 - Aaron Zollinger:
Geographic Routing. 825-828 - Aleksandar Nikolov:
Geometric Approaches to Answering Queries. 828-834 - Rolf Klein:
Geometric Dilation of Geometric Networks. 834-837 - Shin-Ichi Nakano:
Geometric Object Enumeration. 837-840 - John Hershberger:
Geometric Shortest Paths in the Plane. 840-846 - Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Geometric Spanners. 846-852 - Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. 852-856 - Minsik Cho, David Z. Pan:
Global Routing. 856-858 - Debmalya Panigrahi:
Gomory-Hu Trees. 858-861 - Hideo Bannai:
Grammar Compression. 861-866 - James R. Lee:
Graph Bandwidth. 866-869 - Michael Langberg, Chandra Chekuri:
Graph Coloring. 869-872 - Samir Khuller, Balaji Raghavachari:
Graph Connectivity. 872-875 - Brendan D. McKay:
Graph Isomorphism. 875-879 - Andrew McGregor:
Graph Sketching. 879-882 - Weili Wu, Feng Wang:
Greedy Approximation Algorithms. 882-886 - Neal E. Young:
Greedy Set-Cover Algorithms. 886-889
H
- Charilaos Efthymiou, Paul (Pavlos) Spirakis:
Hamilton Cycles in Random Intersection Graphs. 891-894 - Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Haplotype Inference on Pedigrees Without Recombinations. 894-897 - Vitaly Feldman:
Hardness of Proper Learning. 897-900 - Leah Epstein:
Harmonic Algorithm for Online Bin Packing. 900-902 - David Doty:
Hierarchical Self-Assembly. 903-909 - Mark de Berg:
Hierarchical Space Decompositions for Low-Density Scenes. 909-914 - David A. Bader:
High Performance Algorithm Engineering for Large-Scale Problems. 914-918 - Jin-Yi Cai, Heng Guo, Tyson Williams:
Holant Problems. 918-921 - Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms. 921-926 - David F. Manlove:
Hospitals/Residents Problem. 926-930 - Chien-Chung Huang:
Hospitals/Residents Problems with Quota Lower Bounds. 930-932 - Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Labeling (2-Hop Labeling). 932-938 - Alistair Moffat:
Huffman Coding. 938-942
I
- Norbert Zeh, Ulrich Meyer:
I/O-Model. 943-947 - Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. 947-951 - Lyle A. McGeoch:
Implementation Challenge for TSP Heuristics. 952-954 - Eric Ruppert:
Implementing Shared Registers in Asynchronous Message-Passing Systems. 954-958 - Xi Chen:
Incentive Compatible Selection. 958-960 - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
Independent Sets in Random Intersection Graphs. 961-964 - Wing-Kin Sung:
Indexed Approximate String Matching. 964-968 - Chee Yong Chan, Minos N. Garofalakis, Rajeev Rastogi:
Indexed Regular Expression Matching. 968-973 - Joong Chae Na, Paolo Ferragina, Raffaele Giancarlo, Kunsoo Park:
Indexed Two-Dimensional String Matching. 973-977 - Sandra Zilles:
Inductive Inference. 977-980 - Yuqing Zhu, Weili Wu:
Influence and Profit. 980-985 - Zaixin Lu, Weili Wu:
Influence Maximization. 985-987 - Andrew Kane, Alejandro López-Ortiz:
Intersections of Inverted Lists. 988-993 - Damien Woods:
Intrinsic Universality in Self-Assembly. 993-998
J
- Andréa W. Richa, Christian Scheideler:
Jamming-Resistant MAC Protocols for Wireless Networks. 999-1002 - David Eppstein:
k-Best Enumeration. 1003-1006
K
- Daniel Lokshtanov:
Kernelization, Bidimensionality and Kernels. 1006-1011 - Gregory Z. Gutin:
Kernelization, Constraint Satisfaction Problems Parameterized above Average. 1011-1013 - Hans L. Bodlaender:
Kernelization, Exponential Lower Bounds. 1013-1017 - Magnus Wahlström:
Kernelization, Matroid Methods. 1017-1021 - Mark Jones:
Kernelization, Max-Cut Above Tight Bounds. 1021-1024 - Anders Yeo:
Kernelization, MaxLin Above Average. 1024-1028 - Christian Komusiewicz:
Kernelization, Partially Polynomial Kernels. 1028-1031 - Gregory Z. Gutin:
Kernelization, Permutation CSPs Parameterized above Average. 1031-1033 - Neeldhara Misra:
Kernelization, Planar F-Deletion. 1033-1036 - Stefan Kratsch:
Kernelization, Polynomial Lower Bounds. 1036-1039 - Stefan Kratsch:
Kernelization, Preprocessing for Treewidth. 1040-1042 - Henning Fernau:
Kernelization, Turing Kernels. 1043-1045 - Bettina Speckmann:
Kinetic Data Structures. 1046-1048 - Hans Kellerer:
Knapsack. 1048-1051 - Yoram Moses:
Knowledge in Distributed Systems. 1051-1055
L
- Julia Chuzhoy:
Large-Treewidth Graph Decompositions. 1057-1059 - Haitong Tian, Martin D. F. Wong:
Layout Decomposition for Multiple Patterning. 1059-1062 - Bei Yu, David Z. Pan:
Layout Decomposition for Triple Patterning. 1062-1065 - Stefano Varricchio:
Learning Automata. 1066-1070 - A. A. Servedio:
Learning Constant-Depth Circuits. 1070-1074 - Jeffrey C. Jackson:
Learning DNF Formulas. 1074-1078 - Luca Trevisan:
Learning Heavy Fourier Coefficients of Boolean Functions. 1078-1081 - Adi Akavia:
Learning Significant Fourier Coefficients over Finite Abelian Groups. 1081-1086 - Peter Auer:
Learning with Malicious Noise. 1086-1089 - Christino Tamon:
Learning with the Aid of an Oracle. 1089-1092 - Christos D. Zaroliagis:
LEDA: a Library of Efficient Algorithms. 1092-1095 - Simon J. Puglisi:
Lempel-Ziv Compression. 1095-1100 - Yinyu Ye:
Leontief Economy Equilibrium. 1100-1103 - Nicolas Trotignon:
LexBFS, Structure, and Algorithms. 1103-1107 - Sofya Raskhodnikova, Ronitt Rubinfeld:
Linearity Testing/Testing Hadamard Codes. 1107-1110 - Maurice Herlihy:
Linearizability. 1111-1114 - Atri Rudra:
List Decoding near Capacity: Folded RS Codes. 1114-1117 - Riko Jacob, Ulrich Meyer, Laura Toma:
List Ranking. 1117-1121 - Leah Epstein:
List Scheduling. 1121-1124 - Henry Leung:
Local Alignment (with Affine Gap Weights). 1124-1126 - Siu-Ming Yiu:
Local Alignment (with Concave Gap Weights). 1126-1128 - Fabian Kuhn:
Local Approximation of Covering and Packing Problems. 1129-1132 - Thomas Moscibroda:
Local Computation in Unstructured Radio Networks. 1133-1136 - Seshadhri Comandur:
Local Reconstruction. 1136-1139 - Kamesh Munagala:
Local Search for K-medians and Facility Location. 1139-1143 - Pierre Fraigniaud:
Locality in Distributed Graph Algorithms. 1143-1148 - Shubhangi Saraf:
Locally Decodable Codes. 1149-1152 - Prahladh Harsha:
Locally Testable Codes. 1152-1156 - Michael Elkin:
Low Stretch Spanning Trees. 1156-1159 - Michal Pilipczuk:
Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover. 1159-1162 - Mihai Patrascu:
Lower Bounds for Dynamic Connectivity. 1162-1167 - Rob van Stee:
Lower Bounds for Online Bin Packing. 1167-1169 - Martin Farach-Colton:
Lowest Common Ancestors in Trees. 1169-1174 - M. S. Ramanujan:
LP Based Parameterized Algorithms. 1175-1177 - Jonathan Feldman:
LP Decoding. 1177-1182
M
- Qizhi Fang:
Majority Equilibrium. 1183-1185 - Siu-Wing Cheng:
Manifold Reconstruction. 1185-1189 - Vahab S. Mirrokni:
Market Games and Content Distribution. 1189-1195 - Surender Baswana, Manoj Gupta, Sandeep Sen:
Matching in Dynamic Graphs. 1195-1199 - Ning Chen, Mengling Li:
Matching Market Equilibrium Algorithms. 1199-1203 - Fahad Panolan, Saket Saurabh:
Matroids in Parameterized Complexity and Exact Algorithms. 1203-1206 - Alantha Newman:
Max Cut. 1206-1210 - Frances A. Rosamond:
Max Leaf Spanning Tree. 1211-1215 - Csanád Imreh:
Maximizing the Minimum Machine Load. 1216-1218 - Ramesh Hariharan:
Maximum Agreement Subtree (of 2 Binary Trees). 1218-1221 - Teresa M. Przytycka:
Maximum Agreement Subtree (of 3 or More Trees). 1221-1224 - Jesper Jansson, Wing-Kin Sung:
Maximum Agreement Supertree. 1224-1227 - Eric McDermid:
Maximum Cardinality Stable Matchings. 1227-1230 - Vincent Berry:
Maximum Compatible Tree. 1230-1234 - Weili Wu, Ling Ding:
Maximum Lifetime Coverage. 1235-1238 - Marcin Mucha:
Maximum Matching. 1238-1240 - Kun-Mao Chao:
Maximum-Average Segments. 1241-1242 - Kun-Mao Chao:
Maximum-Sum Segments. 1242-1244 - Deeparnab Chakrabarty:
Max-Min Allocation. 1244-1247 - Kobbi Nissim, David Xiao:
Mechanism Design and Differential Privacy. 1247-1256 - Danny Hendler:
Mellor-Crummey and Scott Mutual Exclusion Algorithm. 1256-1260 - Matias Korman:
Memory-Constrained Algorithms. 1260-1264 - Paola Flocchini:
Memoryless Gathering of Mobile Robotic Sensors. 1264-1268 - Tamal Krishna Dey:
Meshing Piecewise Smooth Complexes. 1269-1272 - Michel Raynal:
Message Adversaries. 1272-1276 - Markus Bläser:
Metric TSP. 1276-1279 - Manor Mendel:
Metrical Task Systems. 1279-1282 - Edith Cohen:
Min-Hash Sketches. 1282-1287 - Mamadou Moustapha Kanté, Lhouari Nourine:
Minimal Dominating Set Enumeration. 1287-1291 - Paolo Boldi, Sebastiano Vigna:
Minimal Perfect Hash Functions. 1291-1294 - Robert Krauthgamer:
Minimum Bisection. 1294-1297 - Dimitris Fotakis, Paul (Pavlos) Spirakis:
Minimum Congestion Redundant Assignments. 1298-1302 - Lidong Wu, Weili Wu:
Minimum Connected Sensor Cover. 1302-1304 - Christoph Ambühl:
Minimum Energy Broadcasting in Wireless Geometric Networks. 1305-1308 - Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder:
Minimum Energy Cost Broadcasting in Wireless Networks. 1308-1312 - Nikhil Bansal:
Minimum Flow Time. 1312-1315 - Christos Levcopoulos:
Minimum Geometric Spanning Trees. 1315-1318 - Artur Czumaj, Andrzej Lingas:
Minimum k-Connected Geometric Networks. 1318-1322 - Seth Pettie:
Minimum Spanning Trees. 1322-1325 - Christos Levcopoulos:
Minimum Weight Triangulation. 1325-1328 - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Minimum Weighted Completion Time. 1328-1331 - Sungjin Im:
Min-Sum Set Cover and Its Generalizations. 1331-1334 - Graham Cormode:
Misra-Gries Summaries. 1334-1337 - Evangelos Kranakis, Danny Krizanc:
Mobile Agents and Exploration. 1338-1341 - Bruno Courcelle, Irène Durand:
Model Checking with Fly-Automata. 1341-1346 - My T. Thai:
Modularity Maximization in Complex Networks. 1346-1349 - Paolo Boldi, Sebastiano Vigna:
Monotone Minimal Perfect Hash Functions. 1349-1352 - Deeparnab Chakrabarty:
Monotonicity Testing. 1352-1356 - Nicolò Cesa-Bianchi:
Multi-armed Bandit Problem. 1356-1359 - Chandra Chekuri:
Multicommodity Flow, Well-linked Terminals and Routing Problems. 1359-1363 - Shuchi Chawla:
Multicut. 1363-1366 - Amihood Amir:
Multidimensional Compressed Pattern Matching. 1366-1369 - Juha Kärkkäinen:
Multidimensional String Matching. 1369-1372 - Nikhil Bansal:
Multilevel Feedback Queues. 1373-1375 - Ioannis Koutis:
Multilinear Monomial Detection. 1375-1378 - Maxime Crochemore, Thierry Lecroq:
Multiple String Matching. 1378-1382 - Tian-Ming Bu:
Multiple Unit Auctions with Budget Constraint. 1382-1383 - Vera Asodi:
Multiplex PCR for Gap Closing (Whole-Genome Assembly). 1383-1386 - George B. Mertzios:
Multitolerance Graphs. 1386-1390 - Gruia Calinescu:
Multiway Cut. 1390-1393 - Qiuming Yao, Jianjiong Gao, Dong Xu:
Musite: Tool for Predicting Protein Phosphorylation Sites. 1393-1397
N
- Weizhao Wang, Xiang-Yang Li, Xiaowen Chu:
Nash Equilibria and Dominant Strategies in Routing. 1399-1402 - Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. 1402-1405 - Christos D. Zaroliagis:
Negative Cycles in Weighted Digraphs. 1405-1408 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
Network Creation Games. 1408-1412 - Xi Chen, Xiaotie Deng:
Non-approximability of Bimatrix Nash Equilibria. 1412-1414 - Wing-Kai Hon:
Non-shared Edges. 1414-1416 - Stephan Kreutzer:
Nowhere Crownful Classes of Directed Graphs. 1416-1419 - Qizhi Fang:
Nucleolus. 1419-1422
O
- Chengwen Chris Wang, Daniel Dominic Sleator:
O(log log n)-Competitive Binary Search Tree. 1423-1426 - Nikhil Bansal:
Oblivious Routing. 1426-1430 - Jelani Nelson:
Oblivious Subspace Embeddings. 1430-1434 - Sotiris E. Nikoletseas, Olivier Powell:
Obstacle Avoidance Algorithms in Wireless Sensor Networks. 1434-1439 - Leah Epstein:
Online Interval Coloring. 1439-1443 - Yaoliang Yu:
Online Learning and Optimization. 1443-1448 - Shahin Kamali:
Online List Update. 1448-1451 - Leah Epstein:
Online Load Balancing of Temporary Tasks. 1452-1455 - Debmalya Panigrahi:
Online Node-Weighted Problems. 1455-1457 - Neal E. Young:
Online Paging and Caching. 1457-1461 - Jiri Sgall:
Online Preemptive Scheduling on Parallel Machines. 1461-1464 - Balasubramanian Sivan:
Optimal Crowdsourcing Contests. 1464-1467 - Juan A. Garay:
Optimal Probabilistic Synchronous Byzantine Agreement. 1467-1470 - Robert W. Irving:
Optimal Stable Marriage. 1470-1473 - Tiow Seng Tan:
Optimal Triangulation. 1474-1477 - Robert P. Dick:
Optimal Two-Level Boolean Minimization. 1477-1481 - Nitish Korula:
Orienteering Problems. 1481-1484 - Yakov Nekrich:
Orthogonal Range Searching on Discrete Grids. 1484-1489
P
- Dahlia Malkhi:
P2P. 1491-1497 - Joel Ratsaby:
PAC Learning. 1497-1500 - Lenore J. Cowen:
Packet Routing. 1500-1503 - Markus Schmidt:
Packet Switching in Multi-queue Switches. 1503-1506 - Rob van Stee:
Packet Switching in Single Buffer. 1506-1509 - Monika Henzinger:
PageRank Algorithm. 1509-1511 - Maria J. Serna:
Parallel Algorithms for Two Processors Precedence Constraint Scheduling. 1511-1514 - Tak Wah Lam:
Parallel Connectivity and Minimum Spanning Trees. 1514-1516 - Piotr Faliszewski, Rolf Niedermeier:
Parameterization in Computational Social Choice. 1516-1520 - Henning Fernau:
Parameterized Algorithms for Drawing Graphs. 1520-1525 - Moshe Lewenstein:
Parameterized Pattern Matching. 1525-1530 - Stefan Szeider:
Parameterized SAT. 1530-1532 - Tim A. C. Willemse, Maciej Gazda:
Parity Games. 1532-1537 - Masayuki Takeda, Ayumi Shinohara:
Pattern Matching on Compressed Text. 1538-1542 - Shinnosuke Seki:
Patterned Self-Assembly Tile Set Synthesis. 1542-1545 - Bin Ma:
Peptide De Novo Sequencing with MS/MS. 1545-1547 - Shai Shalev-Shwartz:
Perceptron Algorithm. 1547-1550 - Jesper Jansson:
Perfect Phylogeny (Bounded Number of States). 1550-1553 - Giuseppe Lancia:
Perfect Phylogeny Haplotyping. 1553-1557 - Rajmohan Rajaraman:
Performance-Driven Clustering. 1557-1559 - Katsuhisa Yamanaka:
Permutation Enumeration. 1559-1564 - Jesper Jansson:
Phylogenetic Tree Construction from a Distance Matrix. 1564-1567 - Marcin Pilipczuk:
Planar Directed k-Vertex-Disjoint Paths Problem. 1567-1570 - Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid:
Planar Geometric Spanners. 1570-1574 - Glencora Borradaile:
Planar Maximum Flow - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs. 1574-1576 - Glencora Borradaile:
Planar Maximum s- t Flow. 1576-1579 - Markus Chimani:
Planarisation and Crossing Minimisation. 1579-1584 - Glencora Borradaile:
Planarity Testing. 1584-1585 - Marcel Roeloffzen:
Point Location. 1585-1589 - Veli Mäkinen, Esko Ukkonen:
Point Pattern Matching. 1589-1592 - Jan Vahrenhold:
Polygon Triangulation. 1592-1596 - Wei Wei Sun:
Position Auction. 1597-1598 - Sachin S. Sapatnekar:
Power Grid Analysis. 1598-1601 - Mihai Patrascu:
Predecessor Search. 1601-1605 - Djamal Belazzougui:
Predecessor Search, String Algorithms and Data Structures. 1605-1611 - George Christodoulou:
Price of Anarchy. 1611-1614 - Artur Czumaj, Berthold Vöcking:
Price of Anarchy for Machines Models. 1614-1618 - Zhiyi Huang:
Privacy Preserving Auction. 1618-1622 - Moritz Hardt:
Private Spectral Analysis. 1622-1626 - Sotiris E. Nikoletseas:
Probabilistic Data Forwarding in Wireless Sensor Networks. 1626-1631 - Wen Xu, Weili Wu, Ding-Zhu Du:
Probe Selection. 1631-1634 - Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Prophet Inequality and Online Auctions. 1634-1636
Q
- Herman J. Haverkort, Laura Toma:
Quadtrees and Morton Indexing. 1637-1642 - Colin Campbell, Réka Albert:
Quantification of Regulation in Networks with Positive and Negative Interaction Weights. 1642-1646 - Andris Ambainis:
Quantum Algorithm for Element Distinctness. 1646-1651 - Sean Hallgren:
Quantum Algorithm for Factoring. 1651-1652 - Stacey Jeffery, Peter C. Richter:
Quantum Algorithm for Finding Triangles. 1652-1656 - Andris Ambainis:
Quantum Algorithm for Search on Grids. 1656-1660 - Sean Hallgren:
Quantum Algorithm for Solving Pell's Equation. 1660-1662 - Gilles Brassard, Peter Høyer, Alain Tapp:
Quantum Algorithm for the Collision Problem. 1662-1664 - Pranab Sen:
Quantum Algorithm for the Discrete Logarithm Problem. 1664-1667 - Yaoyun Shi:
Quantum Algorithm for the Parity Problem. 1667-1669 - Sean Hallgren:
Quantum Algorithms for Class Group of a Number Field. 1669-1671 - Aleksandrs Belovs:
Quantum Algorithms for Graph Connectivity. 1671-1673 - Robin Kothari, Ashwin Nayak:
Quantum Algorithms for Matrix Multiplication and Product Verification. 1673-1677 - Sergio Boixo, Rolando D. Somma:
Quantum Algorithms for Simulated Annealing. 1677-1680 - Aram W. Harrow:
Quantum Algorithms for Systems of Linear Equations. 1680-1683 - Ashwin Nayak, Peter C. Richter, Mario Szegedy:
Quantum Analogues of Markov Chains. 1683-1691 - Zeph Landau:
Quantum Approximation of the Jones Polynomial. 1691-1695 - Barbara M. Terhal:
Quantum Dense Coding. 1695-1698 - Martin Roetteler:
Quantum Error Correction. 1698-1703 - Renato Renner:
Quantum Key Distribution. 1703-1707 - Apoorva D. Patel, Lov K. Grover:
Quantum Search. 1707-1716 - Jonathan R. Ullman:
Query Release via Online Learning. 1716-1719 - Dahlia Malkhi:
Quorums. 1719-1724
R
- Vicky Papadopoulou:
Radiocoloring in Planar Graphs. 1725-1728 - Abraham Flaxman:
Random Planted 3-SAT. 1728-1732 - Tushar Deepak Chandra:
Randomization in Distributed Computing. 1732-1734 - Alon Itai:
Randomized Broadcasting in Radio Networks. 1734-1738 - Marek Cygan:
Randomized Contraction. 1738-1741 - Pierre Leone, Sotiris E. Nikoletseas, José D. P. Rolim:
Randomized Energy Balance Algorithms in Sensor Networks. 1741-1745 - Leszek Gasieniec:
Randomized Gossiping in Radio Networks. 1745-1747 - Vijaya Ramachandran:
Randomized Minimum Spanning Tree. 1747-1750 - Maria J. Serna:
Randomized Parallel Approximations to Max Flow. 1750-1753 - Rajmohan Rajaraman:
Randomized Rounding. 1753-1757 - Stephen R. Tate:
Randomized Searching on Rays or the Line. 1757-1759 - David Doty:
Randomized Self-Assembly. 1759-1767 - Marc J. van Kreveld, Maarten Löffler:
Range Searching. 1767-1771 - Rajeev Raman:
Rank and Select Operations on Bit Strings. 1772-1775 - Travis Gagie:
Rank and Select Operations on Sequences. 1776-1780 - Telikepalli Kavitha:
Ranked Matching. 1780-1784 - Nathan Fisher, Sanjoy K. Baruah:
Rate-Monotonic Scheduling. 1784-1788 - Hai Zhou:
Rectilinear Spanning Tree. 1788-1792 - Hai Zhou:
Rectilinear Steiner Tree. 1792-1797 - Shay Mozes:
Recursive Separator Decompositions for Planar Graphs. 1797-1801 - Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
Reducing Bayesian Mechanism Design to Algorithm Design. 1801-1808 - Paul M. B. Vitányi:
Registers. 1808-1812 - Lucian Ilie:
Regular Expression Matching. 1812-1816 - Eyal Even-Dar:
Reinforcement Learning. 1816-1820 - Maurice Herlihy:
Renaming. 1820-1823 - Gagan Goel, Mohammad Reza Khani:
Revenue Monotone Auctions. 1824-1839 - Masashi Kiyomi:
Reverse Search; Enumeration Algorithms. 1840-1842 - Rune B. Lyngsø:
RNA Secondary Structure Boltzmann Distribution. 1842-1846 - Rune B. Lyngsø:
RNA Secondary Structure Prediction by Minimum Free Energy. 1846-1850 - Rune B. Lyngsø:
RNA Secondary Structure Prediction Including Pseudoknots. 1850-1853 - Elmar Langetepe:
Robotics. 1853-1858 - Kim-Manuel Klein:
Robust Bin Packing. 1858-1860 - Chee K. Yap, Vikram Sharma:
Robust Geometric Computation. 1860-1863 - José Verschae:
Robust Scheduling Algorithms. 1863-1865 - Ho-Lin Chen:
Robustness in Self-Assembly. 1865-1868 - József Békési, Gábor Galambos:
Routing. 1868-1871 - Stephane Durocher, Leszek Gasieniec, Prudence W. H. Wong:
Routing in Geometric Networks. 1871-1875 - Dominik Schultes:
Routing in Road Networks with Transit Nodes. 1875-1879 - Hongwei Du, Haiming Luo:
Routing-Cost Constrained Connected Dominating Set. 1879-1883 - Ke Yi:
R-Trees. 1884-1887 - Lidan Fan, Weili Wu:
Rumor Blocking. 1887-1892
S
- Panagiota Fatourou:
Schedulers for Optimistic Rate Based Flow Control. 1893-1897 - Xiaofeng Gao:
Scheduling in Data Broadcasting. 1897-1905 - Matthias Englert, Matthias Westermann:
Scheduling with a Reordering Buffer. 1905-1910 - MohammadHossein Bateni:
Secretary Problems and Online Auctions. 1910-1913 - Pierre-Étienne Meunier:
Self-Assembly at Temperature 1. 1913-1918 - Matthew J. Patitz:
Self-Assembly of Fractals. 1918-1922 - Robert T. Schweller:
Self-Assembly of Squares and Scaled Shapes. 1922-1925 - Andrew Winslow:
Self-Assembly with General Shaped Tiles. 1925-1927 - Leah Epstein:
Selfish Bin Packing Problems. 1927-1930 - Paul (Pavlos) Spirakis:
Selfish Unsplittable Flows: Algorithms for Pure Equilibria. 1930-1932 - Ted Herman:
Self-Stabilization. 1932-1936 - Avrim Blum:
Semi-supervised Learning. 1936-1941 - Goran Konjevod:
Separators in Graphs. 1941-1945 - Jie Liang, Ronald Jackups Jr.:
Sequence and Spatial Motif Discovery in Short Sequence Fragments. 1945-1952 - Peichen Pan:
Sequential Circuit Technology Mapping. 1952-1956 - Michel Raynal:
Set Agreement. 1956-1959 - Michael Dom:
Set Cover with Almost Consecutive Ones. 1960-1963 - Rajesh Chitnis, Mohammad Taghi Hajiaghayi:
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs. 1963-1966 - Nikhil Bansal:
Shortest Elapsed Time First Scheduling. 1966-1969 - Riko Jacob:
Shortest Paths Approaches for Timetable Information. 1969-1971 - Jittat Fakcharoenphol, Satish Rao:
Shortest Paths in Planar Graphs with Negative Weight Edges. 1971-1974 - Daniele Micciancio:
Shortest Vector Problem. 1974-1977 - Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park:
Similarity Between Compressed Strings. 1977-1981 - Surender Baswana, Sandeep Sen:
Simple Algorithms for Spanners in Weighted Graphs. 1981-1986 - Zoltán Király:
Simpler Approximation for Stable Marriage. 1986-1988 - Sergey I. Nikolenko, Kirill Kogan:
Single and Multiple Buffer Processing. 1988-1994 - Camil Demetrescu, Giuseppe F. Italiano:
Single-Source Fully Dynamic Reachability. 1994-1996 - Seth Pettie:
Single-Source Shortest Paths. 1996-1999 - Mark S. Manasse:
Ski Rental Problem. 1999-2002 - Evangeline F. Y. Young:
Slicing Floorplan Orientation. 2002-2006 - Vladimir Braverman:
Sliding Window Algorithms. 2006-2011 - Tamal Krishna Dey:
Smooth Surface and Volume Meshing. 2011-2014 - Heiko Röglin:
Smoothed Analysis. 2014-2017 - Eric Ruppert:
Snapshots in Shared Memory. 2017-2022 - Chin Lung Lu:
Sorting by Transpositions and Reversals (Approximate Ratio 1.5). 2022-2026 - David A. Bader:
Sorting Signed Permutations by Reversal (Reversal Distance). 2026-2028 - Eric Tannier:
Sorting Signed Permutations by Reversal (Reversal Sequence). 2028-2032 - Ittai Abraham, Ofer Neiman:
Spanning Trees with Low Average Stretch. 2032-2035 - Eric Price:
Sparse Fourier Transform. 2036-2041 - Michael Elkin:
Sparse Graph Spanners. 2041-2043 - Shuchi Chawla:
Sparsest Cut. 2043-2045 - Kirk Pruhs:
Speed Scaling. 2045-2047 - Danny Z. Chen:
Sphere Packing Problem. 2047-2051 - Christophe Paul:
Split Decomposition via Graph-Labelled Trees. 2051-2056 - Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. 2056-2060 - Robert W. Irving:
Stable Marriage. 2060-2064 - Akihisa Tamura:
Stable Marriage and Discrete Convex Analysis. 2064-2068 - Hiroki Yanagisawa:
Stable Marriage with One-Sided Ties. 2068-2071 - Kazuo Iwama, Shuichi Miyazaki:
Stable Marriage with Ties and Incomplete Lists. 2071-2075 - Katarína Cechlárová:
Stable Partition Problem. 2075-2078 - Alexis C. Kaporis, Paul (Pavlos) Spirakis:
Stackelberg Games: The Price of Optimum. 2078-2083 - Andrew Winslow:
Staged Assembly. 2083-2085 - István Miklós:
Statistical Multiple Alignment. 2086-2090 - Vitaly Feldman:
Statistical Query Learning. 2090-2095 - Sachin S. Sapatnekar:
Statistical Timing Analysis. 2095-2099 - Guido Schäfer:
Steiner Forest. 2099-2102 - Weili Wu, Yaochun Huang:
Steiner Trees. 2102-2107 - Viswanath Nagarajan:
Stochastic Knapsack. 2107-2110 - Jay Sethuraman:
Stochastic Scheduling. 2110-2113 - Maxime Crochemore, Thierry Lecroq:
String Matching. 2113-2117 - Rolf Fagerberg:
String Sorting. 2117-2121 - Zhang Zhao:
Strongly Connected Dominating Set. 2121-2124 - Fedor V. Fomin:
Subexponential Parameterized Algorithms. 2124-2126 - Julián Mestre:
Subset Sum Algorithm for Bin Packing. 2126-2129 - Mathieu Blanchette:
Substring Parsimony. 2129-2131 - Jérémy Barbay:
Succinct and Compressed Data Structures for Permutations and Integer Functions. 2132-2136 - Meng He:
Succinct Data Structures for Parentheses Matching. 2136-2139 - Juha Kärkkäinen:
Suffix Array Construction. 2141-2144 - Jens Stoye:
Suffix Tree Construction. 2144-2149 - Paolo Ferragina:
Suffix Tree Construction in Hierarchical Memory. 2149-2154 - Alberto Apostolico, Fabio Cunial:
Suffix Trees and Arrays. 2154-2162 - Nikola S. Nikolov:
Sugiyama Algorithm. 2162-2166 - Louxin Zhang:
Superiority and Complexity of the Spaced Seeds. 2166-2170 - Nello Cristianini, Elisa Ricci:
Support Vector Machines. 2170-2174 - Nina Amenta:
Surface Reconstruction. 2174-2177 - Adnan Aziz, Amit Prakash:
Symbolic Model Checking. 2178-2182 - Seokhee Hong:
Symmetric Graph Drawing. 2182-2189 - Michael Elkin:
Synchronizers, Spanners. 2189-2191
T
- Raffaele Giancarlo, Adam L. Buchsbaum:
Table Compression. 2193-2198 - Paul (Pavlos) Spirakis:
Tail Bounds for Occupancy Problems. 2198-2199 - Kurt Keutzer, Kaushik Ravindran:
Technology Mapping. 2200-2204 - Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain, Priyanka Mukhopadhyay:
Teleportation of Quantum States. 2205-2209 - Scott M. Summers:
Temperature Programming in Self-Assembly. 2209-2212 - Oded Goldreich, Dana Ron:
Testing Bipartiteness in the Dense-Graph Model. 2212-2216 - Oded Goldreich, Dana Ron:
Testing Bipartiteness of Graphs in Sublinear Time. 2216-2219 - Sofya Raskhodnikova:
Testing if an Array Is Sorted. 2219-2222 - Eric Blais:
Testing Juntas and Related Properties of Boolean Functions. 2222-2226 - Srinivas Aluru:
Text Indexing. 2226-2231 - David R. Wood:
Three-Dimensional Graph Drawing. 2231-2236 - Alexis C. Kaporis, Lefteris M. Kirousis:
Thresholds of Random k-Sat. 2236-2239 - Maurice Herlihy:
Topology Approach in Distributed Computing. 2239-2242 - Camil Demetrescu, Giuseppe F. Italiano:
Trade-Offs for Dynamic Graph Problems. 2242-2246 - Nir Shavit, Alexander Matveev:
Transactional Memory. 2246-2249 - Yoshio Okamoto:
Traveling Sales Person with Few Inner Points. 2249-2252 - Shin-Ichi Nakano:
Tree Enumeration. 2252-2254 - Hans L. Bodlaender:
Treewidth of Graphs. 2255-2257 - Xiaohui Bei, Ning Chen, Shengyu Zhang:
Trial and Error Algorithms. 2258-2261 - Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac:
Triangulation Data Structures. 2262-2267 - Moshe Babaioff:
Truthful Mechanisms for One-Parameter Agents. 2267-2271 - Weizhao Wang, Xiang-Yang Li, Yu Wang:
Truthful Multicast. 2271-2274 - Edgar Ramos:
TSP-Based Curve Reconstruction. 2274-2278 - Amihood Amir:
Two-Dimensional Scaled Pattern Matching. 2278-2282 - Stéphane Vialette:
Two-Interval Pattern Problems. 2282-2287
U
- Jiong Guo:
Undirected Feedback Vertex Set. 2289-2291 - Derek G. Corneil, Michel Habib:
Unified View of Graph Searching and LDFS-Based Certifying Algorithms. 2291-2297 - Paola Flocchini:
Uniform Covering of Rings and Lines by Memoryless Mobile Sensors. 2297-2301 - Timon Hertli:
Unique k-SAT and General k-SAT. 2301-2304 - Julián Mestre, Nicole Megow:
Universal Sequencing on an Unreliable Machine. 2304-2308 - Walter Didimo:
Upward Graph Drawing. 2308-2312 - Piotr Krysta, Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents. 2312-2318
V
- David S. Johnson:
Vector Bin Packing. 2319-2323 - Tjark Vredeveld:
Vector Scheduling Problems. 2323-2326 - Jianer Chen:
Vertex Cover Kernelization. 2327-2330 - Jianer Chen:
Vertex Cover Search Trees. 2330-2333 - Camil Demetrescu, Giuseppe F. Italiano:
Visualization Techniques for Algorithm Engineering. 2333-2337 - Ming Min Li:
Voltage Scheduling. 2337-2340 - Rolf Klein:
Voronoi Diagrams and Delaunay Triangulations. 2340-2344
W
- Mark Moir:
Wait-Free Synchronization. 2345-2351 - Tomasz Jurdzinski, Dariusz R. Kowalski:
Wake-Up Problem in Multi-Hop Radio Networks. 2352-2354 - Roberto Grossi:
Wavelet Trees. 2355-2359 - Yu Wang, Weizhao Wang, Xiang-Yang Li:
Weighted Connected Dominating Set. 2359-2363 - Julián Mestre:
Weighted Popular Matchings. 2363-2365 - Pavlos S. Efraimidis, Paul (Pavlos) Spirakis:
Weighted Random Sampling. 2365-2367 - Rolf Klein:
Well Separated Pair Decomposition. 2368-2371 - Jie Gao, Li Zhang:
Well Separated Pair Decomposition for Unit-Disk Graph. 2371-2374 - Chris Chu:
Wire Sizing. 2374-2378 - Marek Chrobak:
Work-Function Algorithm for k-Servers. 2378-2380
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-22 19:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
