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
 
                             34 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Algebraic nets with flexible arcs Kindler, Ekkart

262 1-2 p. 285-310
artikel
2 Analogies and differences between quantum and stochastic automata Bertoni, Alberto

262 1-2 p. 69-81
artikel
3 A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems DasGupta, Bhaskar

262 1-2 p. 161-189
artikel
4 Approximate evaluations of characteristic polynomials of Boolean functions Lee, David

262 1-2 p. 37-68
artikel
5 Approximate periods of strings Sim, Jeong Seop

262 1-2 p. 557-568
artikel
6 Approximation algorithms for channel assignment with constraints Janssen, Jeannette

262 1-2 p. 649-667
artikel
7 Approximations for Steiner trees with minimum number of Steiner points Chen, Donghui

262 1-2 p. 83-99
artikel
8 Approximations for the general block distribution of a matrix Aspvall, Bengt

262 1-2 p. 145-160
artikel
9 Author index volume 262 (2001)
262 1-2 p. 699-700
artikel
10 Dot operators Borchert, Bernd

262 1-2 p. 501-523
artikel
11 Efficient web searching using temporal factors Czumaj, Artur

262 1-2 p. 569-582
artikel
12 Finite maximal solid codes Lam, Nguyen Huong

262 1-2 p. 333-347
artikel
13 Formal properties of PA-matching Kobayashi, Satoshi

262 1-2 p. 117-131
artikel
14 Hyper-polynomial hierarchies and the polynomial jump Fenner, Stephen

262 1-2 p. 241-256
artikel
15 Implementing conditional term rewriting by graph rewriting Ohlebusch, Enno

262 1-2 p. 311-331
artikel
16 Local and global cyclicity in free semigroups Holub, Štěpán

262 1-2 p. 25-36
artikel
17 Longest fault-free paths in star graphs with vertex faults Hsieh, Sun-Yuan

262 1-2 p. 215-227
artikel
18 Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees Kao, Ming-Yang

262 1-2 p. 101-115
artikel
19 Multiplicities of covers for sofic shifts Fiebig, Doris

262 1-2 p. 349-375
artikel
20 On β-skeleton as a subgraph of the minimum weight triangulation Cheng, Siu-Wing

262 1-2 p. 459-471
artikel
21 On the power of Las Vegas II: Two-way finite automata Hromkovič, Juraj

262 1-2 p. 1-24
artikel
22 Parallel algorithms for red–black trees Park, Heejin

262 1-2 p. 415-435
artikel
23 Preemptive multiprocessor scheduling with rejection Seiden, Steven S.

262 1-2 p. 437-458
artikel
24 Priority queues with binary priorities Kalorkoti, K.

262 1-2 p. 133-144
artikel
25 Recurrence and periodicity in infinite words from local periods Duval, J.-P.

262 1-2 p. 269-284
artikel
26 Representations versus numberings: on the relationship of two computability notions Spreen, Dieter

262 1-2 p. 473-499
artikel
27 Strong cocycle triviality for Z 2 subshifts Jenkinson, Oliver

262 1-2 p. 191-213
artikel
28 Structure of some sand piles model Latapy, Matthieu

262 1-2 p. 525-556
artikel
29 Termination and derivational complexity of confluent one-rule string-rewriting systems Kobayashi, Yuji

262 1-2 p. 583-632
artikel
30 The component hierarchy of chain-free cooperating distributed regular tree grammars Dányi, G.

262 1-2 p. 229-240
artikel
31 Topological properties of omega context-free languages Finkel, Olivier

262 1-2 p. 669-697
artikel
32 Tree-based generation of languages of fractals Drewes, Frank

262 1-2 p. 377-414
artikel
33 Tree-shellability of Boolean functions Takenaga, Yasuhiko

262 1-2 p. 633-647
artikel
34 Wire segmenting for buffer insertion based on RSTP-MSP Lu, Bing

262 1-2 p. 257-267
artikel
                             34 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland