Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             109 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Abstracting numeric constraints with Boolean functions Howe, Jacob M.
 2000
 1-2 p. 17-23
7 p.
 artikel
2 A correspondence between type checking via reduction and type checking via evaluation Sergey, Ilya
 2012
 1-2 p. 13-20
8 p.
 artikel
3 A force-directed algorithm that preserves edge-crossing properties Bertault, François
 2000
 1-2 p. 7-13
7 p.
 artikel
4 A lower bound of 8/(7+ 1 k−1 ) on the integrality ratio of the Călinescu–Karloff–Rabani relaxation for multiway cut Freund, Ari
 2000
 1-2 p. 43-50
8 p.
 artikel
5 An algebraic characterization of independence of Petri net processes Winkowski, Józef
 2003
 1-2 p. 73-81
9 p.
 artikel
6 An algorithm for finding a k-median in a directed tree Vigneron, Antoine
 2000
 1-2 p. 81-88
8 p.
 artikel
7 An ergodic theorem for read-once non-uniform deterministic finite automata Goldmann, Mikael
 2000
 1-2 p. 23-28
6 p.
 artikel
8 A network-flow-based lower bound for the minimum weighted integer coloring problem Xue, Jue
 2000
 1-2 p. 45-50
6 p.
 artikel
9 A new one pass algorithm for estimating stochastic context-free grammars Ra, Dong-Yul
 1999
 1-2 p. 37-45
9 p.
 artikel
10 An FPT algorithm for edge subset feedback edge set Xiao, Mingyu
 2012
 1-2 p. 5-9
5 p.
 artikel
11 A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time” Yu, Sheng
 2012
 1-2 p. 55-58
4 p.
 artikel
12 A note on BDD problems with λ 2 -gap Liu, Mingjie
 2014
 1-2 p. 9-12
4 p.
 artikel
13 A note on labeling schemes for graph connectivity Izsak, Rani
 2012
 1-2 p. 39-43
5 p.
 artikel
14 A note on self-modifying finite automata Wang, Y.
 1999
 1-2 p. 19-24
6 p.
 artikel
15 A note on subject reduction in ( → , ∃ ) -Curry with respect to complete developments Schubert, Aleksy
 2014
 1-2 p. 72-75
4 p.
 artikel
16 A note on the Kenyon–Remila strip-packing algorithm Sviridenko, Maxim
 2012
 1-2 p. 10-12
3 p.
 artikel
17 A note on the non-NP-hardness of approximate lattice problems under general Cook reductions Cai, Jin-Yi
 2000
 1-2 p. 61-66
6 p.
 artikel
18 A Novel Hybrid Slot Allocation Mechanism for 802.11e EDCA Protocol Yao, Xin-Wei
 2014
 1-2 p. 25-30
6 p.
 artikel
19 Approximating low-congestion routing and column-restricted packing problems Baveja, Alok
 2000
 1-2 p. 19-25
7 p.
 artikel
20 Approximation algorithms for the ring loading problem with penalty cost Li, Weidong
 2014
 1-2 p. 56-59
4 p.
 artikel
21 A rely–guarantee discipline for open distributed systems design Duarte, Carlos H.C.
 2000
 1-2 p. 55-63
9 p.
 artikel
22 A simple analysis of the harmonic algorithm for two servers Chrobak, Marek
 2000
 1-2 p. 75-77
3 p.
 artikel
23 A simple 3-edge connected component algorithm revisited Norouzi, Nima
 2014
 1-2 p. 50-55
6 p.
 artikel
24 Assessment of data redundancy in fuzzy relational databases based on semantic inclusion degree Ma, Z.M.
 1999
 1-2 p. 25-29
5 p.
 artikel
25 A uniform framework for term and graph rewriting applied to combined systems Ohlebusch, Enno
 2000
 1-2 p. 53-59
7 p.
 artikel
26 Board of Editors 2003
 1-2 p. IFC-
1 p.
 artikel
27 Bypassing BDD construction for reliability analysis Williams, Poul Frederick
 2000
 1-2 p. 85-89
5 p.
 artikel
28 Center-based clustering under perturbation stability Awasthi, Pranjal
 2012
 1-2 p. 49-54
6 p.
 artikel
29 Christmas tree: A versatile 1-fault-tolerant design for token rings Hung, Chun-Nan
 1999
 1-2 p. 55-63
9 p.
 artikel
30 Clique-width and edge contraction Courcelle, Bruno
 2014
 1-2 p. 42-44
3 p.
 artikel
31 Coloring chip configurations on graphs and digraphs Borowiecki, Mieczysław
 2012
 1-2 p. 1-4
4 p.
 artikel
32 Constrained multi-object auctions and b -matching Penn, Michal
 2000
 1-2 p. 29-34
6 p.
 artikel
33 Corrigendum to: “A counterexample for the proof of implication conjecture on independent spanning trees” [Information Processing Letters 113 (14–16) (2013) 522–526] Gopalan, Abishek
 2014
 1-2 p. 84-
1 p.
 artikel
34 Corrigendum to “Upward separation for FewP and related classes”, Information Processing Letters 52 (1994) 175–180 Rao, Rajesh P.N.
 2000
 1-2 p. 89-
1 p.
 artikel
35 Cyclic-cubes and wrap-around butterflies Wagh, Meghanad D.
 2000
 1-2 p. 25-27
3 p.
 artikel
36 Detecting masquerades in intrusion detection based on unpopular commands Schonlau, Matthias
 2000
 1-2 p. 33-38
6 p.
 artikel
37 Deterministic small-world communication networks Comellas, Francesc
 2000
 1-2 p. 83-90
8 p.
 artikel
38 Distributed similarity search algorithm in distributed heterogeneous multimedia databases Lee, Ju-Hong
 2000
 1-2 p. 35-42
8 p.
 artikel
39 Edge-chromatic sum of trees and bounded cyclicity graphs Giaro, Krzysztof
 2000
 1-2 p. 65-69
5 p.
 artikel
40 Editorial Board 2014
 1-2 p. IFC-
1 p.
 artikel
41 Editorial Board 2012
 1-2 p. IFC-
1 p.
 artikel
42 Efficient recognition of equimatchable graphs Demange, Marc
 2014
 1-2 p. 66-71
6 p.
 artikel
43 Enumerating longest increasing subsequences and patience sorting Bespamyatnikh, Sergei
 2000
 1-2 p. 7-11
5 p.
 artikel
44 Enumeration of lattice points in l1 norm Serra-Sagristà, Joan
 2000
 1-2 p. 39-44
6 p.
 artikel
45 Equivalency reasoning to solve a class of hard SAT problems Li, Chu Min
 2000
 1-2 p. 75-81
7 p.
 artikel
46 Error-detecting codes and fault-containing self-stabilization Herman, Ted
 2000
 1-2 p. 41-46
6 p.
 artikel
47 Estimating the range of a function in an online setting Mount, John A.
 1999
 1-2 p. 31-35
5 p.
 artikel
48 Evolutionary graph colouring Dobrev, Stefan
 2000
 1-2 p. 91-94
4 p.
 artikel
49 Exact solution of a minimal recurrence Chang, Keh-Ning
 2000
 1-2 p. 61-64
4 p.
 artikel
50 Farmer's Theorem revisited Veanes, Margus
 2000
 1-2 p. 47-53
7 p.
 artikel
51 Feedback vertex set in hypercubes Focardi, Riccardo
 2000
 1-2 p. 1-5
5 p.
 artikel
52 Finding OR in a noisy broadcast network Feige, Uriel
 2000
 1-2 p. 69-75
7 p.
 artikel
53 Fishing for minimum evolution trees with Neighbor-Nets Bastkowski, Sarah
 2014
 1-2 p. 13-18
6 p.
 artikel
54 Fitness levels with tail bounds for the analysis of randomized search heuristics Witt, Carsten
 2014
 1-2 p. 38-41
4 p.
 artikel
55 Gödelization in the lambda calculus Goldberg, Mayer
 2000
 1-2 p. 13-16
4 p.
 artikel
56 Generalized interpolation in Casl Borzyszkowski, Tomasz
 2000
 1-2 p. 19-24
6 p.
 artikel
57 Generating all the acyclic orientations of an undirected graph Barbosa, Valmir C.
 1999
 1-2 p. 71-74
4 p.
 artikel
58 Hardware/software co-design then and now Wirth, Niklaus
 2003
 1-2 p. 83-87
5 p.
 artikel
59 Havel–Hakimi residues of unigraphs Barrus, Michael D.
 2012
 1-2 p. 44-48
5 p.
 artikel
60 Improved bounds for dictionary look-up with one error Brodal, Gerth Stølting
 2000
 1-2 p. 57-59
3 p.
 artikel
61 It was fun Turski, Władysław M.
 2003
 1-2 p. 7-12
6 p.
 artikel
62 Linear complexity of the x2 mod p orbits Montoya Vitini, F.
 1999
 1-2 p. 3-7
5 p.
 artikel
63 Low discrepancy sets yield approximate min-wise independent permutation families Saks, Michael
 2000
 1-2 p. 29-32
4 p.
 artikel
64 Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables Shi, Yaoyun
 2000
 1-2 p. 79-83
5 p.
 artikel
65 Max-optimal and sum-optimal labelings of graphs Jamison, Robert E.
 2012
 1-2 p. 26-31
6 p.
 artikel
66 Memory-efficient enumeration of constrained spanning trees Nievergelt, Jurg
 1999
 1-2 p. 47-53
7 p.
 artikel
67 Memory-restricted black-box complexity of OneMax Doerr, Benjamin
 2012
 1-2 p. 32-34
3 p.
 artikel
68 Modeling virtual worlds in databases Walczak, Krzysztof
 2003
 1-2 p. 67-72
6 p.
 artikel
69 Monochromatic geometric k-factors for bicolored point sets with auxiliary points Garijo, D.
 2014
 1-2 p. 19-24
6 p.
 artikel
70 Motzkin subposets and Motzkin geodesics in Tamari lattices Baril, J.-L.
 2014
 1-2 p. 31-37
7 p.
 artikel
71 [No title] Fiadeiro, José Luiz
 2003
 1-2 p. 1-2
2 p.
 artikel
72 On a generalized modularization theorem Dimitrakos, Theodosis
 2000
 1-2 p. 65-71
7 p.
 artikel
73 On bounded occurrence constraint satisfaction Håstad, Johan
 2000
 1-2 p. 1-6
6 p.
 artikel
74 On edge-disjoint spanning trees with small depths Hasunuma, Toru
 2000
 1-2 p. 71-74
4 p.
 artikel
75 On inferring linear single-tree languages Mäkinen, Erkki
 2000
 1-2 p. 1-3
3 p.
 artikel
76 Online call control in cellular networks revisited Zhang, Yong
 2012
 1-2 p. 21-25
5 p.
 artikel
77 On-line scheduling with setup costs Gambosi, Giorgio
 2000
 1-2 p. 61-68
8 p.
 artikel
78 On rewrite constraints and context unification Niehren, Joachim
 2000
 1-2 p. 35-40
6 p.
 artikel
79 On the Day–Tripathi orientation of the star graphs: Connectivity Cheng, Eddie
 2000
 1-2 p. 5-10
6 p.
 artikel
80 On the design of correct and optimal dynamical systems and games Sintzoff, Michel
 2003
 1-2 p. 59-65
7 p.
 artikel
81 On the geometry of similarity search: Dimensionality curse and concentration of measure Pestov, Vladimir
 2000
 1-2 p. 47-51
5 p.
 artikel
82 On the inapproximability of minimizing cascading failures under the deterministic threshold model Nie, Lei
 2014
 1-2 p. 1-4
4 p.
 artikel
83 On the linear complexity of the sequences generated by nonlinear filterings García-Villalba, L.J.
 2000
 1-2 p. 67-73
7 p.
 artikel
84 On the optimal utilization of all available states in the 2n moduli set Premkumar, A.B.
 2000
 1-2 p. 51-56
6 p.
 artikel
85 On what exactly goes on when software is developed step-by-step, II: The sequel Maibaum, Tom
 2003
 1-2 p. 45-51
7 p.
 artikel
86 Operational semantics: Concepts and their expression Jones, Cliff B.
 2003
 1-2 p. 27-32
6 p.
 artikel
87 Order-k α-hulls and α-shapes Krasnoshchekov, Dmitry
 2014
 1-2 p. 76-83
8 p.
 artikel
88 PACS, simple-PAC and query learning Castro, Jorge
 2000
 1-2 p. 11-16
6 p.
 artikel
89 Parallel approximation algorithms for maximum weighted matching in general graphs Uehara, Ryuhei
 2000
 1-2 p. 13-17
5 p.
 artikel
90 Performance guarantees for the TSP with a parameterized triangle inequality Bender, Michael A.
 2000
 1-2 p. 17-21
5 p.
 artikel
91 Placing two disks in a convex polygon Kim, Sung Kwon
 2000
 1-2 p. 33-39
7 p.
 artikel
92 Protection in a single-address-space environment Lopriore, Lanfranco
 2000
 1-2 p. 25-32
8 p.
 artikel
93 Quorums from difference covers Colbourn, Charles J.
 2000
 1-2 p. 9-12
4 p.
 artikel
94 Random duplicate storage strategies for load balancing in multimedia servers Aerts, Joep
 2000
 1-2 p. 51-59
9 p.
 artikel
95 Regularity of normed PA processes Kučera, Antonı́n
 1999
 1-2 p. 9-17
9 p.
 artikel
96 Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order Göbel, Manfred
 2000
 1-2 p. 15-18
4 p.
 artikel
97 Security pitfalls of an efficient threshold proxy signature scheme for mobile agents Yu, Yong
 2014
 1-2 p. 5-8
4 p.
 artikel
98 Singleton and 2-periodic attractors of sign-definite Boolean networks Akutsu, Tatsuya
 2012
 1-2 p. 35-38
4 p.
 artikel
99 Software evolution—Background, theory, practice Lehman, Meir M.
 2003
 1-2 p. 33-44
12 p.
 artikel
100 Structured programming: A minor part of software engineering Parnas, David Lorge
 2003
 1-2 p. 53-58
6 p.
 artikel
101 The firing squad synchronization problem with sub-generals Yamashita, Kazuya
 2014
 1-2 p. 60-65
6 p.
 artikel
102 The ∃∀2 fragment of the first-order theory of atomic set constraints is Π0 1 -hard Talbot, Jean-Marc
 2000
 1-2 p. 27-33
7 p.
 artikel
103 The oriented chromatic number of Halin graphs Dybizbański, Janusz
 2014
 1-2 p. 45-49
5 p.
 artikel
104 Timed automata and additive clock constraints Bérard, Béatrice
 2000
 1-2 p. 1-7
7 p.
 artikel
105 Trackless online algorithms for the server problem Bein, Wolfgang W.
 2000
 1-2 p. 73-79
7 p.
 artikel
106 Variations on computing reciprocals of power series Schönhage, Arnold
 2000
 1-2 p. 41-46
6 p.
 artikel
107 Very fast and simple approximate string matching Navarro, Gonzalo
 1999
 1-2 p. 65-70
6 p.
 artikel
108 Why software writing is difficult and will remain so Jackson, Michael
 2003
 1-2 p. 13-25
13 p.
 artikel
109 WMT—from a personal perspective Madey, Jan
 2003
 1-2 p. 3-6
4 p.
 artikel
                             109 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland