| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An extension of TYT inversion algorithm in polynomial basis
|
Li, Yin
|
|
2010
|
|
8-9 |
p. 300-303
4 p.
|
article
|
| 2 |
An improved algorithm for sorting by block-interchanges based on permutation groups
|
Huang, Yen-Lin
|
|
2010
|
|
8-9 |
p. 345-350
6 p.
|
article
|
| 3 |
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
|
Tao, Jiping
|
|
2010
|
|
8-9 |
p. 325-330
6 p.
|
article
|
| 4 |
Approximation algorithms for the Bipartite Multicut problem
|
Kenkre, Sreyash
|
|
2010
|
|
8-9 |
p. 282-287
6 p.
|
article
|
| 5 |
Bicolored independent sets and bicliques
|
Couturier, Jean-François
|
|
2012
|
|
8-9 |
p. 329-334
6 p.
|
article
|
| 6 |
Cores of random r-partite hypergraphs
|
Botelho, Fabiano C.
|
|
2012
|
|
8-9 |
p. 314-319
6 p.
|
article
|
| 7 |
Cryptanalysis of RSA with more than one decryption exponent
|
Sarkar, Santanu
|
|
2010
|
|
8-9 |
p. 336-340
5 p.
|
article
|
| 8 |
Editorial Board
|
|
|
2010
|
|
8-9 |
p. IFC-
1 p.
|
article
|
| 9 |
Editorial Board
|
|
|
2012
|
|
8-9 |
p. IFC-
1 p.
|
article
|
| 10 |
Fast equality test for straight-line compressed strings
|
Schmidt-Schauß, Manfred
|
|
2012
|
|
8-9 |
p. 341-345
5 p.
|
article
|
| 11 |
Hardness and approximation of minimum distortion embeddings
|
Heggernes, Pinar
|
|
2010
|
|
8-9 |
p. 312-316
5 p.
|
article
|
| 12 |
Highly connected molecular graphs are rigid in three dimensions
|
Jordán, Tibor
|
|
2012
|
|
8-9 |
p. 356-359
4 p.
|
article
|
| 13 |
Model checking probabilistic systems against pushdown specifications
|
Dubslaff, Clemens
|
|
2012
|
|
8-9 |
p. 320-328
9 p.
|
article
|
| 14 |
New common ancestor problems in trees and directed acyclic graphs
|
Fischer, Johannes
|
|
2010
|
|
8-9 |
p. 331-335
5 p.
|
article
|
| 15 |
One-inclusion hypergraph density revisited
|
Simon, Hans Ulrich
|
|
2010
|
|
8-9 |
p. 341-344
4 p.
|
article
|
| 16 |
Price of anarchy in parallel processing
|
Yu, Lingfei
|
|
2010
|
|
8-9 |
p. 288-293
6 p.
|
article
|
| 17 |
Randomized load balancing by joining and splitting bins
|
Aspnes, James
|
|
2012
|
|
8-9 |
p. 309-313
5 p.
|
article
|
| 18 |
Scalable real-time monitoring system for ubiquitous smart space
|
Lee, Byoung-Hoon
|
|
2010
|
|
8-9 |
p. 294-299
6 p.
|
article
|
| 19 |
Short proofs for online multiclass prediction on graphs
|
Fakcharoenphol, Jittat
|
|
2010
|
|
8-9 |
p. 309-311
3 p.
|
article
|
| 20 |
Squeeziness: An information theoretic measure for avoiding fault masking
|
Clark, David
|
|
2012
|
|
8-9 |
p. 335-340
6 p.
|
article
|
| 21 |
The effects of the omission of last round's MixColumns on AES
|
Dunkelman, Orr
|
|
2010
|
|
8-9 |
p. 304-308
5 p.
|
article
|
| 22 |
The Floyd–Warshall algorithm on graphs with negative cycles
|
Hougardy, Stefan
|
|
2010
|
|
8-9 |
p. 279-281
3 p.
|
article
|
| 23 |
The tensor product of two good codes is not necessarily robustly testable
|
Goldreich, Oded
|
|
2012
|
|
8-9 |
p. 351-355
5 p.
|
article
|
| 24 |
Total coloring of planar graphs of maximum degree eight
|
Roussel, Nicolas
|
|
2010
|
|
8-9 |
p. 321-324
4 p.
|
article
|
| 25 |
Universal point sets for 2-coloured trees
|
van Garderen, Mereke
|
|
2012
|
|
8-9 |
p. 346-350
5 p.
|
article
|
| 26 |
Wee LCP
|
Fischer, Johannes
|
|
2010
|
|
8-9 |
p. 317-320
4 p.
|
article
|
Journal description