Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Reid Andersen
@article{DBLP:journals/corr/abs-2403-12173,
author = {Mengting Wan and
Tara Safavi and
Sujay Kumar Jauhar and
Yujin Kim and
Scott Counts and
Jennifer Neville and
Siddharth Suri and
Chirag Shah and
Ryen W. White and
Longqi Yang and
Reid Andersen and
Georg Buscher and
Dhruv Joshi and
Nagu Rangan},
title = {TnT-LLM: Text Mining at Scale with Large Language Models},
journal = {CoRR},
volume = {abs/2403.12173},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.12173},
doi = {10.48550/ARXIV.2403.12173},
eprinttype = {arXiv},
eprint = {2403.12173},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-12173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-12388,
author = {Ying{-}Chun Lin and
Jennifer Neville and
Jack W. Stokes and
Longqi Yang and
Tara Safavi and
Mengting Wan and
Scott Counts and
Siddharth Suri and
Reid Andersen and
Xiaofeng Xu and
Deepak Gupta and
Sujay Kumar Jauhar and
Xia Song and
Georg Buscher and
Saurabh Tiwary and
Brent J. Hecht and
Jaime Teevan},
title = {Interpretable User Satisfaction Estimation for Conversational Systems
with Large Language Models},
journal = {CoRR},
volume = {abs/2403.12388},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.12388},
doi = {10.48550/ARXIV.2403.12388},
eprinttype = {arXiv},
eprint = {2403.12388},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-12388.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-08827,
author = {Sarkar Snigdha Sarathi Das and
Chirag Shah and
Mengting Wan and
Jennifer Neville and
Longqi Yang and
Reid Andersen and
Georg Buscher and
Tara Safavi},
title = {{S3-DST:} Structured Open-Domain Dialogue Segmentation and State Tracking
in the Era of LLMs},
journal = {CoRR},
volume = {abs/2309.08827},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.08827},
doi = {10.48550/ARXIV.2309.08827},
eprinttype = {arXiv},
eprint = {2309.08827},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-08827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-13063,
author = {Chirag Shah and
Ryen W. White and
Reid Andersen and
Georg Buscher and
Scott Counts and
Sarkar Snigdha Sarathi Das and
Ali Montazer and
Sathish Manivannan and
Jennifer Neville and
Xiaochuan Ni and
Nagu Rangan and
Tara Safavi and
Siddharth Suri and
Mengting Wan and
Leijie Wang and
Longqi Yang},
title = {Using Large Language Models to Generate, Validate, and Apply User
Intent Taxonomies},
journal = {CoRR},
volume = {abs/2309.13063},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.13063},
doi = {10.48550/ARXIV.2309.13063},
eprinttype = {arXiv},
eprint = {2309.13063},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-13063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndersenGPT16,
author = {Reid Andersen and
Shayan Oveis Gharan and
Yuval Peres and
Luca Trevisan},
title = {Almost Optimal Local Graph Clustering Using Evolving Sets},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {15:1--15:31},
year = {2016},
url = {https://doi.org/10.1145/2856030},
doi = {10.1145/2856030},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndersenGPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/AndersenGM12,
author = {Reid Andersen and
David F. Gleich and
Vahab S. Mirrokni},
editor = {Eytan Adar and
Jaime Teevan and
Eugene Agichtein and
Yoelle Maarek},
title = {Overlapping clusters for distributed computation},
booktitle = {Proceedings of the Fifth International Conference on Web Search and
Web Data Mining, {WSDM} 2012, Seattle, WA, USA, February 8-12, 2012},
pages = {273--282},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2124295.2124330},
doi = {10.1145/2124295.2124330},
timestamp = {Tue, 21 May 2019 11:38:33 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/AndersenGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Andersen10,
author = {Reid Andersen},
title = {A local algorithm for finding dense subgraphs},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {4},
pages = {60:1--60:12},
year = {2010},
url = {https://doi.org/10.1145/1824777.1824780},
doi = {10.1145/1824777.1824780},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Andersen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/leet/StokesASC10,
author = {Jack W. Stokes and
Reid Andersen and
Christian Seifert and
Kumar Chellapilla},
editor = {Michael D. Bailey},
title = {WebCop: Locating Neighborhoods of Malware on the Web},
booktitle = {3rd {USENIX} Workshop on Large-Scale Exploits and Emergent Threats,
{LEET} '10, San Jose, CA, USA, April 27, 2010},
publisher = {{USENIX} Association},
year = {2010},
url = {https://www.usenix.org/conference/leet-10/webcop-locating-neighborhoods-malware-web},
timestamp = {Mon, 20 Nov 2023 09:09:49 +0100},
biburl = {https://dblp.org/rec/conf/leet/StokesASC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/KarandeCA09,
author = {Chinmay Karande and
Kumar Chellapilla and
Reid Andersen},
title = {Speeding Up Algorithms on Compressed Web Graphs},
journal = {Internet Math.},
volume = {6},
number = {3},
pages = {373--398},
year = {2009},
url = {https://doi.org/10.1080/15427951.2009.10390646},
doi = {10.1080/15427951.2009.10390646},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/KarandeCA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AndersenP09,
author = {Reid Andersen and
Yuval Peres},
editor = {Michael Mitzenmacher},
title = {Finding sparse cuts locally using evolving sets},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {235--244},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536449},
doi = {10.1145/1536414.1536449},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AndersenP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/AndersenC09,
author = {Reid Andersen and
Kumar Chellapilla},
editor = {Konstantin Avrachenkov and
Debora Donato and
Nelly Litvak},
title = {Finding Dense Subgraphs with Size Bounds},
booktitle = {Algorithms and Models for the Web-Graph, 6th International Workshop,
{WAW} 2009, Barcelona, Spain, February 12-13, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5427},
pages = {25--37},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-95995-3\_3},
doi = {10.1007/978-3-540-95995-3\_3},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/waw/AndersenC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/KarandeCA09,
author = {Chinmay Karande and
Kumar Chellapilla and
Reid Andersen},
editor = {Ricardo Baeza{-}Yates and
Paolo Boldi and
Berthier A. Ribeiro{-}Neto and
Berkant Barla Cambazoglu},
title = {Speeding up algorithms on compressed web graphs},
booktitle = {Proceedings of the Second International Conference on Web Search and
Web Data Mining, {WSDM} 2009, Barcelona, Spain, February 9-11, 2009},
pages = {272--281},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1498759.1498836},
doi = {10.1145/1498759.1498836},
timestamp = {Sun, 22 Sep 2019 18:15:38 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/KarandeCA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-3631,
author = {Reid Andersen and
Uriel Feige},
title = {Interchanging distance and capacity in probabilistic mappings},
journal = {CoRR},
volume = {abs/0907.3631},
year = {2009},
url = {http://arxiv.org/abs/0907.3631},
eprinttype = {arXiv},
eprint = {0907.3631},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-3631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/AndersenCL08,
author = {Reid Andersen and
Fan R. K. Chung and
Kevin J. Lang},
title = {Local Partitioning for Directed Graphs Using PageRank},
journal = {Internet Math.},
volume = {5},
number = {1},
pages = {3--22},
year = {2008},
url = {https://doi.org/10.1080/15427951.2008.10129297},
doi = {10.1080/15427951.2008.10129297},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/AndersenCL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/AndersenBCHMT08,
author = {Reid Andersen and
Christian Borgs and
Jennifer T. Chayes and
John E. Hopcroft and
Vahab S. Mirrokni and
Shang{-}Hua Teng},
title = {Local Computation of PageRank Contributions},
journal = {Internet Math.},
volume = {5},
number = {1},
pages = {23--45},
year = {2008},
url = {https://doi.org/10.1080/15427951.2008.10129302},
doi = {10.1080/15427951.2008.10129302},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/im/AndersenBCHMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/airweb/AndersenBCHJMT08,
author = {Reid Andersen and
Christian Borgs and
Jennifer T. Chayes and
John E. Hopcroft and
Kamal Jain and
Vahab S. Mirrokni and
Shang{-}Hua Teng},
editor = {Carlos Castillo and
Kumar Chellapilla and
Dennis Fetterly},
title = {Robust PageRank and locally computable spam detection features},
booktitle = {AIRWeb 2008, Fourth International Workshop on Adversarial Information
Retrieval on the Web, Beijing, China, April 22, 2008},
series = {{ACM} International Conference Proceeding Series},
pages = {69--76},
year = {2008},
url = {https://doi.org/10.1145/1451983.1452000},
doi = {10.1145/1451983.1452000},
timestamp = {Mon, 14 Feb 2022 15:02:37 +0100},
biburl = {https://dblp.org/rec/conf/airweb/AndersenBCHJMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AndersenBCHMT08,
author = {Reid Andersen and
Christian Borgs and
Jennifer T. Chayes and
John E. Hopcroft and
Vahab S. Mirrokni and
Shang{-}Hua Teng},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {On the Stability of Web Crawling and Web Search},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {680--691},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_60},
doi = {10.1007/978-3-540-92182-0\_60},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AndersenBCHMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AndersenL08,
author = {Reid Andersen and
Kevin J. Lang},
editor = {Shang{-}Hua Teng},
title = {An algorithm for improving graph partitions},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {651--660},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347154},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AndersenL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Andersen08,
author = {Reid Andersen},
editor = {Shang{-}Hua Teng},
title = {A local algorithm for finding dense subgraphs},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1003--1009},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347192},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Andersen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/AndersenBCFFKMT08,
author = {Reid Andersen and
Christian Borgs and
Jennifer T. Chayes and
Uriel Feige and
Abraham D. Flaxman and
Adam Kalai and
Vahab S. Mirrokni and
Moshe Tennenholtz},
editor = {Jinpeng Huai and
Robin Chen and
Hsiao{-}Wuen Hon and
Yunhao Liu and
Wei{-}Ying Ma and
Andrew Tomkins and
Xiaodong Zhang},
title = {Trust-based recommendation systems: an axiomatic approach},
booktitle = {Proceedings of the 17th International Conference on World Wide Web,
{WWW} 2008, Beijing, China, April 21-25, 2008},
pages = {199--208},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1367497.1367525},
doi = {10.1145/1367497.1367525},
timestamp = {Tue, 20 Dec 2022 21:20:03 +0100},
biburl = {https://dblp.org/rec/conf/www/AndersenBCFFKMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3779,
author = {Reid Andersen and
Yuval Peres},
title = {Finding Sparse Cuts Locally Using Evolving Sets},
journal = {CoRR},
volume = {abs/0811.3779},
year = {2008},
url = {http://arxiv.org/abs/0811.3779},
eprinttype = {arXiv},
eprint = {0811.3779},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-3779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndersenCL07,
author = {Reid Andersen and
Fan R. K. Chung and
Linyuan Lu},
title = {No-Three-in-Line-in-3D},
journal = {Algorithmica},
volume = {47},
number = {4},
pages = {379--397},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0160-2},
doi = {10.1007/S00453-006-0160-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndersenCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndersenCL07a,
author = {Reid Andersen and
Fan R. K. Chung and
Linyuan Lu},
title = {Drawing Power Law Graphs Using a Local/Global Decomposition},
journal = {Algorithmica},
volume = {47},
number = {4},
pages = {397},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-3160-3},
doi = {10.1007/S00453-006-3160-3},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndersenCL07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/AndersenCL07,
author = {Reid Andersen and
Fan R. K. Chung and
Kevin J. Lang},
title = {Using PageRank to Locally Partition a Graph},
journal = {Internet Math.},
volume = {4},
number = {1},
pages = {35--64},
year = {2007},
url = {https://doi.org/10.1080/15427951.2007.10129139},
doi = {10.1080/15427951.2007.10129139},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/AndersenCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/AndersenC07,
author = {Reid Andersen and
Sebastian M. Cioaba},
title = {Spectral Densest Subgraph and Independence Number of a Graph},
journal = {J. Univers. Comput. Sci.},
volume = {13},
number = {11},
pages = {1501--1513},
year = {2007},
url = {https://doi.org/10.3217/jucs-013-11-1501},
doi = {10.3217/JUCS-013-11-1501},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/AndersenC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/LangA07,
author = {Kevin J. Lang and
Reid Andersen},
editor = {M{\'{a}}rio J. Silva and
Alberto H. F. Laender and
Ricardo A. Baeza{-}Yates and
Deborah L. McGuinness and
Bj{\o}rn Olstad and
{\O}ystein Haug Olsen and
Andr{\'{e}} O. Falc{\~{a}}o},
title = {Finding dense and isolated submarkets in a sponsored search spending
graph},
booktitle = {Proceedings of the Sixteenth {ACM} Conference on Information and Knowledge
Management, {CIKM} 2007, Lisbon, Portugal, November 6-10, 2007},
pages = {613--622},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1321440.1321526},
doi = {10.1145/1321440.1321526},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cikm/LangA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/AndersenC07,
author = {Reid Andersen and
Fan R. K. Chung},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Hong Zhu},
title = {Detecting Sharp Drops in PageRank and a Simplified Local Partitioning
Algorithm},
booktitle = {Theory and Applications of Models of Computation, 4th International
Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4484},
pages = {1--12},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72504-6\_1},
doi = {10.1007/978-3-540-72504-6\_1},
timestamp = {Mon, 04 May 2020 13:17:48 +0200},
biburl = {https://dblp.org/rec/conf/tamc/AndersenC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/AndersenBCHMT07,
author = {Reid Andersen and
Christian Borgs and
Jennifer T. Chayes and
John E. Hopcroft and
Vahab S. Mirrokni and
Shang{-}Hua Teng},
editor = {Anthony Bonato and
Fan R. K. Chung},
title = {Local Computation of PageRank Contributions},
booktitle = {Algorithms and Models for the Web-Graph, 5th International Workshop,
{WAW} 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4863},
pages = {150--165},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77004-6\_12},
doi = {10.1007/978-3-540-77004-6\_12},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waw/AndersenBCHMT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/AndersenCL07,
author = {Reid Andersen and
Fan R. K. Chung and
Kevin J. Lang},
editor = {Anthony Bonato and
Fan R. K. Chung},
title = {Local Partitioning for Directed Graphs Using PageRank},
booktitle = {Algorithms and Models for the Web-Graph, 5th International Workshop,
{WAW} 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4863},
pages = {166--178},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77004-6\_13},
doi = {10.1007/978-3-540-77004-6\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waw/AndersenCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702032,
author = {Reid Andersen},
title = {Finding large and small dense subgraphs},
journal = {CoRR},
volume = {abs/cs/0702032},
year = {2007},
url = {http://arxiv.org/abs/cs/0702032},
eprinttype = {arXiv},
eprint = {cs/0702032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702078,
author = {Reid Andersen},
title = {A Local Algorithm for Finding Dense Subgraphs},
journal = {CoRR},
volume = {abs/cs/0702078},
year = {2007},
url = {http://arxiv.org/abs/cs/0702078},
eprinttype = {arXiv},
eprint = {cs/0702078},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndersenCL06,
author = {Reid Andersen and
Fan R. K. Chung and
Kevin J. Lang},
title = {Local Graph Partitioning using PageRank Vectors},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {475--486},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.44},
doi = {10.1109/FOCS.2006.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndersenCL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/AndersenL06,
author = {Reid Andersen and
Kevin J. Lang},
editor = {Les Carr and
David De Roure and
Arun Iyengar and
Carole A. Goble and
Michael Dahlin},
title = {Communities from seed sets},
booktitle = {Proceedings of the 15th international conference on World Wide Web,
{WWW} 2006, Edinburgh, Scotland, UK, May 23-26, 2006},
pages = {223--232},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1135777.1135814},
doi = {10.1145/1135777.1135814},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/www/AndersenL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/AndersenCL05,
author = {Reid Andersen and
Fan R. K. Chung and
Linyuan Lu},
title = {Modeling the Small-World Phenomenon with Local Network Flow},
journal = {Internet Math.},
volume = {2},
number = {3},
pages = {359--385},
year = {2005},
url = {https://doi.org/10.1080/15427951.2005.10129109},
doi = {10.1080/15427951.2005.10129109},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/AndersenCL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/AndersenCL04,
author = {Reid Andersen and
Fan R. K. Chung and
Lincoln Lu},
editor = {J{\'{a}}nos Pach},
title = {Drawing Power Law Graphs},
booktitle = {Graph Drawing, 12th International Symposium, {GD} 2004, New York,
NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3383},
pages = {12--17},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31843-9\_2},
doi = {10.1007/978-3-540-31843-9\_2},
timestamp = {Sun, 13 Nov 2022 09:57:33 +0100},
biburl = {https://dblp.org/rec/conf/gd/AndersenCL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/AndersenCSX04,
author = {Reid Andersen and
Fan R. K. Chung and
Arunabha Sen and
Guoliang Xue},
title = {On Disjoint Path Pairs with Wavelength Continuity Constraint in {WDM}
Networks},
booktitle = {Proceedings {IEEE} {INFOCOM} 2004, The 23rd Annual Joint Conference
of the {IEEE} Computer and Communications Societies, Hong Kong, China,
March 7-11, 2004},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/INFCOM.2004.1354524},
doi = {10.1109/INFCOM.2004.1354524},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/AndersenCSX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/AndersenCL04,
author = {Reid Andersen and
Fan R. K. Chung and
Lincoln Lu},
editor = {Stefano Leonardi},
title = {Analyzing the Small World Phenomenon Using a Hybrid Model with Local
Network Flow (Extended Abstract)},
booktitle = {Algorithms and Models for the Web-Graph: Third International Workshop,
{WAW} 2004, Rome, Italy, October 16, 2004, Proceeedings},
series = {Lecture Notes in Computer Science},
volume = {3243},
pages = {19--30},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30216-2\_2},
doi = {10.1007/978-3-540-30216-2\_2},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/waw/AndersenCL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
