Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

TCC
2005
Springer

favoriteEmaildiscussreport

101views Cryptology» more TCC 2005»

Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs

14 years 4 months ago

Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs

Download people.csail.mit.edu

Moni Naor, Asaf Nussboim, Eran Tromer

Real-time Traffic

Cryptography | TCC 2005 |

claim paper

Related Content

» Fast Random Walk with Restart and Its Applications

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

» Measuring the mixing time of social graphs

» Incremental Samplingbased Algorithms for Optimal Motion Planning

» Ant Colony Optimization for Model Checking

» Brief Announcement Universal Data Aggregation Trees for Sensor Networks in Low Doubling Me...

» FROSTY A Fast Hierarchy Extractor for Industrial CMOS Circuits

» Metropolis light transport

» Hierarchical Eigensolver for Transition Matrices in Spectral Methods

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	TCC
Authors	Moni Naor, Asaf Nussboim, Eran Tromer

Comments (0)