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
 
                             98 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Activity testing model for automatic correction of hand pointing Song, Yalin
2016
11 p. 653-659
7 p.
artikel
2 A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree Iyer, K. Viswanathan
2009
11 p. 560-562
3 p.
artikel
3 An aggressive algorithm for multiple string matching Dai, Liuling
2009
11 p. 553-559
7 p.
artikel
4 Analyzing scheduling with transient failures Saule, Erik
2009
11 p. 539-542
4 p.
artikel
5 An efficient location-based compromise-tolerant key management scheme for sensor networks Duan, Mei-jiao
2011
11 p. 503-507
5 p.
artikel
6 A new self-stabilizing algorithm for maximal p-star decomposition of general graphs Neggazi, Brahim
2015
11 p. 892-898
7 p.
artikel
7 An extension of Hall's theorem for partitioned bipartite graphs Morsy, Ehab
2016
11 p. 706-709
4 p.
artikel
8 An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality Mömke, Tobias
2015
11 p. 866-871
6 p.
artikel
9 A note on one-space bounded square packing Grzegorek, Paulina
2015
11 p. 872-876
5 p.
artikel
10 A note on quasi-kernels in digraphs Croitoru, Cosmina
2015
11 p. 863-865
3 p.
artikel
11 A note on some collapse results of valued constraints Zanuttini, Bruno
2009
11 p. 534-538
5 p.
artikel
12 A polynomial algorithm for the multiple knapsack problem with divisible item sizes Detti, Paolo
2009
11 p. 582-584
3 p.
artikel
13 Approximate spanning cactus Datta, Alak Kumar
2015
11 p. 828-832
5 p.
artikel
14 Approximation algorithms for the Fault-Tolerant Facility Placement problem Yan, Li
2011
11 p. 545-549
5 p.
artikel
15 A pseudorandom bit generator based on new multi-delayed Chebyshev map Liu, Lingfeng
2016
11 p. 674-681
8 p.
artikel
16 A refined analysis on the jump number problem of interval orders Yuan, Chen
2015
11 p. 797-800
4 p.
artikel
17 A second-order formulation of non-termination Mesnard, Fred
2015
11 p. 882-885
4 p.
artikel
18 A short note on type-inhabitation: Formula-trees vs. game semantics Alves, S.
2015
11 p. 908-911
4 p.
artikel
19 A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph Berry, Anne
2011
11 p. 508-511
4 p.
artikel
20 A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation van Zuylen, Anke
2016
11 p. 718-722
5 p.
artikel
21 A type and effect system for activation flow of components in Android programs Choi, Kwanghoon
2014
11 p. 620-627
8 p.
artikel
22 Average complexity of backward q-gram string matching algorithms Salmela, Leena
2012
11 p. 433-437
5 p.
artikel
23 Bandwidth of convex bipartite graphs and related graphs Shrestha, Anish Man Singh
2012
11 p. 411-417
7 p.
artikel
24 Characterization of repetitions in Sturmian words: A new proof Peltomäki, Jarkko
2015
11 p. 886-891
6 p.
artikel
25 Combined supervised information with PCA via discriminative component selection Huang, Sheng
2015
11 p. 812-816
5 p.
artikel
26 Complexity of semi-stable and stage semantics in argumentation frameworks Dvořák, Wolfgang
2010
11 p. 425-430
6 p.
artikel
27 Concurrent non-malleable statistically hiding commitment Zhang, Zongyang
2012
11 p. 443-448
6 p.
artikel
28 Constant-space quantum interactive proofs against multiple provers Yamakami, Tomoyuki
2014
11 p. 611-619
9 p.
artikel
29 Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227] Lingas, Andrzej
2014
11 p. 646-654
9 p.
artikel
30 CPL+: An improved approach for evaluating the local completeness of event logs Yang, Hedong
2014
11 p. 607-610
4 p.
artikel
31 Cryptanalysis of RSA with a small parameter revisited Meng, Xianmeng
2015
11 p. 858-862
5 p.
artikel
32 Drawing trees in a streaming model Binucci, Carla
2012
11 p. 418-422
5 p.
artikel
33 Dynamic threshold secret reconstruction and its application to the threshold cryptography Harn, Lein
2015
11 p. 851-857
7 p.
artikel
34 Edge-fault-tolerant vertex-pancyclicity of augmented cubes Fu, Jung-Sheng
2010
11 p. 439-443
5 p.
artikel
35 Editorial Board 2010
11 p. IFC-
1 p.
artikel
36 Editorial Board 2014
11 p. IFC-
1 p.
artikel
37 Editorial Board 2016
11 p. IFC-
1 p.
artikel
38 Editorial Board 2009
11 p. IFC-
1 p.
artikel
39 Editorial Board 2015
11 p. IFC-
1 p.
artikel
40 Editorial Board 2011
11 p. IFC-
1 p.
artikel
41 Editorial Board 2012
11 p. IFC-
1 p.
artikel
42 Efficient algorithms for the longest common subsequence in k-length substrings Deorowicz, Sebastian
2014
11 p. 634-638
5 p.
artikel
43 Efficient precomputation schemes of k P + l Q Lin, Qiping
2012
11 p. 462-466
5 p.
artikel
44 Embedding a long fault-free cycle in a crossed cube with more faulty nodes Dong, Qiang
2010
11 p. 464-468
5 p.
artikel
45 Enhanced utilization bound of Rate-Monotonic scheduling in Controller Area Networks Park, Moonju
2014
11 p. 603-606
4 p.
artikel
46 Estimating the number of connected components in sublinear time Berenbrink, Petra
2014
11 p. 639-642
4 p.
artikel
47 Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs Cai, Junqing
2016
11 p. 668-673
6 p.
artikel
48 Flaws in some self-healing key distribution schemes with revocation Daza, Vanesa
2009
11 p. 523-526
4 p.
artikel
49 Flexible coloring Li, Xiaozhou
2011
11 p. 538-540
3 p.
artikel
50 Fully CCA2 secure identity based broadcast encryption without random oracles Ren, Yanli
2009
11 p. 527-533
7 p.
artikel
51 10-Gabriel graphs are Hamiltonian Kaiser, Tomáš
2015
11 p. 877-881
5 p.
artikel
52 Hardness of peeling with stashes Mitzenmacher, Michael
2016
11 p. 682-688
7 p.
artikel
53 Holographic algorithms on bases of rank 2 Fu, Zhiguo
2014
11 p. 585-590
6 p.
artikel
54 Identification of Hammerstein systems with continuous nonlinearity Chen, Jing
2015
11 p. 822-827
6 p.
artikel
55 Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines Wu, Yong
2015
11 p. 838-844
7 p.
artikel
56 Integer programming with 2-variable equations and 1-variable inequalities Bodirsky, Manuel
2009
11 p. 572-575
4 p.
artikel
57 Learning a subclass of k-quasi-Horn formulas with membership queries Lavín Puente, Víctor
2011
11 p. 550-555
6 p.
artikel
58 Loop-free Gray code algorithm for the e-restricted growth functions Mansour, Toufik
2011
11 p. 541-544
4 p.
artikel
59 Minimum cost flows with minimum quantities Krumke, Sven O.
2011
11 p. 533-537
5 p.
artikel
60 New lower bounds for online k-server routing problems Fink, Irene
2009
11 p. 563-567
5 p.
artikel
61 Note on Max Lin-2 above Average Crowston, Robert
2010
11 p. 451-454
4 p.
artikel
62 Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan Fu, Ruyan
2010
11 p. 444-450
7 p.
artikel
63 On some special cases of the restricted assignment problem Wang, Chao
2016
11 p. 723-728
6 p.
artikel
64 On the algorithmic complexity of zero-sum edge-coloring Dehghan, Ali
2016
11 p. 660-667
8 p.
artikel
65 On the approximability of the Largest Sphere Rule Ensemble Classification problem Mkrtchyan, Vahan
2015
11 p. 833-837
5 p.
artikel
66 On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements Gyssens, Marc
2014
11 p. 628-633
6 p.
artikel
67 On the complexity of role updating feasibility problem in RBAC Lu, Jianfeng
2014
11 p. 597-602
6 p.
artikel
68 On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers Aumasson, Jean-Philippe
2011
11 p. 512-515
4 p.
artikel
69 On the displacement for covering a unit interval with randomly placed sensors Kapelko, Rafał
2016
11 p. 710-717
8 p.
artikel
70 On the greatest solution of equations in CLL R Zhang, Yan
2015
11 p. 903-907
5 p.
artikel
71 On the nonnegative rank of distance matrices Hrubeš, Pavel
2012
11 p. 457-461
5 p.
artikel
72 On the security margin of MAC striping Eisenbarth, T.
2015
11 p. 899-902
4 p.
artikel
73 On the two-dimensional cow search problem Jeż, Artur
2009
11 p. 543-547
5 p.
artikel
74 Optimal online markdown and markup pricing policies with demand uncertainty Ni, Guanqun
2015
11 p. 804-811
8 p.
artikel
75 Program synthesis by model finding Mota, Alexandre
2016
11 p. 701-705
5 p.
artikel
76 Quadratic-time algorithm for a string constrained LCS problem Deorowicz, Sebastian
2012
11 p. 423-426
4 p.
artikel
77 Recursive sum–product algorithm for generalized outer-planar graphs Cheng, Qiang
2012
11 p. 449-456
8 p.
artikel
78 Red-black trees with relative node keys Holenderski, Mike
2014
11 p. 591-596
6 p.
artikel
79 Reducing the diameter of a unit disk graph via node addition Di Ianni, Miriam
2015
11 p. 845-850
6 p.
artikel
80 Scheduling with job-dependent learning effects and multiple rate-modifying activities Ji, Min
2010
11 p. 460-463
4 p.
artikel
81 Security issues in Sarkar's e-cash protocol Barguil, Joao M.M.
2015
11 p. 801-803
3 p.
artikel
82 Single-machine scheduling with a nonlinear deterioration function Lai, Peng-Jen
2010
11 p. 455-459
5 p.
artikel
83 Speedup for a periodic subgraph miner Apostolico, Alberto
2011
11 p. 521-523
3 p.
artikel
84 String matching with inversions and translocations in linear average time (most of the time) Grabowski, Szymon
2011
11 p. 516-520
5 p.
artikel
85 Strong equivalence of logic programs under the infinite-valued semantics Nomikos, Christos
2009
11 p. 576-581
6 p.
artikel
86 Subnetwork preclusion for bubble-sort networks Yang, Yuxing
2015
11 p. 817-821
5 p.
artikel
87 Supporting early pruning in top-k query processing on massive data Han, Xixian
2011
11 p. 524-532
9 p.
artikel
88 The cost of probabilistic agreement in oblivious robot networks Clement, Julien
2010
11 p. 431-438
8 p.
artikel
89 The Fermat star of binary trees Luccio, Fabrizio
2009
11 p. 568-571
4 p.
artikel
90 The frequent paucity of trivial strings Lutz, Jack H.
2014
11 p. 643-645
3 p.
artikel
91 The metric dimension for resolving several objects Laihonen, Tero
2016
11 p. 694-700
7 p.
artikel
92 The (nested) word problem Henry, Christopher S.
2016
11 p. 729-734
6 p.
artikel
93 The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers Wang, Qingju
2012
11 p. 427-432
6 p.
artikel
94 The quantum query complexity of learning multilinear polynomials Montanaro, Ashley
2012
11 p. 438-442
5 p.
artikel
95 Time-varying PSO – convergence analysis, convergence-related parameterization and new parameter adjustment schemes Rapaić, Milan R.
2009
11 p. 548-552
5 p.
artikel
96 Two models of two-dimensional bandwidth problems Lin, Lan
2010
11 p. 469-473
5 p.
artikel
97 Vertex-transitivity on folded crossed cubes Pai, Kung-Jui
2016
11 p. 689-693
5 p.
artikel
98 Whole mirror duplication-random loss model and pattern avoiding permutations Baril, Jean-Luc
2010
11 p. 474-480
7 p.
artikel
                             98 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland