Jon M. Kleinberg

Cynthia Dwork

Commun. ACM, 2011

Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter.

[BibT_eX]

[DOI]

Daniel M. Romero

Brendan Meeder

Proceedings of the 20th International Conference on World Wide Web, 2011

Network bucket testing.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on World Wide Web, 2011

Predicting Reciprocity in Social Networks.

[BibT_eX]

[DOI]

Justin Cheng

Daniel Mauricio Romero

Brendan Meeder

Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Reconstructing Patterns of Information Diffusion from Incomplete Observations.

[BibT_eX]

[DOI]

Flavio Chierichetti

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Does Bad News Go Away Faster?

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

Maintaining Ties on Social Media Sites: The Competing Effects of Balance, Exchange, and Betweenness.

[BibT_eX]

[DOI]

Daniel Mauricio Romero

Brendan Meeder

Vladimir Barash

Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

Center of Attention: How Facebook Users Allocate Attention across Friends.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Weblogs and Social Media, 2011

Which Networks are Least Susceptible to Cascading Failures?

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Inferring social ties from geographic coincidences.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2010

Kronecker Graphs: An Approach to Modeling Networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2010

Information-Sharing and Privacy in Social Networks

[BibT_eX]

[DOI]

Katrina Ligett

CoRR, 2010

Predicting positive and negative links in online social networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on World Wide Web, 2010

The flow of on-line information in global networks.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Crowds, clouds, and algorithms: exploring the human side of "big data" applications.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter.

[BibT_eX]

[DOI]

Daniel Mauricio Romero

Proceedings of the Fourth International Conference on Weblogs and Social Media, 2010

Governance in Social Media: A Case Study of the Wikipedia Promotion Process.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Weblogs and Social Media, 2010

Sequential Influence Models in Social Networks.

[BibT_eX]

[DOI]

Dan Cosley

Xiangyang Lan

Siddharth Suri

Proceedings of the Fourth International Conference on Weblogs and Social Media, 2010

Signed networks in social media.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Human Factors in Computing Systems, 2010

Networks, Crowds, and Markets - Reasoning About a Highly Connected World.

[BibT_eX]

[DOI]

David A. Easley

Cambridge University Press, ISBN: 9780511761942, 2010

2009

Metric Embeddings with Relaxed Guarantees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Triangulation and embedding using small sets of beacons.

[BibT_eX]

[DOI]

Aleksandrs Slivkins

Tom Wexler

J. ACM, 2009

Trading networks with price-setting agents.

[BibT_eX]

[DOI]

Games Econ. Behav., 2009

Some results of Christos Papadimitriou on internet structure, network routing, and web information.

[BibT_eX]

[DOI]

Cristian Danescu-Niculescu-Mizil

Comput. Sci. Rev., 2009

Line-of-Sight Networks.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

How opinions are received by online communities: a case study on amazon.com helpfulness votes.

[BibT_eX]

[DOI]

Gueorgi Kossinets

Lillian Lee

Proceedings of the 18th International Conference on World Wide Web, 2009

Mapping the world's photos.

[BibT_eX]

[DOI]

David J. Crandall

Proceedings of the 18th International Conference on World Wide Web, 2009

Meme-tracking and the dynamics of the news cycle.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Optimizing web traffic via the media scheduling problem.

[BibT_eX]

[DOI]

Ravi Kumar

Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

2008

Strategic network formation with structural holes.

[BibT_eX]

[DOI]

SIGecom Exch., 2008

Network Failure Detection and Graph Connectivity.

[BibT_eX]

[DOI]

Mark Sandler

Aleksandrs Slivkins

SIAM J. Comput., 2008

Stability of Load Balancing Algorithms in Dynamic Adversarial Systems.

[BibT_eX]

[DOI]

Elliot Anshelevich

SIAM J. Comput., 2008

The Price of Stability for Network Design with Fair Cost Allocation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Tracing information flow on a global scale using Internet chain-letter data.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2008

Using mixture models for collaborative filtering.

[BibT_eX]

[DOI]

Mark Sandler

J. Comput. Syst. Sci., 2008

The convergence of social and technological networks.

[BibT_eX]

[DOI]

Commun. ACM, 2008

Spatial variation in search engine queries.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

Balanced outcomes in social exchange networks.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

The structure of information pathways in a social communication network.

[BibT_eX]

[DOI]

Gueorgi Kossinets

Duncan J. Watts

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Feedback effects between similarity and social influence in online communities.

[BibT_eX]

[DOI]

David J. Crandall

Dan Cosley

Siddharth Suri

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Link structures, information flow, and social processes.

[BibT_eX]

[DOI]

Proceedings of the HYPERTEXT 2008, 2008

A New Start: Innovative Introductory AI-Centered Courses at Cornell.

[BibT_eX]

[DOI]

Proceedings of the Using AI to Motivate Greater Participation in Computer Science, 2008

2007

Graph evolution: Densification and shrinking diameters.

[BibT_eX]

[DOI]

Christos Faloutsos

ACM Trans. Knowl. Discov. Data, 2007

The link-prediction problem for social networks.

[BibT_eX]

[DOI]

J. Assoc. Inf. Sci. Technol., 2007

The role of compatibility in the diffusion of technologies through social networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Challenges in mining social network data: processes, privacy, and paradoxes.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007

2006

Fairness Measures for Resource Allocation.

[BibT_eX]

[DOI]

Amit Kumar

SIAM J. Comput., 2006

Social networks, incentives, and search.

[BibT_eX]

[DOI]

Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

Distributed social systems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Patterns of Influence in a Recommendation Network.

[BibT_eX]

[DOI]

Ajit Singh

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

Group formation in large social networks: membership, growth, and evolution.

[BibT_eX]

[DOI]

Xiangyang Lan

Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

Near-optimal sensor placements: maximizing information while minimizing communication cost.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, 2006

Algorithm design.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-321-37291-8, 2006

2005

Isomorphism and embedding problems for infinite limits of scale-free graphs.

[BibT_eX]

[DOI]

Robert D. Kleinberg

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Discovery in Databases: PKDD 2005, 2005

Graphs over time: densification laws, shrinking diameters and possible explanations.

[BibT_eX]

[DOI]

Christos Faloutsos

Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Influential Nodes in a Diffusion Model for Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Query Incentive Networks.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

On Learning Mixtures of Heavy-Tailed Distributions.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Metric Embeddings with Relaxed Guarantees.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Minimizing Wirelength in Zero and Bounded Skew Clock Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Structural properties and tractability results for linear synteny.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

Segmentation problems.

[BibT_eX]

[DOI]

J. ACM, 2004

Spatial gossip and resource location protocols.

[BibT_eX]

[DOI]

Alan J. Demers

J. ACM, 2004

The evolutionary capacity of protein structures.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

2003

Overview of the 2003 KDD Cup.

[BibT_eX]

[DOI]

Johannes Gehrke

Paul Ginsparg

SIGKDD Explor., 2003

Auditing Boolean attributes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Detecting a Network Failure.

[BibT_eX]

[DOI]

Internet Math., 2003

Admission Control to Minimize Rejections.

[BibT_eX]

[DOI]

Avrim Blum

Adam Tauman Kalai

Internet Math., 2003

Bursty and Hierarchical Structure in Streams.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2003

Convergent algorithms for collaborative filtering.

[BibT_eX]

[DOI]

Mark Sandler

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis.

[BibT_eX]

[DOI]

Pedro F. Felzenszwalb

Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

2002

A deterministic (2-2/(k+1))<sup>n</sup> algorithm for k-SAT based on local search.

[BibT_eX]

[DOI]

Uwe Schöning

Theor. Comput. Sci., 2002

Connectivity and Inference Problems for Temporal Networks.

[BibT_eX]

[DOI]

Amit Kumar

J. Comput. Syst. Sci., 2002

Guest Editor's Foreword.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Query Strategies for Priced Information.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields.

[BibT_eX]

[DOI]

J. ACM, 2002

Constructing Comparative Genome Maps with Unresolved Marker Order.

[BibT_eX]

[DOI]

Debra Goldberg

Susan McCouch

Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

An Impossibility Theorem for Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

Information Networks, Link Analysis, and Temporal Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Protocols and Impossibility Results for Gossip-Based Communication Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Fairness in Routing and Load Balancing.

