Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             45 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 An example of a computable absolutely normal number Becher, Verónica
2002
270 1-2 p. 947-958
12 p.
artikel
2 Approximating algebraic functions by means of rational ones Pergola, E.
2002
270 1-2 p. 643-657
15 p.
artikel
3 A priori optimization for the probabilistic maximum independent set problem Murat, Cécile
2002
270 1-2 p. 561-590
30 p.
artikel
4 A pumping lemma for random permitting context languages Ewert, Sigrid
2002
270 1-2 p. 959-967
9 p.
artikel
5 Associative language descriptions Cherubini, Alessandra
2002
270 1-2 p. 463-491
29 p.
artikel
6 Asymptotic behavior in a heap model with two pieces Mairesse, Jean
2002
270 1-2 p. 525-560
36 p.
artikel
7 Author index 2002
270 1-2 p. 977-979
3 p.
artikel
8 Calculs sur les structures de langage dénombrable Bourgade, Ménard
2002
270 1-2 p. 205-222
18 p.
artikel
9 Compact factors of countable state Markov shifts Fiebig, Doris
2002
270 1-2 p. 935-946
12 p.
artikel
10 Computational complexity of some problems involving congruences on algebras Bergman, Clifford
2002
270 1-2 p. 591-608
18 p.
artikel
11 Computing LOGCFL certificates Gottlob, Georg
2002
270 1-2 p. 761-777
17 p.
artikel
12 Constructible functions in cellular automata and their applications to hierarchy results Iwamoto, Chuzo
2002
270 1-2 p. 797-809
13 p.
artikel
13 Control structures in hypothesis spaces: the influence on learning Case, John
2002
270 1-2 p. 287-308
22 p.
artikel
14 Decision lists and related Boolean functions Eiter, Thomas
2002
270 1-2 p. 493-524
32 p.
artikel
15 Decision tree approximations of Boolean functions Mehta, Dinesh
2002
270 1-2 p. 609-623
15 p.
artikel
16 Deterministic parallel backtrack search Herley, Kieran T.
2002
270 1-2 p. 309-324
16 p.
artikel
17 Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures Matz, Oliver
2002
270 1-2 p. 1-70
70 p.
artikel
18 Edge coloring of bipartite graphs with constraints Caragiannis, Ioannis
2002
270 1-2 p. 361-399
39 p.
artikel
19 Inheritance of workflows: an approach to tackling problems related to change van der Aalst, W.M.P
2002
270 1-2 p. 125-203
79 p.
artikel
20 Least adaptive optimal search with unreliable tests Cicalese, Ferdinando
2002
270 1-2 p. 877-893
17 p.
artikel
21 Master index 2002
270 1-2 p. 981-992
12 p.
artikel
22 Membrane systems with carriers Martı́n-Vide, Carlos
2002
270 1-2 p. 779-796
18 p.
artikel
23 On canonical number systems Akiyama, Shigeki
2002
270 1-2 p. 921-933
13 p.
artikel
24 On-line load balancing of temporary tasks revisited Lam, Tak-Wah
2002
270 1-2 p. 325-340
16 p.
artikel
25 On the complexity of recognizing the Hilbert basis of a linear diophantine system Durand, Arnaud
2002
270 1-2 p. 625-642
18 p.
artikel
26 On the design of efficient ATM routing schemes Becchetti, Luca
2002
270 1-2 p. 341-359
19 p.
artikel
27 On two-sided infinite fixed points of morphisms Shallit, Jeffrey
2002
270 1-2 p. 659-675
17 p.
artikel
28 Operations and language generating devices suggested by the genome evolution Dassow, Jürgen
2002
270 1-2 p. 701-738
38 p.
artikel
29 Partial words and a theorem of Fine and Wilf revisited Blanchet-Sadri, F.
2002
270 1-2 p. 401-419
19 p.
artikel
30 Probabilistic rebound Turing machines Zhang, Lan
2002
270 1-2 p. 739-760
22 p.
artikel
31 Restriction categories I: categories of partial maps Cockett, J.R.B.
2002
270 1-2 p. 223-259
37 p.
artikel
32 Rush Hour is PSPACE-complete, or “Why you should generously tip parking lot attendants” Flake, Gary William
2002
270 1-2 p. 895-911
17 p.
artikel
33 Searching games with errors—fifty years of coping with liars Pelc, Andrzej
2002
270 1-2 p. 71-109
39 p.
artikel
34 Simple and flexible detection of contiguous repeats using a suffix tree Stoye, Jens
2002
270 1-2 p. 843-856
14 p.
artikel
35 Some permutation routing algorithms for low-dimensional hypercubes Hwang, F.K.
2002
270 1-2 p. 111-124
14 p.
artikel
36 The accelerated k-in-a-row game Pluhár, András
2002
270 1-2 p. 865-875
11 p.
artikel
37 The drawability problem for minimum weight triangulations Lenhart, William
2002
270 1-2 p. 261-286
26 p.
artikel
38 The rectangle complexity of functions on two-dimensional lattices Sander, J.W.
2002
270 1-2 p. 857-863
7 p.
artikel
39 The stack-size of tries: a combinatorial study Nebel, Markus E.
2002
270 1-2 p. 441-461
21 p.
artikel
40 The structure of a linear chip firing game and related models Goles, Eric
2002
270 1-2 p. 827-841
15 p.
artikel
41 The Variance of the height of binary search trees Drmota, Michael
2002
270 1-2 p. 913-919
7 p.
artikel
42 Threshold counters with increments and decrements Busch, Costas
2002
270 1-2 p. 811-826
16 p.
artikel
43 Time-minimal paths amidst moving obstacles in three dimensions Fujimura, Kikuo
2002
270 1-2 p. 421-440
20 p.
artikel
44 Two undecidability results for chain code picture languages Kim, Changwook
2002
270 1-2 p. 969-976
8 p.
artikel
45 Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time Kučera, Antonı́n
2002
270 1-2 p. 677-700
24 p.
artikel
                             45 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland