| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An improved security-aware packet scheduling algorithm in real-time wireless networks
|
Zhu, Xiaomin
|
|
2012
|
112 |
7 |
p. 282-288
7 p.
|
article
|
| 2 |
A note on randomized streaming space bounds for the longest increasing subsequence problem
|
Chakrabarti, Amit
|
|
2012
|
112 |
7 |
p. 261-263
3 p.
|
article
|
| 3 |
Automorphism groups of the Pancake graphs
|
Deng, Yun-Ping
|
|
2012
|
112 |
7 |
p. 264-266
3 p.
|
article
|
| 4 |
Colorful triangle counting and a MapReduce implementation
|
Pagh, Rasmus
|
|
2012
|
112 |
7 |
p. 277-281
5 p.
|
article
|
| 5 |
Editorial Board
|
|
|
2012
|
112 |
7 |
p. IFC-
1 p.
|
article
|
| 6 |
Exponential lower bound for bounded depth circuits with few threshold gates
|
Podolskii, Vladimir V.
|
|
2012
|
112 |
7 |
p. 267-271
5 p.
|
article
|
| 7 |
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
|
Li, Wenhua
|
|
2012
|
112 |
7 |
p. 292-297
6 p.
|
article
|
| 8 |
On the parameterized complexity of the repetition free longest common subsequence problem
|
Blin, Guillaume
|
|
2012
|
112 |
7 |
p. 272-276
5 p.
|
article
|
| 9 |
Superiority of exact quantum automata for promise problems
|
Ambainis, Andris
|
|
2012
|
112 |
7 |
p. 289-291
3 p.
|
article
|
| 10 |
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
|
112 |
7 |
p. 298-301
4 p.
|
article
|
| 11 |
TrCBC: Another look at CBC-MAC
|
Zhang, Liting
|
|
2012
|
112 |
7 |
p. 302-307
6 p.
|
article
|
Journal description