| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Class of Asymptotically Stable Algorithms for Learning-Rate Adaptation
|
Rüger, S. M.
|
|
Inc.
|
|
1-2 |
p. 198-210
|
artikel
|
| 2 |
A Competitive Analysis for Balanced Transactional Memory Workloads
|
Sharma, Gokarna
|
|
2011
|
|
1-2 |
p. 296-322
|
artikel
|
| 3 |
Adaptive AIMD Congestion Control
|
Kesselman, Alex
|
|
2005
|
|
1-2 |
p. 97-111
|
artikel
|
| 4 |
A Distributed Algorithm for Computing the Node Search Number in Trees
|
Coudert, David
|
|
2011
|
|
1-2 |
p. 158-190
|
artikel
|
| 5 |
A Good Oracle Is Hard to Beat
|
Cenzer, D. A.
|
|
Inc.
|
|
1-2 |
p. 18-34
|
artikel
|
| 6 |
Aligning Two Convex Figures to Minimize Area or Perimeter
|
Ahn, Hee-Kap
|
|
2010
|
|
1-2 |
p. 464-479
|
artikel
|
| 7 |
A Linear Algorithm for the Random Sampling from Regular Languages
|
Bernardi, Olivier
|
|
2010
|
|
1-2 |
p. 130-145
|
artikel
|
| 8 |
Almost Exact Matchings
|
Yuster, Raphael
|
|
2011
|
|
1-2 |
p. 39-50
|
artikel
|
| 9 |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
|
Ivanyos, Gábor
|
|
2010
|
|
1-2 |
p. 480-498
|
artikel
|
| 10 |
An Exact Exponential Time Algorithm for Power Dominating Set
|
Binkele-Raible, Daniel
|
|
2011
|
|
1-2 |
p. 323-346
|
artikel
|
| 11 |
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
|
Blum, A.
|
|
Inc.
|
|
1-2 |
p. 35-52
|
artikel
|
| 12 |
Approximability of the Firefighter Problem
|
Anshelevich, Elliot
|
|
2010
|
|
1-2 |
p. 520-536
|
artikel
|
| 13 |
Approximating Node-Connectivity Augmentation Problems
|
Nutov, Zeev
|
|
2011
|
|
1-2 |
p. 398-410
|
artikel
|
| 14 |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
|
Aazami, A.
|
|
2011
|
|
1-2 |
p. 425-456
|
artikel
|
| 15 |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
|
Epstein, Leah
|
|
2010
|
|
1-2 |
p. 102-129
|
artikel
|
| 16 |
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
|
Du, Donglei
|
|
2011
|
|
1-2 |
p. 191-200
|
artikel
|
| 17 |
A Scheme for Computing Minimum Covers within Simple Regions
|
Katz, Matthew J.
|
|
2010
|
|
1-2 |
p. 349-360
|
artikel
|
| 18 |
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
|
Chepoi, Victor
|
|
2010
|
|
1-2 |
p. 146-168
|
artikel
|
| 19 |
Average Case Analysis of Moore’s State Minimization Algorithm
|
Bassino, Frédérique
|
|
2011
|
|
1-2 |
p. 509-531
|
artikel
|
| 20 |
Better Alternatives to OSPF Routing
|
Fong, Jessica H.
|
|
2005
|
|
1-2 |
p. 113-131
|
artikel
|
| 21 |
Biased Range Trees
|
Dujmović, Vida
|
|
2010
|
|
1-2 |
p. 21-37
|
artikel
|
| 22 |
Bipartite Matching in the Semi-streaming Model
|
Eggert, Sebastian
|
|
2011
|
|
1-2 |
p. 490-508
|
artikel
|
| 23 |
Building Edge-Failure Resilient Networks
|
Chekuri, Chandra
|
|
2005
|
|
1-2 |
p. 17-41
|
artikel
|
| 24 |
Can Finite Samples Detect Singularities of Real-Valued Functions?
|
Ben-David, S.
|
|
Inc.
|
|
1-2 |
p. 3-17
|
artikel
|
| 25 |
Classification Accuracy Based on Observed Margin
|
Shawe-Taylor, J.
|
|
Inc.
|
|
1-2 |
p. 157-172
|
artikel
|
| 26 |
Competitive Weighted Matching in Transversal Matroids
|
Dimitrov, Nedialko B.
|
|
2010
|
|
1-2 |
p. 333-348
|
artikel
|
| 27 |
Complexity of Finding Graph Roots with Girth Conditions
|
Farzad, Babak
|
|
2010
|
|
1-2 |
p. 38-53
|
artikel
|
| 28 |
Construction Sequences and Certifying 3-connectivity
|
Schmidt, Jens M.
|
|
2010
|
|
1-2 |
p. 192-208
|
artikel
|
| 29 |
Contribution Games in Networks
|
Anshelevich, Elliot
|
|
2011
|
|
1-2 |
p. 51-90
|
artikel
|
| 30 |
Coordinated Manipulation of Objects in a Plane
|
Rus, D.
|
|
Inc.
|
|
1-2 |
p. 129-147
|
artikel
|
| 31 |
Determining the Castability of Simple Polyhedra
|
Bose, P.
|
|
Inc.
|
|
1-2 |
p. 84-113
|
artikel
|
| 32 |
Drawing (Complete) Binary Tanglegrams
|
Buchin, Kevin
|
|
2010
|
|
1-2 |
p. 309-332
|
artikel
|
| 33 |
Effective Routing and Scheduling in Adversarial Queueing Networks
|
Sethuraman, Jay
|
|
2005
|
|
1-2 |
p. 133-146
|
artikel
|
| 34 |
Efficient Perturbations for Handling Geometric Degeneracies
|
Emiris, I. Z.
|
|
Inc.
|
|
1-2 |
p. 219-242
|
artikel
|
| 35 |
Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems
|
Berger, André
|
|
2011
|
|
1-2 |
p. 633-634
|
artikel
|
| 36 |
External Memory Planar Point Location with Logarithmic Updates
|
Arge, Lars
|
|
2011
|
|
1-2 |
p. 457-475
|
artikel
|
| 37 |
Fast Algorithms for max independent set
|
Bourgeois, Nicolas
|
|
2010
|
|
1-2 |
p. 382-415
|
artikel
|
| 38 |
Fast Arc-Annotated Subsequence Matching in Linear Space
|
Bille, Philip
|
|
2010
|
|
1-2 |
p. 209-223
|
artikel
|
| 39 |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
|
Kavitha, Telikepalli
|
|
2011
|
|
1-2 |
p. 224-245
|
artikel
|
| 40 |
Faster Swap Edge Computation in Minimum Diameter Spanning Trees
|
Gfeller, Beat
|
|
2010
|
|
1-2 |
p. 169-191
|
artikel
|
| 41 |
Feasibility of Design in Stereolithography
|
Asberg, B.
|
|
Inc.
|
|
1-2 |
p. 61-83
|
artikel
|
| 42 |
Finding Induced Paths of Given Parity in Claw-Free Graphs
|
’t Hof, Pim van
|
|
2010
|
|
1-2 |
p. 537-563
|
artikel
|
| 43 |
Graph Decomposition for Memoryless Periodic Exploration
|
Kosowski, Adrian
|
|
2011
|
|
1-2 |
p. 26-38
|
artikel
|
| 44 |
Guest Editor’s Introduction
|
Zhang, Lisa
|
|
2005
|
|
1-2 |
p. 1-3
|
artikel
|
| 45 |
Improved Approximation Algorithms for Data Migration
|
Khuller, Samir
|
|
2011
|
|
1-2 |
p. 347-362
|
artikel
|
| 46 |
Improved Competitive Guarantees for QoS Buffering
|
Kesselman, Alex
|
|
2005
|
|
1-2 |
p. 63-80
|
artikel
|
| 47 |
Improved Competitive Performance Bounds for CIOQ Switches
|
Kesselman, Alex
|
|
2011
|
|
1-2 |
p. 411-424
|
artikel
|
| 48 |
Interval Partitions and Polynomial Factorization
|
Gathen, Joachim von zur
|
|
2011
|
|
1-2 |
p. 363-397
|
artikel
|
| 49 |
Introduction
|
Auer, P.
|
|
Inc.
|
|
1-2 |
p. 1-2
|
artikel
|
| 50 |
Layered Working-Set Trees
|
Bose, Prosenjit
|
|
2011
|
|
1-2 |
p. 476-489
|
artikel
|
| 51 |
Learning Boxes in High Dimension
|
Beimel, A.
|
|
Inc.
|
|
1-2 |
p. 76-90
|
artikel
|
| 52 |
Learning Matrix Functions over Rings
|
Bshouty, N. H.
|
|
Inc.
|
|
1-2 |
p. 91-111
|
artikel
|
| 53 |
Management of Multi-Queue Switches in QoS Networks
|
Azar, Yossi
|
|
2005
|
|
1-2 |
p. 81-96
|
artikel
|
| 54 |
Many Distances in Planar Graphs
|
Cabello, Sergio
|
|
2010
|
|
1-2 |
p. 361-381
|
artikel
|
| 55 |
Mapping Filtering Streaming Applications
|
Agrawal, Kunal
|
|
2010
|
|
1-2 |
p. 258-308
|
artikel
|
| 56 |
Maximum Series-Parallel Subgraph
|
Călinescu, Gruia
|
|
2011
|
|
1-2 |
p. 137-157
|
artikel
|
| 57 |
Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms
|
Baraff, D.
|
|
Inc.
|
|
1-2 |
p. 4-39
|
artikel
|
| 58 |
Minimize the Maximum Duty in Multi-interface Networks
|
D’Angelo, Gianlorenzo
|
|
2011
|
|
1-2 |
p. 274-295
|
artikel
|
| 59 |
Minimizing α -Information for Generalization and Interpretation
|
Kamimura, R.
|
|
Inc.
|
|
1-2 |
p. 173-197
|
artikel
|
| 60 |
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
|
Catusse, N.
|
|
2011
|
|
1-2 |
p. 551-567
|
artikel
|
| 61 |
Multiple Translational Containment Part I: An Approximate Algorithm
|
Daniels, K.
|
|
Inc.
|
|
1-2 |
p. 148-182
|
artikel
|
| 62 |
Multiple Translational Containment Part II: Exact Algorithms
|
Milenkovic, V.
|
|
Inc.
|
|
1-2 |
p. 183-218
|
artikel
|
| 63 |
Near-Linear Approximation Algorithms for Geometric Hitting Sets
|
Agarwal, Pankaj K.
|
|
2011
|
|
1-2 |
p. 1-25
|
artikel
|
| 64 |
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
|
Alistarh, Dan
|
|
2011
|
|
1-2 |
p. 595-629
|
artikel
|
| 65 |
On a Kernel-Based Method for Pattern Recognition, Regression, Approximation, and Operator Inversion
|
Smola, A. J.
|
|
Inc.
|
|
1-2 |
p. 211-231
|
artikel
|
| 66 |
On Bayes Methods for On-Line Boolean Prediction
|
Cesa-Bianchi, N.
|
|
Inc.
|
|
1-2 |
p. 112-137
|
artikel
|
| 67 |
On Equilibria for ADM Minimization Games
|
Epstein, Leah
|
|
2011
|
|
1-2 |
p. 246-273
|
artikel
|
| 68 |
On the Hitting Times of Quantum Versus Random Walks
|
Magniez, Frédéric
|
|
2011
|
|
1-2 |
p. 91-116
|
artikel
|
| 69 |
PAC Learning Intersections of Halfspaces with Membership Queries
|
Kwek, S.
|
|
Inc.
|
|
1-2 |
p. 53-75
|
artikel
|
| 70 |
Philippe Flajolet, the Father of Analytic Combinatorics
|
|
|
2011
|
|
1-2 |
p. 635-636
|
artikel
|
| 71 |
Philippe Flajolet, the Father of Analytic Combinatorics
|
|
|
|
|
1-2 |
p. 635-636
|
artikel
|
| 72 |
Planning for Modular and Hybrid Fixtures
|
Wallack, A. S.
|
|
Inc.
|
|
1-2 |
p. 40-60
|
artikel
|
| 73 |
Polynomial Kernelizations for MIN F+Π1 and MAX NP
|
Kratsch, Stefan
|
|
2011
|
|
1-2 |
p. 532-550
|
artikel
|
| 74 |
Pruning 2-Connected Graphs
|
Chekuri, Chandra
|
|
2010
|
|
1-2 |
p. 436-463
|
artikel
|
| 75 |
Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data
|
Bajaj, C. L.
|
|
Inc.
|
|
1-2 |
p. 243-261
|
artikel
|
| 76 |
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming
|
Summers, Scott M.
|
|
2011
|
|
1-2 |
p. 117-136
|
artikel
|
| 77 |
Shortest Paths in Time-Dependent FIFO Networks
|
Dehne, Frank
|
|
2010
|
|
1-2 |
p. 416-435
|
artikel
|
| 78 |
Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk
|
Goel, Ashish
|
|
2005
|
|
1-2 |
p. 5-15
|
artikel
|
| 79 |
Strategy Under the Unknown Stochastic Environment: the Nonparametric Lob—Pass Problem
|
Hiraoka, K.
|
|
Inc.
|
|
1-2 |
p. 138-156
|
artikel
|
| 80 |
Stronger Lempel-Ziv Based Compressed Text Indexing
|
Arroyuelo, Diego
|
|
2010
|
|
1-2 |
p. 54-101
|
artikel
|
| 81 |
Succinct and I/O Efficient Data Structures for Traversal in Trees
|
Dillabaugh, Craig
|
|
2011
|
|
1-2 |
p. 201-223
|
artikel
|
| 82 |
Succinct Representation of Labeled Graphs
|
Barbay, Jérémy
|
|
2010
|
|
1-2 |
p. 224-257
|
artikel
|
| 83 |
The k-in-a-Path Problem for Claw-free Graphs
|
Fiala, Jiří
|
|
2010
|
|
1-2 |
p. 499-519
|
artikel
|
| 84 |
The Parameterized Complexity of Stabbing Rectangles
|
Dom, Michael
|
|
2010
|
|
1-2 |
p. 564-594
|
artikel
|
| 85 |
The Steiner Ratio Gilbert–Pollak Conjecture Is Still Open
|
Ivanov, A. O.
|
|
2011
|
|
1-2 |
p. 630-632
|
artikel
|
| 86 |
Visualization of Three-Dimensional Delaunay Meshes
|
Karasick, M. S.
|
|
Inc.
|
|
1-2 |
p. 114-128
|
artikel
|
| 87 |
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing
|
Erlebach, Thomas
|
|
2005
|
|
1-2 |
p. 43-61
|
artikel
|
| 88 |
Weighted Matching in the Semi-Streaming Model
|
Zelke, Mariano
|
|
2010
|
|
1-2 |
p. 1-20
|
artikel
|
Tijdschrift beschrijving