[BibT_eX]

[DOI]

Yuval Rabani

J. Comput. Syst. Sci., 2001

Wavelength Conversion in Optical Networks.

[BibT_eX]

[DOI]

Amit Kumar

J. Algorithms, 2001

Adversarial queuing theory.

[BibT_eX]

[DOI]

J. ACM, 2001

Universal-stability results and performance bounds for greedy contention-resolution protocols.

[BibT_eX]

[DOI]

Matthew Andrews

Baruch Awerbuch

Antonio Fernández

Frank Thomson Leighton

Zhiyong Liu

J. ACM, 2001

Provisioning a virtual private network: a network design problem for multicommodity flow.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Small-World Phenomena and the Dynamics of Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

2000

Clustering Categorical Data: An Approach Based on Dynamical Systems.

[BibT_eX]

[DOI]

David Gibson

VLDB J., 2000

Allocating Bandwidth for Bursty Connections.

[BibT_eX]

[DOI]

Yuval Rabani

SIAM J. Comput., 2000

Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout.

[BibT_eX]

[DOI]

Alok Aggarwal

David P. Williamson

SIAM J. Comput., 2000

The small-world phenomenon: an algorithmic perspective.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Random walks with "back buttons" (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Query strategies for priced information (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes.

[BibT_eX]

[DOI]

J. Comput. Biol., 1999

Fast Detection of Common Geometric Substructure in Proteins.

[BibT_eX]

[DOI]

L. Paul Chew

J. Comput. Biol., 1999

Authoritative Sources in a Hyperlinked Environment.

[BibT_eX]

[DOI]

J. ACM, 1999

Reconstructing a Three-Dimensional Model with Arbitrary Errors.

[BibT_eX]

[DOI]

Bonnie Berger

Frank Thomson Leighton

J. ACM, 1999

Hubs, authorities, and communities.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1999

Mining the Web's Link Structure.

[BibT_eX]

[DOI]

Computer, 1999

Applications of Linear Algebra in Information Retrieval and Hypertext Analysis.

[BibT_eX]

[DOI]

Andrew Tomkins

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

The Web as a Graph: Measurements, Models, and Methods.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover.

[BibT_eX]

[DOI]

Michel X. Goemans

SIAM J. Discret. Math., 1998

An improved approximation ratio for the minimum latency problem.

[BibT_eX]

[DOI]

Michel X. Goemans

Math. Program., 1998

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

A Microeconomic View of Data Mining.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 1998

Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.

[BibT_eX]

[DOI]

Comput. Networks, 1998

Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Inferring Web Communities from Link Topology.

[BibT_eX]

[DOI]

David Gibson

Proceedings of the HYPERTEXT '98. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space, 1998

1997

Geometric Pattern Matching Under Euclidean Motion.

[BibT_eX]

[DOI]

L. Paul Chew

Michael T. Goodrich

Dina Kravets

Comput. Geom., 1997

Two Algorithms for Nearest-Neighbor Search in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Storage Management for Evolving Databases.

[BibT_eX]

[DOI]

Rajeev Motwani

Suresh Venkatasubramanian

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Approximation algorithms for disjoint paths problems.

[BibT_eX]

[DOI]

PhD thesis, 1996

Adversarial Queueing Theory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Short Paths in Expander Graphs.

[BibT_eX]

[DOI]

Ronitt Rubinfeld

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Single-Source Unsplittable Flow.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Universal Stability Results for Greedy Contention-Resolution Protocols.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Zhiyong Liu

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Geometric Two-Server Algorithms.

[BibT_eX]

[DOI]

Ran El-Yaniv

Inf. Process. Lett., 1995

Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report).

[BibT_eX]

[DOI]

Hagit Attiya

Nancy A. Lynch

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Disjoint Paths in Densely Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

A Lower Bound for Two-Server Balancing Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

On-line Search in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Comparing Point Sets Under Projection.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

The Localization Problem for Mobile Robots

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Resource Bounds and Combinations of Consensus Objects.

[BibT_eX]

[DOI]

Sendhil Mullainathan

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Voronoi Diagrams of Rigidly Moving Sets of Points.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane.

[BibT_eX]

[DOI]