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
 
                             91 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A combinatorial property on angular orders of plane point sets Fabila-Monroy, Ruy
2011
12 p. 591-594
4 p.
artikel
2 A comment on “Independent spanning trees in crossed cubes” Chang, Jou-Ming
2014
12 p. 734-739
6 p.
artikel
3 Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes Chen, Meirun
2009
12 p. 599-602
4 p.
artikel
4 A DP algorithm for minimizing makespan and total completion time on a series-batching machine He, Cheng
2009
12 p. 603-607
5 p.
artikel
5 A faster algorithm for the cluster editing problem on proper interval graphs Lin, Min Chih
2015
12 p. 913-916
4 p.
artikel
6 A linear time algorithm for consecutive permutation pattern matching Kubica, M.
2013
12 p. 430-433
4 p.
artikel
7 An algorithm for computing simple k-factors Meijer, Henk
2009
12 p. 620-625
6 p.
artikel
8 An algorithm for solving the longest increasing circular subsequence problem Deorowicz, Sebastian
2009
12 p. 630-634
5 p.
artikel
9 A necessary condition for Byzantine k-set agreement Bouzid, Zohir
2016
12 p. 757-759
3 p.
artikel
10 An efficient algorithm for computing non-overlapping inversion and transposition distance Ta, Toan Thang
2016
12 p. 744-749
6 p.
artikel
11 A new binary code of length 16 and minimum distance 3 Milshtein, Moshe
2015
12 p. 975-976
2 p.
artikel
12 A new multiple classifier system for the prediction of protein's contacts map Santiesteban-Toca, Cosme E.
2015
12 p. 983-990
8 p.
artikel
13 A new upper bound on the parameters of quasi-symmetric designs Ghosh, Debashis
2013
12 p. 444-446
3 p.
artikel
14 An industrial study on the importance of software component documentation: A system integratorʼs perspective Mahmood, Sajjad
2011
12 p. 583-590
8 p.
artikel
15 A note on a Maximum k-Subset Intersection problem Xavier, Eduardo C.
2012
12 p. 471-472
2 p.
artikel
16 A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs” Lee, Kangbok
2009
12 p. 608-610
3 p.
artikel
17 A note on atomicity: Boosting Test&Set to solve consensus Imbs, Damien
2009
12 p. 589-591
3 p.
artikel
18 A note on cycle embedding in hypercubes with faulty vertices Du, Zheng-Zhong
2011
12 p. 557-560
4 p.
artikel
19 A note on SAT algorithms and proof complexity Krajíček, Jan
2012
12 p. 490-493
4 p.
artikel
20 A note on “The super connectivity of augmented cubes” Ma, Meijie
2009
12 p. 592-593
2 p.
artikel
21 A note on unbounded parallel-batch scheduling Geng, Zhichao
2015
12 p. 969-974
6 p.
artikel
22 A novel elementary construction of matching vectors Yuan, Chen
2012
12 p. 494-496
3 p.
artikel
23 A PTAS for geometric 2-FTP Moezkarimi, Zahra
2014
12 p. 670-675
6 p.
artikel
24 A short note on “Proportionate flowshops with general position-dependent processing times” Kuo, Wen-Hung
2012
12 p. 479-480
2 p.
artikel
25 A simple local 3-approximation algorithm for vertex cover Polishchuk, Valentin
2009
12 p. 642-645
4 p.
artikel
26 Attacks on statistical databases: The highly noisy case Kantor, Alexander
2013
12 p. 409-413
5 p.
artikel
27 Biclique cryptanalysis of LBlock and TWINE Karakoç, F.
2013
12 p. 423-429
7 p.
artikel
28 Bounds on locating total domination number of the Cartesian product of cycles and paths Xing, Huaming
2015
12 p. 950-956
7 p.
artikel
29 Common knowledge does not have the Beth property Studer, Thomas
2009
12 p. 611-614
4 p.
artikel
30 Compact representations of automata for regular expression matching Zhang, Meng
2016
12 p. 750-756
7 p.
artikel
31 Conditional fault hamiltonian connectivity of the complete graph Ho, Tung-Yang
2009
12 p. 585-588
4 p.
artikel
32 Correcting noisy exponentiation black-boxes modulo a prime Shparlinski, Igor E.
2013
12 p. 414-417
4 p.
artikel
33 Cryptanalysis of GOST R hash function Wang, Zongyue
2014
12 p. 655-662
8 p.
artikel
34 Deciding safety and liveness in TPTL Basin, David
2014
12 p. 680-688
9 p.
artikel
35 Deterministic network exploration by a single agent with Byzantine tokens Dieudonné, Yoann
2012
12 p. 467-470
4 p.
artikel
36 Differential analysis of the Extended Generalized Feistel Networks Zhang, Lei
2014
12 p. 723-727
5 p.
artikel
37 Eavesdropping in semiquantum key distribution protocol Maitra, Arpita
2013
12 p. 418-422
5 p.
artikel
38 Editorial Board 2014
12 p. IFC-
1 p.
artikel
39 Editorial Board 2009
12 p. IFC-
1 p.
artikel
40 Editorial Board 2015
12 p. IFC-
1 p.
artikel
41 Editorial Board 2016
12 p. IFC-
1 p.
artikel
42 Editorial Board 2013
12 p. IFC-
1 p.
artikel
43 Editorial Board 2011
12 p. IFC-
1 p.
artikel
44 Editorial Board 2012
12 p. IFC-
1 p.
artikel
45 Efficient dominating sets in circulant graphs with domination number prime Deng, Yun-Ping
2014
12 p. 700-702
3 p.
artikel
46 Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems Feng, Jun
2013
12 p. 405-408
4 p.
artikel
47 Embedding even cycles on folded hypercubes with conditional faulty edges Cheng, Dongqin
2015
12 p. 945-949
5 p.
artikel
48 Embedding of hypercubes into necklace, windmill and snake graphs Rajasingh, Indra
2012
12 p. 509-515
7 p.
artikel
49 Enumerating minimal dominating sets in chordal graphs Abu-Khzam, Faisal N.
2016
12 p. 739-743
5 p.
artikel
50 Faster output-sensitive skyline computation algorithm Liu, Jinfei
2014
12 p. 710-713
4 p.
artikel
51 Finding outer-connected dominating sets in interval graphs Lin, Chiou-Jiun
2015
12 p. 917-922
6 p.
artikel
52 Fractional programming formulation for the vertex coloring problem Matsui, Tomomi
2014
12 p. 706-709
4 p.
artikel
53 Google Scholar makes it hard – the complexity of organizing one's publications Bodlaender, Hans L.
2015
12 p. 965-968
4 p.
artikel
54 Hamilton cycles in implicit claw-heavy graphs Huang, Xing
2014
12 p. 676-679
4 p.
artikel
55 Impact of Intelʼs new instruction sets on software implementation of GF ( 2 ) [ x ] multiplication Su, Chen
2012
12 p. 497-502
6 p.
artikel
56 Improved semi-online makespan scheduling with a reordering buffer Sun, Hongyang
2013
12 p. 434-439
6 p.
artikel
57 Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling Zhu, Jianghan
2011
12 p. 609-613
5 p.
artikel
58 Lot scheduling on a single machine Hou, Yung-Tsung
2014
12 p. 718-722
5 p.
artikel
59 New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm Bauer, Joanna
2009
12 p. 615-619
5 p.
artikel
60 Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs Li, Wenjie
2012
12 p. 503-508
6 p.
artikel
61 On path bipancyclicity of hypercubes Chen, Xie-Bin
2009
12 p. 594-598
5 p.
artikel
62 On security against the server in designated tester public key encryption with keyword search Shao, Zhi-Yi
2015
12 p. 957-961
5 p.
artikel
63 On the advice complexity of online bipartite matching and online stable marriage Miyazaki, Shuichi
2014
12 p. 714-717
4 p.
artikel
64 On the bounds of feedback numbers of ( n , k ) -star graphs Wang, Jian
2012
12 p. 473-478
6 p.
artikel
65 On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees Xu, Chuandong
2015
12 p. 939-944
6 p.
artikel
66 On the possible patterns of inputs for block sorting in the Burrows–Wheeler transformation Saso, Takashi
2011
12 p. 595-599
5 p.
artikel
67 On the size of the subset partial order Elmasry, Amr
2012
12 p. 487-489
3 p.
artikel
68 Optimal cuts and partitions in tree metrics in polynomial time Karpinski, Marek
2013
12 p. 447-451
5 p.
artikel
69 Optimal strategy of coupon subset collection when each package contains half of the coupons Fang, Chengfang
2014
12 p. 703-705
3 p.
artikel
70 Palindromic rich words and run-length encodings Guo, Chuan
2016
12 p. 735-738
4 p.
artikel
71 Parikhʼs theorem: A simple and direct automaton construction Esparza, Javier
2011
12 p. 614-619
6 p.
artikel
72 Planar lower envelope of monotone polygonal chains Lu, Daniel L.
2015
12 p. 962-964
3 p.
artikel
73 Serial batch scheduling on uniform parallel machines to minimize total completion time Li, Song-Song
2014
12 p. 692-695
4 p.
artikel
74 Shorter strings containing all k-element permutations Zălinescu, Eugen
2011
12 p. 605-608
4 p.
artikel
75 Sparse weighted voting classifier selection and its linear programming relaxations Goldberg, Noam
2012
12 p. 481-486
6 p.
artikel
76 Star coloring of cubic graphs Xie, Dezheng
2014
12 p. 689-691
3 p.
artikel
77 Strong local diagnosability of ( n , k ) -star graphs and Cayley graphs generated by 2-trees with missing edges Cheng, Eddie
2013
12 p. 452-456
5 p.
artikel
78 Testing the irreducibility of nonsquare Perron–Frobenius systems Avin, C.
2014
12 p. 728-733
6 p.
artikel
79 The complexity of pure equilibria in mix-weighted congestion games on parallel links Mavronicolas, Marios
2015
12 p. 927-931
5 p.
artikel
80 The enumeration of permutations sortable by pop stacks in parallel Smith, Rebecca
2009
12 p. 626-629
4 p.
artikel
81 The equitable vertex arboricity of complete tripartite graphs Guo, Zhiwei
2015
12 p. 977-982
6 p.
artikel
82 The number of pessimistic guesses in Generalized Mastermind Jäger, Gerold
2009
12 p. 635-641
7 p.
artikel
83 The optimal structure of algorithms for α-paging Kovács, Annamária
2015
12 p. 932-938
7 p.
artikel
84 The spined cube: A new hypercube variant with smaller diameter Zhou, Wujun
2011
12 p. 561-567
7 p.
artikel
85 Top-k document retrieval in optimal space Tsur, Dekel
2013
12 p. 440-443
4 p.
artikel
86 Unbounded parallel-batch scheduling with family jobs and delivery coordination Li, Shisheng
2011
12 p. 575-582
8 p.
artikel
87 Undecidability of accordance for open systems with unbounded message queues Müller, Richard
2014
12 p. 663-669
7 p.
artikel
88 VC-dimension of perimeter visibility domains Gilbers, Alexander
2014
12 p. 696-699
4 p.
artikel
89 Walks in phylogenetic treespace Caceres, Alan Joseph J.
2011
12 p. 600-604
5 p.
artikel
90 Weighted sampling without replacement from data streams Braverman, Vladimir
2015
12 p. 923-926
4 p.
artikel
91 X-code double parity array operation with two disk failures Thomasian, Alexander
2011
12 p. 568-574
7 p.
artikel
                             91 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland