nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers
|
Fülöp, Z. |
|
Inc. |
|
6 |
p. 649-676 |
artikel |
2 |
A Dichotomy in the Complexity of Propositional Circumscription
|
Kirousis, Lefteris M. |
|
2004 |
|
6 |
p. 695-715 |
artikel |
3 |
A Group Algebraic Approach to NPN Classification of Boolean Functions
|
Zhang, Juling |
|
2018 |
|
6 |
p. 1278-1297 |
artikel |
4 |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
|
Bollig, Beate |
|
|
|
6 |
p. 671-685 |
artikel |
5 |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
|
Bollig, Beate |
|
2004 |
|
6 |
p. 671-685 |
artikel |
6 |
Approximate Equilibria and Ball Fusion
|
Koutsoupias, Elias |
|
2003 |
|
6 |
p. 683-693 |
artikel |
7 |
Approximation Results for Makespan Minimization with Budgeted Uncertainty
|
Bougeret, Marin |
|
|
|
6 |
p. 903-915 |
artikel |
8 |
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
|
Dehne, F. |
|
1997 |
|
6 |
p. 547-558 |
artikel |
9 |
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
|
Dehne, F. |
|
Inc. |
|
6 |
p. 547-558 |
artikel |
10 |
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
|
Gayral, Léo |
|
|
|
6 |
p. 1209-1240 |
artikel |
11 |
Asymmetric Communication Protocols via Hotlink Assignments
|
Bose, Prosenjit |
|
2003 |
|
6 |
p. 655-661 |
artikel |
12 |
Average-Case Analysis of Greedy Packet Scheduling
|
Zvi Lotker, |
|
Inc. |
|
6 |
p. 667-683 |
artikel |
13 |
Average-Case Analysis of Greedy Packet Scheduling
|
Lotker, Zvi |
|
2002 |
|
6 |
p. 667-683 |
artikel |
14 |
Avoiding Routing Loops on the Internet
|
Ito, Hiro |
|
2003 |
|
6 |
p. 597-609 |
artikel |
15 |
A Wait-Free Sorting Algorithm
|
Shavit, N. |
|
Inc. |
|
6 |
p. 519-544 |
artikel |
16 |
A Wait-Free Sorting Algorithm
|
Shavit, N. |
|
2001 |
|
6 |
p. 519-544 |
artikel |
17 |
Balanced Graph Partitioning
|
Andreev, Konstantin |
|
2006 |
|
6 |
p. 929-939 |
artikel |
18 |
Bounds on the Bend Number of Split and Cocomparability Graphs
|
Chakraborty, Dibyayan |
|
2019 |
|
6 |
p. 1336-1357 |
artikel |
19 |
Broadcasting Spanning Forests on a Multiple-Access Channel
|
Chlebus, Bogdan S. |
|
2003 |
|
6 |
p. 711-733 |
artikel |
20 |
Bulk Synchronous Parallel Algorithms for the External Memory Model
|
Dehne, |
|
Inc. |
|
6 |
p. 567-597 |
artikel |
21 |
Bulk Synchronous Parallel Algorithms for the External Memory Model
|
Dehne, |
|
2002 |
|
6 |
p. 567-597 |
artikel |
22 |
Closure Properties of Real Number Classes underCBV Functions
|
Zheng, Xizhong |
|
|
|
6 |
p. 701-729 |
artikel |
23 |
Closure Properties of Real Number Classes underCBV Functions
|
Zheng, Xizhong |
|
2004 |
|
6 |
p. 701-729 |
artikel |
24 |
Communication-Efficient Broadcasting in Complete Networkswith Dynamic Faults
|
Dobrev, Stefan |
|
2003 |
|
6 |
p. 695-709 |
artikel |
25 |
Comparing Linear Width Parameters for Directed Graphs
|
Gurski, Frank |
|
2019 |
|
6 |
p. 1358-1387 |
artikel |
26 |
Competitive Call Control in Mobile Networks
|
Pantziou, |
|
Inc. |
|
6 |
p. 625-639 |
artikel |
27 |
Competitive Call Control in Mobile Networks
|
Pantziou, |
|
2002 |
|
6 |
p. 625-639 |
artikel |
28 |
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
|
Jain, Pallavi |
|
|
|
6 |
p. 1067-1093 |
artikel |
29 |
Countable Sofic Shifts with a Periodic Direction
|
Törmä, Ilkka |
|
|
|
6 |
p. 1042-1066 |
artikel |
30 |
Covering Triangles in Edge-Weighted Graphs
|
Chen, Xujin |
|
2018 |
|
6 |
p. 1525-1552 |
artikel |
31 |
Deducible and Equivalent Structural Knowledges in Distributed Algorithms
|
Godard, Emmanuel |
|
2003 |
|
6 |
p. 631-654 |
artikel |
32 |
Directed Graphs and Substitutions
|
Holton, C. |
|
Inc. |
|
6 |
p. 545-564 |
artikel |
33 |
Directed Graphs and Substitutions
|
Holton, C. |
|
2001 |
|
6 |
p. 545-564 |
artikel |
34 |
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment
|
Schlude, Konrad |
|
2003 |
|
6 |
p. 611-629 |
artikel |
35 |
Dynamic Analysis of the Arrow Distributed Protocol
|
Herlihy, Maurice |
|
2006 |
|
6 |
p. 875-901 |
artikel |
36 |
Edge-Packing in Planar Graphs
|
Heath, L. S. |
|
Inc. |
|
6 |
p. 629-662 |
artikel |
37 |
Editorial: Special Issue on “Combinatorial Algorithms” (IWOCA 2016)
|
Mäkinen, Veli |
|
2018 |
|
6 |
p. 1349-1350 |
artikel |
38 |
Editor’s Foreword
|
Rosenberg, Arnold L. |
|
1997 |
|
6 |
p. 521 |
artikel |
39 |
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
|
Carson, Jacob |
|
|
|
6 |
p. 1110-1139 |
artikel |
40 |
Elimination Trees and the Construction of Pools and Stacks
|
Shavit, N. |
|
1997 |
|
6 |
p. 645-670 |
artikel |
41 |
Elimination Trees and the Construction of Pools and Stacks
|
Shavit, N. |
|
Inc. |
|
6 |
p. 645-670 |
artikel |
42 |
Expansivity, Permutivity, and Chaos for Cellular Automata
|
Fagnani, F. |
|
Inc. |
|
6 |
p. 663-677 |
artikel |
43 |
Finding Cactus Roots in Polynomial Time
|
Golovach, Petr A. |
|
2017 |
|
6 |
p. 1409-1426 |
artikel |
44 |
Finite Presentations of Infinite Structures:Automata and Interpretations
|
Blumensath, Achim |
|
2004 |
|
6 |
p. 641-674 |
artikel |
45 |
Fixed-Point Logics and Solitaire Games
|
Berwanger, Dietmar |
|
2004 |
|
6 |
p. 675-694 |
artikel |
46 |
Foreword
|
|
|
2004 |
|
6 |
p. 639-640 |
artikel |
47 |
Foreword
|
|
|
2006 |
|
6 |
p. 785 |
artikel |
48 |
Generalized Graph k-Coloring Games
|
Carosi, Raffaello |
|
|
|
6 |
p. 1028-1041 |
artikel |
49 |
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
|
Liu, Fu-Hong |
|
|
|
6 |
p. 1009-1032 |
artikel |
50 |
Hierarchical Ring Network design
|
Bermond, J-C. |
|
2003 |
|
6 |
p. 663-682 |
artikel |
51 |
Implicit Representation of Relations
|
Glončák, Vladan |
|
|
|
6 |
p. 1156-1196 |
artikel |
52 |
Improved Approximations for Weighted and Unweighted Graph Problems
|
Demange, Marc |
|
|
|
6 |
p. 763-787 |
artikel |
53 |
Improved Approximations for Weighted and Unweighted Graph Problems
|
Demange, Marc |
|
2004 |
|
6 |
p. 763-787 |
artikel |
54 |
Lower Bounds for Randomized Exclusive Write PRAMs
|
MacKenzie, P. D. |
|
1997 |
|
6 |
p. 599-626 |
artikel |
55 |
Lower Bounds for Randomized Exclusive Write PRAMs
|
MacKenzie, P. D. |
|
Inc. |
|
6 |
p. 599-626 |
artikel |
56 |
Managing Multiple Mobile Resources
|
Feldkord, Björn |
|
|
|
6 |
p. 943-984 |
artikel |
57 |
Minimal Distance of Propositional Models
|
Behrisch, Mike |
|
2018 |
|
6 |
p. 1131-1184 |
artikel |
58 |
Minimax Regret 1-Median Problem in Dynamic Path Networks
|
Higashikawa, Yuya |
|
2017 |
|
6 |
p. 1392-1408 |
artikel |
59 |
Monotone Paths in Geometric Triangulations
|
Dumitrescu, Adrian |
|
2018 |
|
6 |
p. 1490-1524 |
artikel |
60 |
On Black-Box Transformations in Downward-Closed Environments
|
Suksompong, Warut |
|
2018 |
|
6 |
p. 1207-1227 |
artikel |
61 |
On Delivery Times in Packet Networks under Adversarial Traffic
|
Rosen, Adi |
|
2006 |
|
6 |
p. 805-827 |
artikel |
62 |
Online Chromatic Number is PSPACE-Complete
|
Böhm, Martin |
|
2017 |
|
6 |
p. 1366-1391 |
artikel |
63 |
Online Hierarchical Cooperative Caching
|
Li, Xiaozhou |
|
2006 |
|
6 |
p. 851-874 |
artikel |
64 |
On Probabilistic Networks for Selection, Merging, and Sorting
|
Leighton, T. |
|
1997 |
|
6 |
p. 559-582 |
artikel |
65 |
On Probabilistic Networks for Selection, Merging, and Sorting
|
Leighton, T. |
|
Inc. |
|
6 |
p. 559-582 |
artikel |
66 |
On Stackelberg Strategies in Affine Congestion Games
|
Bilò, Vittorio |
|
2018 |
|
6 |
p. 1228-1249 |
artikel |
67 |
On the Bisection Width and Expansion of Butterfly Networks
|
Bornstein, C. F. |
|
Inc. |
|
6 |
p. 491-518 |
artikel |
68 |
On the Bisection Width and Expansion of Butterfly Networks
|
Bornstein, C. F. |
|
2001 |
|
6 |
p. 491-518 |
artikel |
69 |
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
|
Borchert, B. |
|
Inc. |
|
6 |
p. 679-693 |
artikel |
70 |
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
|
Gálvez, Waldo |
|
|
|
6 |
p. 985-1008 |
artikel |
71 |
On the Decision Tree Complexity of Threshold Functions
|
Chistopolskaya, Anastasiya |
|
|
|
6 |
p. 1074-1098 |
artikel |
72 |
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
|
Corò, Federico |
|
|
|
6 |
p. 1094-1109 |
artikel |
73 |
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers
|
Du, Yusong |
|
|
|
6 |
p. 1099-1122 |
artikel |
74 |
On the Relative Succinctness of Sentential Decision Diagrams
|
Bollig, Beate |
|
2018 |
|
6 |
p. 1250-1277 |
artikel |
75 |
Optimal High-Performance Parallel Text Retrieval via Fat-Trees
|
Mamalis, B. |
|
Inc. |
|
6 |
p. 591-623 |
artikel |
76 |
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
|
Meyer auf der Heide, F. |
|
1997 |
|
6 |
p. 627-644 |
artikel |
77 |
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
|
Meyer auf der Heide, F. |
|
Inc. |
|
6 |
p. 627-644 |
artikel |
78 |
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism
|
Chan, T.-H. Hubert |
|
|
|
6 |
p. 999-1027 |
artikel |
79 |
Parallel Algorithms for the Circuit Value Update Problem
|
Leiserson, C. E. |
|
1997 |
|
6 |
p. 583-597 |
artikel |
80 |
Parallel Algorithms for the Circuit Value Update Problem
|
Leiserson, C. E. |
|
Inc. |
|
6 |
p. 583-597 |
artikel |
81 |
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines
|
Chung, Fan |
|
2006 |
|
6 |
p. 829-849 |
artikel |
82 |
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems
|
Angelopoulos, Spyros |
|
2019 |
|
6 |
p. 1413-1447 |
artikel |
83 |
Partial Covering Arrays: Algorithms and Asymptotics
|
Sarkar, Kaushik |
|
2017 |
|
6 |
p. 1470-1489 |
artikel |
84 |
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
|
Cohen, |
|
Inc. |
|
6 |
p. 641-665 |
artikel |
85 |
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
|
Cohen, |
|
2002 |
|
6 |
p. 641-665 |
artikel |
86 |
Preface
|
Bampis, Evripidis |
|
|
|
6 |
p. 901-902 |
artikel |
87 |
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
|
Bilardi, G. |
|
1997 |
|
6 |
p. 523-546 |
artikel |
88 |
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
|
Bilardi, G. |
|
Inc. |
|
6 |
p. 523-546 |
artikel |
89 |
Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems
|
Bruda, S. D. |
|
Inc. |
|
6 |
p. 565-576 |
artikel |
90 |
Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems
|
Bruda, S. D. |
|
2001 |
|
6 |
p. 565-576 |
artikel |
91 |
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams
|
Brown, David E. |
|
|
|
6 |
p. 1307-1332 |
artikel |
92 |
Resource Bounds and Subproblem Independence
|
Stearns, Richard E. |
|
|
|
6 |
p. 731-761 |
artikel |
93 |
Resource Bounds and Subproblem Independence
|
Stearns, Richard E. |
|
2004 |
|
6 |
p. 731-761 |
artikel |
94 |
Robust Reductions
|
Cai, J.-Y. |
|
Inc. |
|
6 |
p. 625-647 |
artikel |
95 |
Santha-Vazirani sources, deterministic condensers and very strong extractors
|
Gavinsky, Dmitry |
|
|
|
6 |
p. 1140-1154 |
artikel |
96 |
Scheduling Time-Constrained Communication in Linear Networks
|
Adler, |
|
Inc. |
|
6 |
p. 599-623 |
artikel |
97 |
Scheduling Time-Constrained Communication in Linear Networks
|
Adler, |
|
2002 |
|
6 |
p. 599-623 |
artikel |
98 |
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
|
Karger, David R. |
|
2006 |
|
6 |
p. 787-804 |
artikel |
99 |
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
|
Bishnu, Arijit |
|
|
|
6 |
p. 1241-1267 |
artikel |
100 |
Speeding up dynamic programming in the line-constrained k-median
|
Gawrychowski, Paweł |
|
2017 |
|
6 |
p. 1351-1365 |
artikel |
101 |
Stability and Welfare in (Dichotomous) Hedonic Diversity Games
|
Darmann, Andreas |
|
|
|
6 |
p. 1133-1155 |
artikel |
102 |
Strategic Network Formation Through an Intermediary
|
Anshelevich, Elliot |
|
2019 |
|
6 |
p. 1314-1335 |
artikel |
103 |
Streaming Algorithms for Bin Packing and Vector Scheduling
|
Cormode, Graham |
|
|
|
6 |
p. 916-942 |
artikel |
104 |
Structure-Preserving Hierarchical Decompositions
|
Finocchi, Irene |
|
|
|
6 |
p. 687-700 |
artikel |
105 |
Structure-Preserving Hierarchical Decompositions
|
Finocchi, Irene |
|
2004 |
|
6 |
p. 687-700 |
artikel |
106 |
Submodular Functions and Rooted Trees
|
Wu, Yaokun |
|
|
|
6 |
p. 1047-1073 |
artikel |
107 |
The Complexity of Linear and Stratified Context Matching Problems
|
Schmidt-Schauß, Manfred |
|
2004 |
|
6 |
p. 717-740 |
artikel |
108 |
The Effect of Faults on Network Expansion
|
Bagchi, Amitabha |
|
2006 |
|
6 |
p. 903-928 |
artikel |
109 |
The Number of Clones Determined by Disjunctions of Unary Relations
|
Behrisch, Mike |
|
2018 |
|
6 |
p. 1298-1313 |
artikel |
110 |
The Solution Space of Sorting with Recurring Comparison Faults
|
Damaschke, Peter |
|
2017 |
|
6 |
p. 1427-1442 |
artikel |
111 |
Toward Online Mobile Facility Location on General Metrics
|
Ghodselahi, Abdolhamid |
|
|
|
6 |
p. 1268-1306 |
artikel |
112 |
Unit Cost Buyback Problem
|
Kawase, Yasushi |
|
2018 |
|
6 |
p. 1185-1206 |
artikel |
113 |
Weak Completeness Notions for Exponential Time
|
Ambos-Spies, Klaus |
|
2019 |
|
6 |
p. 1388-1412 |
artikel |
114 |
Weighted Online Problems with Advice
|
Boyar, Joan |
|
2017 |
|
6 |
p. 1443-1469 |
artikel |
115 |
Well-Covered Graphs With Constraints On Δ And δ
|
Levit, Vadim E. |
|
|
|
6 |
p. 1197-1208 |
artikel |