| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A COTS-based approach for estimating performance and energy consumption of embedded real-time systems
|
Andrade, Ermeson
|
|
2010
|
|
14-15 |
p. 525-534
10 p.
|
artikel
|
| 2 |
A faster algorithm for the computation of string convolutions using LZ78 parsing
|
Freschi, Valerio
|
|
2010
|
|
14-15 |
p. 609-613
5 p.
|
artikel
|
| 3 |
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
|
Šparl, Petra
|
|
2012
|
|
14-15 |
p. 567-571
5 p.
|
artikel
|
| 4 |
A lower bound on the size of resolution proofs of the Ramsey theorem
|
Pudlák, Pavel
|
|
2012
|
|
14-15 |
p. 610-611
2 p.
|
artikel
|
| 5 |
An alternate proof of Statmanʼs finite completeness theorem
|
Srivathsan, B.
|
|
2012
|
|
14-15 |
p. 612-616
5 p.
|
artikel
|
| 6 |
An efficient algorithm to find k-nearest neighbors in flocking behavior
|
Lee, Jae Moon
|
|
2010
|
|
14-15 |
p. 576-579
4 p.
|
artikel
|
| 7 |
Collisions for variants of the BLAKE hash function
|
Vidali, Janoš
|
|
2010
|
|
14-15 |
p. 585-590
6 p.
|
artikel
|
| 8 |
Cyclically repetition-free words on small alphabets
|
Harju, Tero
|
|
2010
|
|
14-15 |
p. 591-595
5 p.
|
artikel
|
| 9 |
Deadlock-freeness of hexagonal systolic arrays
|
Gruner, S.
|
|
2010
|
|
14-15 |
p. 539-543
5 p.
|
artikel
|
| 10 |
Determining a singleton attractor of an AND/OR Boolean network in O ( 1.587 n ) time
|
Melkman, Avraham A.
|
|
2010
|
|
14-15 |
p. 565-569
5 p.
|
artikel
|
| 11 |
Editorial Board
|
|
|
2010
|
|
14-15 |
p. IFC-
1 p.
|
artikel
|
| 12 |
Editorial Board
|
|
|
2012
|
|
14-15 |
p. IFC-
1 p.
|
artikel
|
| 13 |
Efficient computation of shortest absent words in a genomic sequence
|
Wu, Zong-Da
|
|
2010
|
|
14-15 |
p. 596-601
6 p.
|
artikel
|
| 14 |
Efficient implementation of the Galois Counter Mode using a carry-less multiplier and a fast reduction algorithm
|
Gueron, Shay
|
|
2010
|
|
14-15 |
p. 549-553
5 p.
|
artikel
|
| 15 |
Efficient inclusion testing for simple classes of unambiguous ω-automata
|
Isaak, Dimitri
|
|
2012
|
|
14-15 |
p. 578-582
5 p.
|
artikel
|
| 16 |
Embedding a mesh of trees in the crossed cube
|
Dong, Qiang
|
|
2012
|
|
14-15 |
p. 599-603
5 p.
|
artikel
|
| 17 |
Embedding meshes/tori in faulty crossed cubes
|
Yang, Xiaofan
|
|
2010
|
|
14-15 |
p. 559-564
6 p.
|
artikel
|
| 18 |
Enumeration of balanced symmetric functions over GF ( p )
|
Fu, Shaojing
|
|
2010
|
|
14-15 |
p. 544-548
5 p.
|
artikel
|
| 19 |
Fault-tolerant routing in burnt pancake graphs
|
Iwasaki, Tatsuya
|
|
2010
|
|
14-15 |
p. 535-538
4 p.
|
artikel
|
| 20 |
Finding minimum 3-way cuts in hypergraphs
|
Xiao, Mingyu
|
|
2010
|
|
14-15 |
p. 554-558
5 p.
|
artikel
|
| 21 |
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
|
Du, Xiaoni
|
|
2012
|
|
14-15 |
p. 604-609
6 p.
|
artikel
|
| 22 |
Log ′ version vector: Logging version vectors concisely in dynamic replication
|
Roh, Hyun-Gul
|
|
2010
|
|
14-15 |
p. 614-620
7 p.
|
artikel
|
| 23 |
Many-to-many n-disjoint path covers in n-dimensional hypercubes
|
Liu, Di
|
|
2010
|
|
14-15 |
p. 580-584
5 p.
|
artikel
|
| 24 |
Minimum wirelength of hypercubes into n-dimensional grid networks
|
Rajasingh, Indra
|
|
2012
|
|
14-15 |
p. 583-586
4 p.
|
artikel
|
| 25 |
One-round identity-based key exchange with Perfect Forward Security
|
Xie, Min
|
|
2012
|
|
14-15 |
p. 587-591
5 p.
|
artikel
|
| 26 |
On multi-head automata with restricted nondeterminism
|
Reidenbach, Daniel
|
|
2012
|
|
14-15 |
p. 572-577
6 p.
|
artikel
|
| 27 |
On two restricted ancestors tree problems
|
Guttmann-Beck, Nili
|
|
2010
|
|
14-15 |
p. 570-575
6 p.
|
artikel
|
| 28 |
Preimage resistance of LP m k r with r = m − 1
|
Lee, Jooyoung
|
|
2010
|
|
14-15 |
p. 602-608
7 p.
|
artikel
|
| 29 |
Regular set of representatives for time-constrained MSC graphs
|
Akshay, S.
|
|
2012
|
|
14-15 |
p. 592-598
7 p.
|
artikel
|
Tijdschrift beschrijving