| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Closer Look at Fault Tolerance
|
Taubenfeld, Gadi
|
|
2017
|
|
5 |
p. 1085-1108
|
artikel
|
| 2 |
A Cost-Effective Architecture for Vectorizable Numerical and MultimediaApplications
|
Quintana, Francisca
|
|
2003
|
|
5 |
p. 575-593
|
artikel
|
| 3 |
A Cost-Effective Architecture for Vectorizable Numerical and MultimediaApplications
|
Quintana, Francisca
|
|
|
|
5 |
p. 575-593
|
artikel
|
| 4 |
A Framework for Memory Efficient Context-Sensitive Program Analysis
|
Hedenborg, Mathias
|
|
|
|
5 |
p. 911-956
|
artikel
|
| 5 |
A More General Theory of Static Approximations for Conjunctive Queries
|
Barceló, Pablo
|
|
|
|
5 |
p. 916-964
|
artikel
|
| 6 |
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
|
Gault, Richard L.
|
|
2005
|
|
5 |
p. 753-783
|
artikel
|
| 7 |
An Isoperimetric Problem in Cayley Graphs
|
Hamidoune, Y. O.
|
|
Inc.
|
|
5 |
p. 507-516
|
artikel
|
| 8 |
A Note on MODp - MODm Circuits
|
Straubing, Howard
|
|
2005
|
|
5 |
p. 699-706
|
artikel
|
| 9 |
Approximability of open k-monopoly problems
|
Mishra, Sounaka
|
|
|
|
5 |
p. 798-814
|
artikel
|
| 10 |
Approximation Algorithms for Data Management in Networks
|
Krick, Christof
|
|
2003
|
|
5 |
p. 497-519
|
artikel
|
| 11 |
Approximation Algorithms for Data Management in Networks
|
Krick, Christof
|
|
|
|
5 |
p. 497-519
|
artikel
|
| 12 |
A reducibility concept for problems defined in terms of ordered binary decision diagrams
|
Meinel, Ch.
|
|
1997
|
|
5 |
p. 495-518
|
artikel
|
| 13 |
A Special Case of a Unary Regular Language Containment
|
Litow, B.
|
|
2005
|
|
5 |
p. 743-751
|
artikel
|
| 14 |
Attack Propagation in Networks
|
Nikoletseas, Sotiris
|
|
2003
|
|
5 |
p. 553-574
|
artikel
|
| 15 |
Attack Propagation in Networks
|
Nikoletseas, Sotiris
|
|
|
|
5 |
p. 553-574
|
artikel
|
| 16 |
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games
|
Bilò, Vittorio
|
|
2017
|
|
5 |
p. 1288-1317
|
artikel
|
| 17 |
Automatable Verification of Sequential Consistency
|
Condon, Anne E.
|
|
2003
|
|
5 |
p. 431-460
|
artikel
|
| 18 |
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs
|
Scharpfenecker, Patrick
|
|
2017
|
|
5 |
p. 1125-1143
|
artikel
|
| 19 |
Characterizing the Micronuclear Gene Patterns in Ciliates
|
Ehrenfeucht,
|
|
Inc.
|
|
5 |
p. 501-519
|
artikel
|
| 20 |
Characterizing the Micronuclear Gene Patterns in Ciliates
|
Ehrenfeucht, Andrzej
|
|
2002
|
|
5 |
p. 501-519
|
artikel
|
| 21 |
Chomskian Hierarchies of Families of Sets of Piecewise Continuous Functions
|
Ruohonen, Keijo
|
|
2004
|
|
5 |
p. 609-638
|
artikel
|
| 22 |
Co-c.e. Sets with Disconnected Complements
|
Iljazović, Zvonko
|
|
2017
|
|
5 |
p. 1109-1124
|
artikel
|
| 23 |
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
|
Das, Shantanu
|
|
2017
|
|
5 |
p. 1223-1240
|
artikel
|
| 24 |
Compact Routing Schemes for Dynamic Ring Networks
|
Krizanc, Danny
|
|
2004
|
|
5 |
p. 585-607
|
artikel
|
| 25 |
Competitive Analysis of On-Line Disk Scheduling
|
Tzuoo-Hawn Yeh,
|
|
Inc.
|
|
5 |
p. 491-506
|
artikel
|
| 26 |
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
|
Fijalkow, Nathanaël
|
|
2019
|
|
5 |
p. 1027-1048
|
artikel
|
| 27 |
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
|
Riege, Tobias
|
|
2004
|
|
5 |
p. 635-668
|
artikel
|
| 28 |
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
|
Kulikov, Alexander S.
|
|
2018
|
|
5 |
p. 956-986
|
artikel
|
| 29 |
Computing the Maximum Overlap of Two Convex Polygons under Translations
|
de Berg, M.
|
|
Inc.
|
|
5 |
p. 613-628
|
artikel
|
| 30 |
Computing the Number of Affine Equivalent Classes on R(s,n)/R(k,n)
|
Zeng, Xiao
|
|
|
|
5 |
p. 869-883
|
artikel
|
| 31 |
Connecting Knowledge Compilation Classes Width Parameters
|
Amarilli, Antoine
|
|
|
|
5 |
p. 861-914
|
artikel
|
| 32 |
Constructing Antidictionaries of Long Texts in Output-Sensitive Space
|
Ayad, Lorraine A.K.
|
|
|
|
5 |
p. 777-797
|
artikel
|
| 33 |
Correction to: Connecting Knowledge Compilation Classes and Width Parameters
|
Amarilli, Antoine
|
|
|
|
5 |
p. 915
|
artikel
|
| 34 |
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
|
Kowalski, Dariusz R.
|
|
|
|
5 |
p. 1131
|
artikel
|
| 35 |
Correspondence Principles for EffectiveDimensions
|
Hitchcock, John M.
|
|
2004
|
|
5 |
p. 559-571
|
artikel
|
| 36 |
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
|
Curticapean, Radu
|
|
2018
|
|
5 |
p. 987-1026
|
artikel
|
| 37 |
Deciding a class of path formulas for conflict-free petri nets
|
Yen, Hsu-Chun
|
|
1997
|
|
5 |
p. 475-494
|
artikel
|
| 38 |
Decision Problems and Round-Off Machines
|
Cucker, F.
|
|
Inc.
|
|
5 |
p. 433-452
|
artikel
|
| 39 |
Decision Problems and Round-Off Machines
|
Cucker, F.
|
|
2001
|
|
5 |
p. 433-452
|
artikel
|
| 40 |
Deterministic and Randomized Algorithms for Distributed On-Line Task Assignment and Load Balancing without Load Status Information
|
Li, K.
|
|
Inc.
|
|
5 |
p. 453-469
|
artikel
|
| 41 |
Deterministic and Randomized Algorithms for Distributed On-Line Task Assignment and Load Balancing without Load Status Information
|
Li, K.
|
|
2001
|
|
5 |
p. 453-469
|
artikel
|
| 42 |
Deterministic Resource Discovery in Distributed Networks
|
Kutten, Shay
|
|
2003
|
|
5 |
p. 479-495
|
artikel
|
| 43 |
Deterministic Resource Discovery in Distributed Networks
|
Kutten, Shay
|
|
|
|
5 |
p. 479-495
|
artikel
|
| 44 |
Distribution Policies for Datalog
|
Ketsman, Bas
|
|
|
|
5 |
p. 965-998
|
artikel
|
| 45 |
Editorial
|
Rosenberg, Arnold L.
|
|
1997
|
|
5 |
p. 445
|
artikel
|
| 46 |
Editors' Foreword
|
Asano, T.
|
|
Inc.
|
|
5 |
p. 489
|
artikel
|
| 47 |
Efficient List Ranking on the Reconfigurable Mesh, with Applications
|
Hayashi, T.
|
|
Inc.
|
|
5 |
p. 593-611
|
artikel
|
| 48 |
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
|
Caragiannis,
|
|
Inc.
|
|
5 |
p. 521-543
|
artikel
|
| 49 |
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
|
Caragiannis, Ioannis
|
|
2002
|
|
5 |
p. 521-543
|
artikel
|
| 50 |
Energy-Efficient Wireless Network Design
|
Caragiannis, Ioannis
|
|
2005
|
|
5 |
p. 593-617
|
artikel
|
| 51 |
Enumeration Complexity of Conjunctive Queries with Functional Dependencies
|
Carmeli, Nofar
|
|
|
|
5 |
p. 828-860
|
artikel
|
| 52 |
Exact Localisations of Feedback Sets
|
Hecht, Michael
|
|
2017
|
|
5 |
p. 1048-1084
|
artikel
|
| 53 |
Expansivity and Periodicity in Algebraic Subshifts
|
Kari, Jarkko
|
|
|
|
5 |
p. 976-994
|
artikel
|
| 54 |
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
|
Ilcinkas, David
|
|
2017
|
|
5 |
p. 1144-1160
|
artikel
|
| 55 |
Extension Complexity of Formal Languages
|
Tiwary, Hans Raj
|
|
|
|
5 |
p. 735-753
|
artikel
|
| 56 |
Flexible Usage of Redundancy in Disk Arrays
|
Schwabe, E. J.
|
|
Inc.
|
|
5 |
p. 561-587
|
artikel
|
| 57 |
From Tree Automata to String Automata Minimization
|
Guellouma, Younes
|
|
2017
|
|
5 |
p. 1203-1222
|
artikel
|
| 58 |
Generating Instances for MAX2SAT with Optimal Solutions
|
Yamamoto, Masaki
|
|
2005
|
|
5 |
p. 723-742
|
artikel
|
| 59 |
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science
|
Vollmer, Heribert
|
|
2019
|
|
5 |
p. 923-925
|
artikel
|
| 60 |
Guest Editors’ Foreword
|
Ogihara, Mitsunori
|
|
2002
|
|
5 |
p. 469
|
artikel
|
| 61 |
Hierarchy Among Automata on Linear Orderings
|
Bruyére, Véronique
|
|
2005
|
|
5 |
p. 593-621
|
artikel
|
| 62 |
Homonym Population Protocols
|
Bournez, Olivier
|
|
2018
|
|
5 |
p. 1318-1346
|
artikel
|
| 63 |
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
|
Sankowski, Piotr
|
|
2018
|
|
5 |
p. 1049-1067
|
artikel
|
| 64 |
Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D
|
Furcy, David
|
|
|
|
5 |
p. 1082-1130
|
artikel
|
| 65 |
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions
|
Georgiou, Chryssis
|
|
|
|
5 |
p. 957-995
|
artikel
|
| 66 |
Laying Out the Interconnection Network of the Transpose Bijection
|
Even,
|
|
Inc.
|
|
5 |
p. 545-558
|
artikel
|
| 67 |
Laying Out the Interconnection Network of the Transpose Bijection
|
Even, Shimon
|
|
2002
|
|
5 |
p. 545-558
|
artikel
|
| 68 |
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions
|
Lingas, A.
|
|
Inc.
|
|
5 |
p. 507-538
|
artikel
|
| 69 |
Minimum Reload Cost Graph Factors
|
Baste, Julien
|
|
|
|
5 |
p. 815-838
|
artikel
|
| 70 |
Mixing of Permutations by Biased Transpositions
|
Haddadan, Shahrzad
|
|
2018
|
|
5 |
p. 1068-1088
|
artikel
|
| 71 |
Multi-Linearity Self-Testing with Relative Error
|
Magniez, Frédéric
|
|
2004
|
|
5 |
p. 573-591
|
artikel
|
| 72 |
New Graph Classes of Bounded Clique-Width
|
Brandstädt, Andreas
|
|
2004
|
|
5 |
p. 623-645
|
artikel
|
| 73 |
Non-Linear Ski Rental
|
Patt-Shamir, Boaz
|
|
|
|
5 |
p. 995-1025
|
artikel
|
| 74 |
OBDDs of a Monotone Function and Its Prime Implicants
|
Hayase, K.
|
|
Inc.
|
|
5 |
p. 579-591
|
artikel
|
| 75 |
On Effective Birkhoff’s Ergodic Theorem for Computable Actions of Amenable Groups
|
Moriakov, Nikita
|
|
2017
|
|
5 |
p. 1269-1287
|
artikel
|
| 76 |
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
|
Gardner, L.
|
|
Inc.
|
|
5 |
p. 399-431
|
artikel
|
| 77 |
One-to-Many Embeddings of Hypercubes into Cayley Graphs Generated by Reversals
|
Gardner, L.
|
|
2001
|
|
5 |
p. 399-431
|
artikel
|
| 78 |
On Limitations of Structured (Deterministic) DNNFs
|
Bollig, Beate
|
|
|
|
5 |
p. 799-825
|
artikel
|
| 79 |
On Long Words Avoiding Zimin Patterns
|
Carayol, Arnaud
|
|
2019
|
|
5 |
p. 926-955
|
artikel
|
| 80 |
On Normality in Shifts of Finite Type
|
Álvarez, Nicolás
|
|
|
|
5 |
p. 783-798
|
artikel
|
| 81 |
On Spectral Bounds for the k-Partitioning of Graphs
|
Elsässer, Robert
|
|
2003
|
|
5 |
p. 461-478
|
artikel
|
| 82 |
On Spectral Bounds for the k-Partitioning of Graphs
|
Elsässer, Robert
|
|
|
|
5 |
p. 461-478
|
artikel
|
| 83 |
On the Complexity of the Clone Membership Problem
|
Jeřábek, Emil
|
|
|
|
5 |
p. 839-868
|
artikel
|
| 84 |
On the Stab Number of Rectangle Intersection Graphs
|
Chakraborty, Dibyayan
|
|
|
|
5 |
p. 681-734
|
artikel
|
| 85 |
Periodic Gossiping in Commuted Networks
|
Barth, Dominique
|
|
2004
|
|
5 |
p. 559-584
|
artikel
|
| 86 |
Periodic Merging Networks
|
Kutylowski, M.
|
|
Inc.
|
|
5 |
p. 551-578
|
artikel
|
| 87 |
Processor—Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds
|
Bilardi, G.
|
|
Inc.
|
|
5 |
p. 531-559
|
artikel
|
| 88 |
Programmed Mutagenesis Is Universal
|
Khodor,
|
|
Inc.
|
|
5 |
p. 483-500
|
artikel
|
| 89 |
Programmed Mutagenesis Is Universal
|
Khodor, Julia
|
|
2002
|
|
5 |
p. 483-500
|
artikel
|
| 90 |
P Systems with Global Rules
|
Păun,
|
|
Inc.
|
|
5 |
p. 471-481
|
artikel
|
| 91 |
P Systems with Global Rules
|
Păun, Andrei
|
|
2002
|
|
5 |
p. 471-481
|
artikel
|
| 92 |
Publisher Correction: Editor’s Note
|
|
|
2017
|
|
5 |
p. 1347
|
artikel
|
| 93 |
Randomness, Stochasticity, and Approximations
|
Wang, Y.
|
|
Inc.
|
|
5 |
p. 517-529
|
artikel
|
| 94 |
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
|
Morawietz, Nils
|
|
|
|
5 |
p. 1019-1045
|
artikel
|
| 95 |
RUSPACE(log n) $\subseteq$ DSPACE(log2n/log log n)
|
Allender, E.
|
|
Inc.
|
|
5 |
p. 539-550
|
artikel
|
| 96 |
Scalable Room Synchronizations
|
Blelloch, Guy E.
|
|
2003
|
|
5 |
p. 397-430
|
artikel
|
| 97 |
Scalable Room Synchronizations
|
Blelloch, Guy E.
|
|
|
|
5 |
p. 397-430
|
artikel
|
| 98 |
Scheduling MapReduce Jobs on Identical and Unrelated Processors
|
Fotakis, Dimitris
|
|
|
|
5 |
p. 754-782
|
artikel
|
| 99 |
Selection Functions that Do Not Preserve Normality
|
Merkle, Wolfgang
|
|
2005
|
|
5 |
p. 685-697
|
artikel
|
| 100 |
Self-Stabilizing Leader Election in Dynamic Networks
|
Datta, Ajoy K.
|
|
2017
|
|
5 |
p. 977-1047
|
artikel
|
| 101 |
Some Results on Effective Randomness
|
Merkle, Wolfgang
|
|
2005
|
|
5 |
p. 707-721
|
artikel
|
| 102 |
Special Issue on the 2018 International Conference on Database Theory
|
Kimelfeld, Benny
|
|
|
|
5 |
p. 826-827
|
artikel
|
| 103 |
Syntactic Complexity of Regular Ideals
|
Brzozowski, Janusz A.
|
|
2017
|
|
5 |
p. 1175-1202
|
artikel
|
| 104 |
Target Set Selection Parameterized by Vertex Cover and More
|
Banerjee, Suman
|
|
|
|
5 |
p. 996-1018
|
artikel
|
| 105 |
The Algebraic Theory of Parikh Automata
|
Cadilhac, Michaël
|
|
2017
|
|
5 |
p. 1241-1268
|
artikel
|
| 106 |
The Complexity of Finding Top-Toda-Equivalence-Class Members
|
Hemaspaandra, Lane A.
|
|
2005
|
|
5 |
p. 669-684
|
artikel
|
| 107 |
The Complexity of Tensor Rank
|
Schaefer, Marcus
|
|
2017
|
|
5 |
p. 1161-1174
|
artikel
|
| 108 |
The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots
|
Prencipe, Giuseppe
|
|
2005
|
|
5 |
p. 539-558
|
artikel
|
| 109 |
The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem
|
Liu,
|
|
Inc.
|
|
5 |
p. 559-564
|
artikel
|
| 110 |
The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem
|
Liu, Yingjie
|
|
2002
|
|
5 |
p. 559-564
|
artikel
|
| 111 |
The Operator Approach to Entropy Games
|
Akian, Marianne
|
|
2019
|
|
5 |
p. 1089-1130
|
artikel
|
| 112 |
The Parameterized Complexity of s-Club with Triangle and Seed Constraints
|
Garvardt, Jaroslav
|
|
|
|
5 |
p. 1050-1081
|
artikel
|
| 113 |
The Satisfiability Problem for Probabilistic Ordered Branching Programs
|
Agrawal, M.
|
|
Inc.
|
|
5 |
p. 471-487
|
artikel
|
| 114 |
The Satisfiability Problem for Probabilistic Ordered Branching Programs
|
Agrawal, M.
|
|
2001
|
|
5 |
p. 471-487
|
artikel
|
| 115 |
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus
|
Conde, Rodolfo
|
|
|
|
5 |
p. 901-955
|
artikel
|
| 116 |
The Space Complexity of Sum Labelling
|
Fernau, Henning
|
|
|
|
5 |
p. 1026-1049
|
artikel
|
| 117 |
The subset sum game revisited
|
Pieterse, Astrid
|
|
|
|
5 |
p. 884-900
|
artikel
|
| 118 |
The use of a synchronizer yields the maximum computation rate in distributed networks
|
Even, S.
|
|
1997
|
|
5 |
p. 447-474
|
artikel
|
| 119 |
Towards a First Vertical Prototyping of anExtremely Fine-Grained Parallel ProgrammingApproach
|
Naishlos, Dorit
|
|
2003
|
|
5 |
p. 521-552
|
artikel
|
| 120 |
Towards a First Vertical Prototyping of anExtremely Fine-Grained Parallel ProgrammingApproach
|
Naishlos, Dorit
|
|
|
|
5 |
p. 521-552
|
artikel
|
| 121 |
Tractable Fragments of Presburger Arithmetic
|
Subramani, K.
|
|
2004
|
|
5 |
p. 647-668
|
artikel
|
| 122 |
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates
|
Daley, Mark
|
|
2005
|
|
5 |
p. 619-633
|
artikel
|
| 123 |
Visit-Bounded Stack Automata
|
Jirásek, Jozef
|
|
|
|
5 |
p. 956-975
|
artikel
|
Tijdschrift beschrijving