Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Alessandro Mei
and
Rizzi, R.
2006.
Online Permutation Routing in Partitioned Optical Passive Star Networks.
IEEE Transactions on Computers,
Vol. 55,
Issue. 12,
p.
1557.
Chierichetti, Flavio
Kum, Ravi
Lattanzi, Silvio
Panconesi, Alessandro
and
Raghavan, Prabhakar
2009.
Models for the Compressible Web.
p.
331.
Chierichetti, Flavio
Lattanzi, Silvio
and
Panconesi, Alessandro
2009.
Automata, Languages and Programming.
Vol. 5556,
Issue. ,
p.
375.
Fountoulakis, Nikolaos
and
Panagiotou, Konstantinos
2010.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 6302,
Issue. ,
p.
560.
Dey, Bikash Kumar
Jaggi, Sidharth
Langberg, Michael
and
Sarwate, Anand D.
2010.
Coding against delayed adversaries.
p.
285.
Panconesi, Alessandro
and
Sozio, Mauro
2010.
Fast primal-dual distributed algorithms for scheduling and matching problems.
Distributed Computing,
Vol. 22,
Issue. 4,
p.
269.
McGregor, Andrew
Mironov, Ilya
Pitassi, Toniann
Reingold, Omer
Talwar, Kunal
and
Vadhan, Salil
2010.
The Limits of Two-Party Differential Privacy.
p.
81.
Reshef, David N.
Reshef, Yakir A.
Finucane, Hilary K.
Grossman, Sharon R.
McVean, Gilean
Turnbaugh, Peter J.
Lander, Eric S.
Mitzenmacher, Michael
and
Sabeti, Pardis C.
2011.
Detecting Novel Associations in Large Data Sets.
Science,
Vol. 334,
Issue. 6062,
p.
1518.
Celis, L. Elisa
Reingold, Omer
Segev, Gil
and
Wieder, Udi
2011.
Balls and Bins: Smaller Hash Families and Faster Evaluation.
p.
599.
Yagan, Osman
and
Makowski, Armand M.
2011.
On the resiliency of sensor networks under the pairwise key distribution scheme.
p.
1218.
DasGupta, Anirban
2011.
Probability for Statistics and Machine Learning.
p.
559.
Gross, David
2011.
Recovering Low-Rank Matrices From Few Coefficients in Any Basis.
IEEE Transactions on Information Theory,
Vol. 57,
Issue. 3,
p.
1548.
Li, Angsheng
and
Peng, Pan
2011.
Community Structures in Classical Network Models.
Internet Mathematics,
Vol. 7,
Issue. 2,
p.
81.
Ding, Bolin
and
König, Arnd Christian
2011.
Fast set intersection in memory.
Proceedings of the VLDB Endowment,
Vol. 4,
Issue. 4,
p.
255.
Brown, Daniel G.
and
Truszkowski, Jakub
2011.
Combinatorial Pattern Matching.
Vol. 6661,
Issue. ,
p.
147.
Karaman, Sertac
and
Frazzoli, Emilio
2011.
Sampling-based algorithms for optimal motion planning.
The International Journal of Robotics Research,
Vol. 30,
Issue. 7,
p.
846.
Kanoria, Yashodhan
and
Montanari, Andrea
2011.
Subexponential convergence for information aggregation on regular trees.
p.
5317.
Gupta, Anupam
Hardt, Moritz
Roth, Aaron
and
Ullman, Jonathan
2011.
Privately releasing conjunctions and the statistical query barrier.
p.
803.
Sason, Igal
and
Eshel, Ronen
2011.
On concentration of measures for LDPC code ensembles.
p.
1268.
Foss, Andrew
and
Zaïane, Osmar R.
2011.
Class separation through variance: a new application of outlier detection.
Knowledge and Information Systems,
Vol. 29,
Issue. 3,
p.
565.