| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
|
Woeginger, Gerhard J.
|
|
2009
|
|
7 |
p. 341-342
2 p.
|
artikel
|
| 2 |
A new 3-CNF transformation by parallel-serial graphs
|
Bubeck, Uwe
|
|
2009
|
|
7 |
p. 376-379
4 p.
|
artikel
|
| 3 |
A new definition of the contrast of visual cryptography scheme
|
Liu, Feng
|
|
2010
|
|
7 |
p. 241-246
6 p.
|
artikel
|
| 4 |
A new fair scheduling algorithm for periodic tasks on multiprocessors
|
Kim, Heeheon
|
|
2011
|
|
7 |
p. 301-309
9 p.
|
artikel
|
| 5 |
A new method to determine algebraic expression of power mapping based S-boxes
|
Karaahmetoğlu, Osman
|
|
2013
|
|
7 |
p. 229-235
7 p.
|
artikel
|
| 6 |
An improved security-aware packet scheduling algorithm in real-time wireless networks
|
Zhu, Xiaomin
|
|
2012
|
|
7 |
p. 282-288
7 p.
|
artikel
|
| 7 |
A note on efficient domination in a superclass of P 5 -free graphs
|
Brandstädt, Andreas
|
|
2014
|
|
7 |
p. 357-359
3 p.
|
artikel
|
| 8 |
A note on improving the performance of approximation algorithms for radiation therapy
|
Biedl, Therese
|
|
2011
|
|
7 |
p. 326-333
8 p.
|
artikel
|
| 9 |
A note on randomized streaming space bounds for the longest increasing subsequence problem
|
Chakrabarti, Amit
|
|
2012
|
|
7 |
p. 261-263
3 p.
|
artikel
|
| 10 |
A note on the approximation of mean-payoff games
|
Gentilini, Raffaella
|
|
2014
|
|
7 |
p. 382-386
5 p.
|
artikel
|
| 11 |
A note on the size of prenex normal forms
|
Harwath, Frederik
|
|
2016
|
|
7 |
p. 443-446
4 p.
|
artikel
|
| 12 |
Antimagic labeling and canonical decomposition of graphs
|
Barrus, Michael D.
|
|
2010
|
|
7 |
p. 261-263
3 p.
|
artikel
|
| 13 |
Approximating maximum weight K-colorable subgraphs in chordal graphs
|
Chakaravarthy, Venkatesan T.
|
|
2009
|
|
7 |
p. 365-368
4 p.
|
artikel
|
| 14 |
Approximation algorithms for parallel open shop scheduling
|
Chen, Yong
|
|
2013
|
|
7 |
p. 220-224
5 p.
|
artikel
|
| 15 |
A randomized approximation algorithm for computing bucket orders
|
Ukkonen, Antti
|
|
2009
|
|
7 |
p. 356-359
4 p.
|
artikel
|
| 16 |
A simple test on 2-vertex- and 2-edge-connectivity
|
Schmidt, Jens M.
|
|
2013
|
|
7 |
p. 241-244
4 p.
|
artikel
|
| 17 |
Automorphism groups of the Pancake graphs
|
Deng, Yun-Ping
|
|
2012
|
|
7 |
p. 264-266
3 p.
|
artikel
|
| 18 |
Chain rotations: A new look at tree distance
|
Luccio, Fabrizio
|
|
2013
|
|
7 |
p. 201-204
4 p.
|
artikel
|
| 19 |
CMAC, CCM and GCM/GMAC: Advanced modes of operation of symmetric block ciphers in wireless sensor networks
|
Szalachowski, P.
|
|
2010
|
|
7 |
p. 247-251
5 p.
|
artikel
|
| 20 |
Colorful triangle counting and a MapReduce implementation
|
Pagh, Rasmus
|
|
2012
|
|
7 |
p. 277-281
5 p.
|
artikel
|
| 21 |
Comments on “Generalized rate monotonic schedulability bounds using relative period ratios”
|
Park, Moonju
|
|
2011
|
|
7 |
p. 334-337
4 p.
|
artikel
|
| 22 |
Cryptanalysis of a CP-ABE scheme with policy in normal forms
|
Tan, Syh-Yuan
|
|
2016
|
|
7 |
p. 492-495
4 p.
|
artikel
|
| 23 |
Density of straight-line 1-planar graph drawings
|
Didimo, Walter
|
|
2013
|
|
7 |
p. 236-240
5 p.
|
artikel
|
| 24 |
Desynchronization attack on RAPP ultralightweight authentication protocol
|
Ahmadian, Zahra
|
|
2013
|
|
7 |
p. 205-209
5 p.
|
artikel
|
| 25 |
Edge-choosability of planar graphs without non-induced 5-cycles
|
Cai, Jiansheng
|
|
2009
|
|
7 |
p. 343-346
4 p.
|
artikel
|
| 26 |
Editorial Board
|
|
|
2010
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 27 |
Editorial Board
|
|
|
2014
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 28 |
Editorial Board
|
|
|
2009
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 29 |
Editorial Board
|
|
|
2016
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 30 |
Editorial Board
|
|
|
2013
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 31 |
Editorial Board
|
|
|
2011
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 32 |
Editorial Board
|
|
|
2012
|
|
7 |
p. IFC-
1 p.
|
artikel
|
| 33 |
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
|
Belhoul, Yacine
|
|
2014
|
|
7 |
p. 339-343
5 p.
|
artikel
|
| 34 |
E = I + T : The internal extent formula for compacted tries
|
Boldi, Paolo
|
|
2011
|
|
7 |
p. 310-313
4 p.
|
artikel
|
| 35 |
Enhancing the B+-tree by dynamic node popularity caching
|
Yu, Cui
|
|
2010
|
|
7 |
p. 268-273
6 p.
|
artikel
|
| 36 |
Enumeration of balanced finite group valued functions on directed graphs
|
Cherniavsky, Yonah
|
|
2016
|
|
7 |
p. 484-488
5 p.
|
artikel
|
| 37 |
Exact algorithm for graph homomorphism and locally injective graph homomorphism
|
Rzążewski, Paweł
|
|
2014
|
|
7 |
p. 387-391
5 p.
|
artikel
|
| 38 |
Exponential lower bound for bounded depth circuits with few threshold gates
|
Podolskii, Vladimir V.
|
|
2012
|
|
7 |
p. 267-271
5 p.
|
artikel
|
| 39 |
Finding frequent items over sliding windows with constant update time
|
Hung, Regant Y.S.
|
|
2010
|
|
7 |
p. 257-260
4 p.
|
artikel
|
| 40 |
Fork sequential consistency is blocking
|
Cachin, Christian
|
|
2009
|
|
7 |
p. 360-364
5 p.
|
artikel
|
| 41 |
Groupies in random graphs
|
de la Vega, W. Fernandez
|
|
2009
|
|
7 |
p. 339-340
2 p.
|
artikel
|
| 42 |
Improved algorithms for the k simple shortest paths and the replacement paths problems
|
Gotthilf, Zvi
|
|
2009
|
|
7 |
p. 352-355
4 p.
|
artikel
|
| 43 |
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
|
Bonchiş, Cosmin
|
|
2014
|
|
7 |
p. 360-364
5 p.
|
artikel
|
| 44 |
Improved neural dynamics for online Sylvester equations solving
|
Chen, Ke
|
|
2016
|
|
7 |
p. 455-459
5 p.
|
artikel
|
| 45 |
Improving the running time of embedded upward planarity testing
|
Abbasi, Sarmad
|
|
2010
|
|
7 |
p. 274-278
5 p.
|
artikel
|
| 46 |
Locally exchanged twisted cubes: Connectivity and super connectivity
|
Chang, Jou-Ming
|
|
2016
|
|
7 |
p. 460-466
7 p.
|
artikel
|
| 47 |
LP decoding of codes with expansion parameter above 2/3
|
Viderman, Michael
|
|
2013
|
|
7 |
p. 225-228
4 p.
|
artikel
|
| 48 |
Maximum subset intersection
|
Clifford, Raphaël
|
|
2011
|
|
7 |
p. 323-325
3 p.
|
artikel
|
| 49 |
MMH⁎ with arbitrary modulus is always almost-universal
|
Bibak, Khodakhast
|
|
2016
|
|
7 |
p. 481-483
3 p.
|
artikel
|
| 50 |
Nash Equilibria for competitive information diffusion on trees
|
Small, Lucy
|
|
2013
|
|
7 |
p. 217-219
3 p.
|
artikel
|
| 51 |
New upper bounds on the Boolean circuit complexity of symmetric functions
|
Demenkov, E.
|
|
2010
|
|
7 |
p. 264-267
4 p.
|
artikel
|
| 52 |
On a compact encoding of the swap automaton
|
Fredriksson, Kimmo
|
|
2014
|
|
7 |
p. 392-396
5 p.
|
artikel
|
| 53 |
On a connection between small set expansions and modularity clustering
|
DasGupta, Bhaskar
|
|
2014
|
|
7 |
p. 349-352
4 p.
|
artikel
|
| 54 |
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
|
Li, Wenhua
|
|
2012
|
|
7 |
p. 292-297
6 p.
|
artikel
|
| 55 |
On maximal repetitions of arbitrary exponent
|
Kolpakov, Roman
|
|
2010
|
|
7 |
p. 252-256
5 p.
|
artikel
|
| 56 |
On mimicking networks representing minimum terminal cuts
|
Khan, Arindam
|
|
2014
|
|
7 |
p. 365-371
7 p.
|
artikel
|
| 57 |
On the complexity of model checking interval-valued discrete time Markov chains
|
Chen, Taolue
|
|
2013
|
|
7 |
p. 210-216
7 p.
|
artikel
|
| 58 |
On the parameterized complexity of the repetition free longest common subsequence problem
|
Blin, Guillaume
|
|
2012
|
|
7 |
p. 272-276
5 p.
|
artikel
|
| 59 |
On the partition dimension of a class of circulant graphs
|
Grigorious, Cyriac
|
|
2014
|
|
7 |
p. 353-356
4 p.
|
artikel
|
| 60 |
Parallel parsing of operator precedence grammars
|
Barenghi, Alessandro
|
|
2013
|
|
7 |
p. 245-249
5 p.
|
artikel
|
| 61 |
P-hardness of the emptiness problem for visibly pushdown languages
|
Lange, Martin
|
|
2011
|
|
7 |
p. 338-341
4 p.
|
artikel
|
| 62 |
Preemptive stochastic online scheduling on two uniform machines
|
Gu, Manzhan
|
|
2009
|
|
7 |
p. 369-375
7 p.
|
artikel
|
| 63 |
Proof system representations of degrees of disjoint NP-pairs
|
Zhang, Liyu
|
|
2011
|
|
7 |
p. 348-351
4 p.
|
artikel
|
| 64 |
Scalable generation of scale-free graphs
|
Sanders, Peter
|
|
2016
|
|
7 |
p. 489-491
3 p.
|
artikel
|
| 65 |
Security of permutation-based compression function lp 231
|
Lee, Jooyoung
|
|
2014
|
|
7 |
p. 372-381
10 p.
|
artikel
|
| 66 |
Simultaneous image fusion and demosaicing via compressive sensing
|
Yang, Bin
|
|
2016
|
|
7 |
p. 447-454
8 p.
|
artikel
|
| 67 |
Static analysis of navigational XPath over graph databases
|
Kostylev, Egor V.
|
|
2016
|
|
7 |
p. 467-474
8 p.
|
artikel
|
| 68 |
Success probability of the Hellman trade-off
|
Ma, Daegun
|
|
2009
|
|
7 |
p. 347-351
5 p.
|
artikel
|
| 69 |
Superiority of exact quantum automata for promise problems
|
Ambainis, Andris
|
|
2012
|
|
7 |
p. 289-291
3 p.
|
artikel
|
| 70 |
Testing whether the uniform distribution is a stationary distribution
|
Chakraborty, Sourav
|
|
2016
|
|
7 |
p. 475-480
6 p.
|
artikel
|
| 71 |
The indexing for one-dimensional proportionally-scaled strings
|
Peng, Yung-Hsing
|
|
2011
|
|
7 |
p. 318-322
5 p.
|
artikel
|
| 72 |
The NP-completeness of the Road Coloring Problem
|
Roman, Adam
|
|
2011
|
|
7 |
p. 342-347
6 p.
|
artikel
|
| 73 |
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
|
Hwang, Iksoon
|
|
2012
|
|
7 |
p. 298-301
4 p.
|
artikel
|
| 74 |
Towards optimal kernel for edge-disjoint triangle packing
|
Yang, Yongjie
|
|
2014
|
|
7 |
p. 344-348
5 p.
|
artikel
|
| 75 |
TrCBC: Another look at CBC-MAC
|
Zhang, Liting
|
|
2012
|
|
7 |
p. 302-307
6 p.
|
artikel
|
| 76 |
Using 5-isogenies to quintuple points on elliptic curves
|
Moody, Dustin
|
|
2011
|
|
7 |
p. 314-317
4 p.
|
artikel
|
Tijdschrift beschrijving