Search dblp for Publications

export results for "toc:db/journals/im/im2.bht:"

 download as .bib file

@article{DBLP:journals/im/AchlioptasL05,
  author       = {Dimitris Achlioptas and
                  Stefano Leonardi},
  title        = {Special Issue on Algorithms and Models for the Web-Graph},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {249},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129107},
  doi          = {10.1080/15427951.2005.10129107},
  timestamp    = {Tue, 27 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/im/AchlioptasL05.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}
}

@article{DBLP:journals/im/BerberichVW05,
  author       = {Klaus Berberich and
                  Michalis Vazirgiannis and
                  Gerhard Weikum},
  title        = {Time-Aware Authority Ranking},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {301--332},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129110},
  doi          = {10.1080/15427951.2005.10129110},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/BerberichVW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/Berkhin05,
  author       = {Pavel Berkhin},
  title        = {Survey: {A} Survey on PageRank Computing},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {1},
  pages        = {73--120},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129098},
  doi          = {10.1080/15427951.2005.10129098},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/Berkhin05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/BoldiSV05,
  author       = {Paolo Boldi and
                  Massimo Santini and
                  Sebastiano Vigna},
  title        = {Paradoxical Effects in PageRank Incremental Computations},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {387--404},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129106},
  doi          = {10.1080/15427951.2005.10129106},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/BoldiSV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/BoldiV05,
  author       = {Paolo Boldi and
                  Sebastiano Vigna},
  title        = {Codes for the World Wide Web},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {4},
  pages        = {407--429},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129113},
  doi          = {10.1080/15427951.2005.10129113},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/BoldiV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/BoydDPX05,
  author       = {Stephen P. Boyd and
                  Persi Diaconis and
                  Pablo A. Parrilo and
                  Lin Xiao},
  title        = {Symmetry Analysis of Reversible Markov Chains},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {1},
  pages        = {31--71},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129100},
  doi          = {10.1080/15427951.2005.10129100},
  timestamp    = {Mon, 30 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/im/BoydDPX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/CooperKZ05,
  author       = {Colin Cooper and
                  Ralf Klasing and
                  Michele Zito},
  title        = {Lower Bounds and Algorithms for Dominating Sets in Web Graphs},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {275--300},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129105},
  doi          = {10.1080/15427951.2005.10129105},
  timestamp    = {Fri, 16 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/CooperKZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/CorsoGR05,
  author       = {Gianna M. Del Corso and
                  Antonio Gulli and
                  Francesco Romani},
  title        = {Fast PageRank Computation via a Sparse Linear System},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {251--273},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129108},
  doi          = {10.1080/15427951.2005.10129108},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/CorsoGR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/DaubechiesDK05,
  author       = {Ingrid Daubechies and
                  Konstantinos Drakakis and
                  Tanya Khovanova},
  title        = {A Detailed Study of the Attachment Strategies of New Autonomous Systems
                  in the {AS} Connectivity Graph},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {2},
  pages        = {185--246},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129103},
  doi          = {10.1080/15427951.2005.10129103},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/DaubechiesDK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/FlakeP05,
  author       = {Gary William Flake and
                  Klaus Peters},
  title        = {Letter from Microsoft Live Labs and {A} {K} Peters},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {4},
  year         = {2005},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/FlakeP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/FlaxmanFF05,
  author       = {Abraham Flaxman and
                  Alan M. Frieze and
                  Trevor I. Fenner},
  title        = {High Degree Vertices and Eigenvalues in the Preferential Attachment
                  Graph},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {1},
  pages        = {1--19},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129097},
  doi          = {10.1080/15427951.2005.10129097},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/FlaxmanFF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/FogarasRCS05,
  author       = {D{\'{a}}niel Fogaras and
                  Bal{\'{a}}zs R{\'{a}}cz and
                  K{\'{a}}roly Csalog{\'{a}}ny and
                  Tam{\'{a}}s Sarl{\'{o}}s},
  title        = {Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds,
                  and Experiments},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {3},
  pages        = {333--358},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129104},
  doi          = {10.1080/15427951.2005.10129104},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/FogarasRCS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/GopalanKMMV05,
  author       = {Parikshit Gopalan and
                  Howard J. Karloff and
                  Aranyak Mehta and
                  Milena Mihail and
                  Nisheeth K. Vishnoi},
  title        = {Caching with Expiration Times for Internet Applications},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {2},
  pages        = {165--184},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129102},
  doi          = {10.1080/15427951.2005.10129102},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/GopalanKMMV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/LiADW05,
  author       = {Lun Li and
                  David L. Alderson and
                  John Doyle and
                  Walter Willinger},
  title        = {Towards a Theory of Scale-Free Graphs: Definition, Properties, and
                  Implications},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {4},
  pages        = {431--523},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129111},
  doi          = {10.1080/15427951.2005.10129111},
  timestamp    = {Wed, 20 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/im/LiADW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/Mitzenmacher05,
  author       = {Michael Mitzenmacher},
  title        = {Editorial: The Future of Power Law Research},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {4},
  pages        = {525--534},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129112},
  doi          = {10.1080/15427951.2005.10129112},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/Mitzenmacher05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/OliveiraS05,
  author       = {Roberto Imbuzeiro Oliveira and
                  Joel H. Spencer},
  title        = {Connectivity Transitions in Networks with Super-Linear Preferential
                  Attachment},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {2},
  pages        = {121--163},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129101},
  doi          = {10.1080/15427951.2005.10129101},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/OliveiraS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/im/Razborov05,
  author       = {Alexander A. Razborov},
  title        = {Guessing More Secrets via List Decoding},
  journal      = {Internet Math.},
  volume       = {2},
  number       = {1},
  pages        = {21--30},
  year         = {2005},
  url          = {https://doi.org/10.1080/15427951.2005.10129099},
  doi          = {10.1080/15427951.2005.10129099},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/Razborov05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.