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
 
                             49 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Abstract deduction and inferential models for type theory Gentilini, Paolo
2010
220-221 7 p. 737-771
35 p.
artikel
2 Addendum to “Scalable secure storage when half the system is faulty” [Inform. Comput. 174 (2)(2002) 203–213] Alon, Noga
2007
220-221 7 p. 1114-1116
3 p.
artikel
3 A framework for the verification of infinite-state graph transformation systems Baldan, Paolo
2008
220-221 7 p. 869-907
39 p.
artikel
4 A general mathematics of names Gabbay, Murdoch J.
2007
220-221 7 p. 982-1011
30 p.
artikel
5 An ID-based multi-signer universal designated multi-verifier signature scheme Chang, Ting-Yi
2011
220-221 7 p. 1007-1015
9 p.
artikel
6 A thread calculus with molecular dynamics Bergstra, J.A.
2010
220-221 7 p. 817-844
28 p.
artikel
7 Automatic decidability and combinability Lynch, Christopher
2011
220-221 7 p. 1026-1047
22 p.
artikel
8 Axiomatizing rational power series over natural numbers Bloom, S.L.
2009
220-221 7 p. 793-811
19 p.
artikel
9 A zero-one law for RP and derandomization of AM if NP is not small Impagliazzo, Russell
2009
220-221 7 p. 787-792
6 p.
artikel
10 BTL 2 and the expressive power of ECTL + Rabinovich, Alexander
2006
220-221 7 p. 1023-1044
22 p.
artikel
11 Compositional verification of sequential programs with procedures Gurov, Dilian
2008
220-221 7 p. 840-868
29 p.
artikel
12 Computability of probability measures and Martin-Löf randomness over metric spaces Hoyrup, Mathieu
2009
220-221 7 p. 830-847
18 p.
artikel
13 Computational complexity of sentences over fields Tung, Shih Ping
2008
220-221 7 p. 791-805
15 p.
artikel
14 Determined theories and limit laws Baldwin, John T.
2006
220-221 7 p. 1013-1022
10 p.
artikel
15 Editorial Board 2011
220-221 7 p. i-
1 p.
artikel
16 Editorial Board 2011
220-221 7 p. IFC-
1 p.
artikel
17 Editorial Board (continued) 2010
220-221 7 p. i-
1 p.
artikel
18 Editorial Board (continued) 2008
220-221 7 p. i-
1 p.
artikel
19 Editorial Board (continued) 2007
220-221 7 p. i-
1 p.
artikel
20 Editorial Board (continued) 2009
220-221 7 p. i-
1 p.
artikel
21 Editorial Board (continued) 2006
220-221 7 p. i-
1 p.
artikel
22 Efficient and exact quantum compression Reif, John H.
2007
220-221 7 p. 967-981
15 p.
artikel
23 Ensuring termination by typability Deng, Yuxin
2006
220-221 7 p. 1045-1082
38 p.
artikel
24 Faster query algorithms for the text fingerprinting problem Chan, Chi-Yuan
2011
220-221 7 p. 1057-1069
13 p.
artikel
25 Fast gapped variants for Lempel–Ziv–Welch compression Apostolico, Alberto
2007
220-221 7 p. 1012-1026
15 p.
artikel
26 Finding the conditional location of a median path on a tree Wang, Biing-Feng
2008
220-221 7 p. 828-839
12 p.
artikel
27 Inapproximability of the Tutte polynomial Goldberg, Leslie Ann
2008
220-221 7 p. 908-929
22 p.
artikel
28 Inside Front Cover: Editorial Board 2010
220-221 7 p. IFC-
1 p.
artikel
29 Inside Front Cover: Editorial Board 2008
220-221 7 p. IFC-
1 p.
artikel
30 Inside Front Cover: Editorial Board 2006
220-221 7 p. CO2-
1 p.
artikel
31 Inside Front Cover: Editorial Board 2007
220-221 7 p. IFC-
1 p.
artikel
32 Inside Front Cover: Editorial Board 2009
220-221 7 p. IFC-
1 p.
artikel
33 On computing ord N (2) and its application Liu, Lihua
2006
220-221 7 p. 1173-1178
6 p.
artikel
34 On identifying codes that are robust against edge changes Honkala, Iiro
2007
220-221 7 p. 1078-1095
18 p.
artikel
35 On properties not inherited by monoids from their Schützenberger groups Gray, R.
2011
220-221 7 p. 1120-1134
15 p.
artikel
36 On the complexity of checking semantic equivalences between pushdown processes and finite-state processes Kučera, Antonín
2010
220-221 7 p. 772-796
25 p.
artikel
37 On two DES implementations secure against differential power analysis in smart-cards Lv, Jiqiang
2006
220-221 7 p. 1179-1193
15 p.
artikel
38 Ready simulation for concurrency: It’s logical! Lüttgen, Gerald
2010
220-221 7 p. 845-867
23 p.
artikel
39 Rotation and lighting invariant template matching Fredriksson, Kimmo
2007
220-221 7 p. 1096-1113
18 p.
artikel
40 Space-efficient construction of Lempel–Ziv compressed text indexes Arroyuelo, Diego
2011
220-221 7 p. 1070-1102
33 p.
artikel
41 Splitting bisimulations and retrospective conditions Bergstra, J.A.
2006
220-221 7 p. 1083-1138
56 p.
artikel
42 Symbolic model checking for probabilistic timed automata Kwiatkowska, Marta
2007
220-221 7 p. 1027-1077
51 p.
artikel
43 Terminal coalgebras and free iterative theories Adámek, Jiřı´
2006
220-221 7 p. 1139-1172
34 p.
artikel
44 Treewidth computations II. Lower bounds Bodlaender, Hans L.
2011
220-221 7 p. 1103-1119
17 p.
artikel
45 Two-way unary automata versus logarithmic space Geffert, Viliam
2011
220-221 7 p. 1016-1025
10 p.
artikel
46 Typechecking top-down XML transformations: Fixed input or output schemas Martens, Wim
2008
220-221 7 p. 806-827
22 p.
artikel
47 Undecidable equivalences for basic parallel processes Hüttel, Hans
2009
220-221 7 p. 812-829
18 p.
artikel
48 Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces Gastin, Paul
2010
220-221 7 p. 797-816
20 p.
artikel
49 Unprovability of the logical characterization of bisimulation Sánchez Terraf, Pedro
2011
220-221 7 p. 1048-1056
9 p.
artikel
                             49 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland