|
|
|
|
|
|
Date Reviewed |
|
|
1 - 10 of 62
reviews
|
|
|
|
|
|
|
|
Wherefore art thou R3579X?: Anonymized social networks, hidden patterns, and structural steganography Backstrom L., Dwork C., Kleinberg J. Communications of the ACM 54(12): 133-141, 2011. Type: Article
This paper presents an extremely interesting informal review of recent work on discovering graph structures in social networks. The principal theme is that information about members in a social network can be obtained with relatively l...
|
Mar 14 2012 |
|
|
|
|
|
|
Deterministic extraction from weak random sources Gabizon A., Springer-Verlag New York, Inc., New York, NY, 2010. 148 pp. Type: Book (978-3-642149-02-3)
Before sketching important elements of this book, it may be useful to potential readers for me to make a few general observations. This monograph is in the European Association for Theoretical Computer Science (EATCS) monograph series....
|
Nov 17 2011 |
|
|
|
|
|
|
Polylogarithmic independence fools AC0 circuits Braverman M. Journal of the ACM 57(5): 1-10, 2010. Type: Article
A probability distribution μ on {0,1}n (n-dimensional hypercube) is said to be r-independent if every restriction of μ
|
Jan 26 2011 |
|
|
|
|
|
|
Measuring channel capacity to distinguish undue influence Newsome J., McCamant S., Song D. PLAS 2009 (Proceedings of the ACM SIGPLAN 4th Workshop on Programming Languages and Analysis for Security, Dublin, Ireland, Jun 15-21, 2009) 73-85, 2009. Type: Proceedings
A taint analysis method for small program sections, based not on the size of the set of inputs to an output variable (numeric) but on the size of the set of possible output values of that variable, is introduced in this paper. More pre...
|
Aug 3 2010 |
|
|
|
|
|
|
Algebraic cryptanalysis Bard G., Springer Publishing Company, Incorporated, New York, NY, 2009. 392 pp. Type: Book (9780387887562)
Algebraic cryptanalysis is a well-titled book. The theme is the reduction of attacks on ciphers (cryptosystems) to systems of polynomial equations over finite fields and subsequent heuristics for efficiently solving these system...
|
Apr 13 2010 |
|
|
|
|
|
|
Low-dimensional lattice basis reduction revisited Nguyen P., Stehlé D. ACM Transactions on Algorithms 5(4): 1-48, 2009. Type: Article
This paper gives an extremely detailed account of a greedy lattice reduction algorithm and its complexity analysis up to dimension four. It also studies failure of the algorithm starting at dimension five. For a general perspective on ...
|
Feb 1 2010 |
|
|
|
|
|
|
Fundamental problems in computing: essays in honor of Professor Daniel J. Rosenkrantz Ravi S. (ed), Shukla S. (ed), Springer Publishing Company, Incorporated, Dordrecht, Netherlands, 2009. 518 pp. Type: Book (9781402096877)
This festschrift honors the computer scientist Daniel Rosenkrantz. It is a bipartite book: Part 1 (chapters 1 to 10) comprises ten papers by Rosenkrantz and some of his colleagues, spanning from 1967 to 2008; Part 2 (chapters 11 to 18)...
|
Sep 23 2009 |
|
|
|
|
|
|
Non-cooperative tree creation Hoefer M. Algorithmica 53(1): 104-131, 2009. Type: Article
This paper contributes to the application of game theory to network design. The objective is to investigate the extent to which useful connected subnetworks can be constructed on, say, the Internet, by selfish participants. Hoefer defi...
|
Jun 16 2009 |
|
|
|
|
|
|
On rational stochastic languages Denis F., Esposito Y. Fundamenta Informaticae 86(1,2): 41-77, 2008. Type: Article
This paper presents a series of interrelated results on classes of formal power series that are generated by various types of weighted finite automata. In the early 1960s, Schützenberger initiated the idea of studying rational...
|
Jun 5 2009 |
|
|
|
|
|
|
On an infinite family of solvable Hanoi graphs Azriel D., Solomon N., Solomon S. ACM Transactions on Algorithms 5(1): 1-22, 2008. Type: Article
An extension of the well-known Towers of Hanoi puzzle--a fixture in introducing recursive algorithms in programming--is explained in this paper....
|
Apr 9 2009 |
|
|
|
|
|
|
|
|
|
|
|