%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.04",
%%%     date            = "27 May 2014",
%%%     time            = "07:29:54 MDT",
%%%     filename        = "lncs2007a.bib",
%%%                        University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "50278 749 3517 35227",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX; bibliography; Lecture Notes in
%%%                        Computer Science",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of papers published in
%%%                        Lecture Notes in Computer Science
%%%                        (Springer-Verlag) for 2007.
%%%
%%%                        Bibliography entries below treat the series
%%%                        as a journal, rather than as conference
%%%                        proceedings.
%%%
%%%                        The companion bibliography lncs.bib lists
%%%                        just the individual volumes in the series,
%%%                        and the lncs19xy*.bib files list individual
%%%                        papers for year 19xy.  The large number of
%%%                        papers in this collection, and limitations
%%%                        in TeX and BibTeX, and in WWW HTTP transfer
%%%                        speeds, necessitate the splitting of the
%%%                        papers bibliographies into yearly files.
%%%
%%%                        At version 1.03, the year coverage looked
%%%                        like this:
%%%
%%%                             2007 (  19)
%%%
%%%                             InProceedings:   11
%%%                             Proceedings:      8
%%%
%%%                             Total entries:   19
%%%
%%%                        This bibliography has been constructed
%%%                        primarily from the publisher Web site.
%%%                        Regrettably, final page numbers are not
%%%                        available at that source.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.  Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen as
%%%                        name:year:abbrev, where name is the family
%%%                        name of the first author or editor, year is a
%%%                        4-digit number, and abbrev is a 3-letter
%%%                        condensation of important title words.
%%%                        Citation labels were automatically generated
%%%                        by software developed for the BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, with the help of ``bibsort
%%%                        -byvolume''.  The bibsort utility is available
%%%                        from ftp.math.utah.edu in /pub/tex/bib.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \undefined \bbb \def \bbb #1{\mathbb{#1}} \fi" #
    "\ifx \undefined \circled \def \circled #1{(#1)}\fi" #
    "\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi" #
    "\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi" #
    "\ifx \undefined \ocirc  \def \ocirc #1{{\accent'27#1}}\fi" #
    "\ifx \undefined \reg \def \reg {\circled{R}}\fi" #
    "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi" #
    "\hyphenation{
        Ay-ka-nat
        Giun-chi-glia
        Lakh-neche
        Mal-er-ba
        Mart-el-li
        Reut-e-nau-er
        Thiel-sch-er
        }"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-SV                  = "Springer-Verlag Inc."}

@String{pub-SV:adr              = "New York, NY, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNAI                = "Lecture Notes in Artificial Intelligence"}

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Bibliography entries:

@InProceedings{Andersen:2007:LCP,
  author =       "Reid Andersen and Christian Borgs and Jennifer Chayes
                 and John Hopcraft and Vahab S. Mirrokni and Shang-Hua
                 Teng",
  title =        "Local computation of {PageRank} contributions",
  crossref =     "Bonato:2007:AMW",
  pages =        "150--165",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_12",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "05C90 (68R10 68U35 68W25)",
  MRnumber =     "MR2504913 (2010f:05175)",
  bibdate =      "Wed May 5 19:28:04 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Andersen:2007:LPD,
  author =       "Reid Andersen and Fan Chung and Kevin Lang",
  title =        "Local partitioning for directed graphs using
                 {PageRank}",
  crossref =     "Bonato:2007:AMW",
  pages =        "166--178",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_13",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "05C20 (68M10 68R10 68U35)",
  MRnumber =     "MR2504914 (2010f:05082)",
  bibdate =      "Wed May 5 19:28:04 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Avrachenkov:2007:DPM,
  author =       "Konstantin Avrachenkov and Nelly Litvak and Kim Son
                 Pham",
  title =        "Distribution of {PageRank} mass among principle
                 components of the web",
  crossref =     "Bonato:2007:AMW",
  pages =        "16--28",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_2",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "68U35 (15A18)",
  MRnumber =     "MR2504904",
  bibdate =      "Wed May 5 19:28:04 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  ZMnumber =     "1136.68319",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Ceberio:2007:ICC,
  author =       "M. Ceberio and V. Kreinovich and A. Pownuk and B.
                 Bede",
  editor =       "Patricia Melin and others",
  booktitle =    "{Foundations of Fuzzy Logic and Soft Computing, 12th
                 International Fuzzy Systems Association World Congress,
                 IFSA 2007, Cancun, Mexico, June 18--21, 2007.
                 Proceedings}",
  title =        "From interval computations to constraint-related set
                 computations: Towards faster estimation of statistics
                 and {ODEs} under interval, $p$-box, and fuzzy
                 uncertainty",
  volume =       "4549",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "??--??",
  year =         "2007",
  ISBN =         "3-540-72917-8",
  ISBN-13 =      "978-3-540-72917-4",
  LCCN =         "????",
  bibdate =      "Fri Feb 01 14:21:56 2008",
  series =       ser-LNCS,
  URL =          "http://www.cs.utep.edu/vladik/2006/tr06-50.pdf",
  acknowledgement = ack-nhfb,
  bookpages =    "xix + 830",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Constantine:2007:UPC,
  author =       "Paul G. Constantine and David F. Gleich",
  title =        "Using polynomial chaos to compute the influence of
                 multiple random surfers in the {PageRank} model",
  crossref =     "Bonato:2007:AMW",
  pages =        "82--95",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_7",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "68U35 (60G99 65C05 68W40)",
  MRnumber =     "MR2505172",
  bibdate =      "Wed May 5 19:28:04 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  ZMnumber =     "1136.68321",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Costache:2007:PPB,
  author =       "Stefania Costache and Wolfgang Nejdl and Raluca Paiu",
  editor =       "Anonymous",
  booktitle =    "Proceedings of the 19th International Conference on
                 Advanced Information Systems Engineering",
  title =        "Personalizing {PageRank-based} ranking over
                 distributed collections",
  volume =       "????",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "111--126",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1145/511446.511513",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  bibdate =      "Sat May 8 18:33:11 MDT 2010",
  series =       ser-LNCS,
  abstract =     "In distributed work environments, where users are
                 sharing and searching resources, ensuring an
                 appropriate ranking at remote peers is a key problem.
                 While this issue has been investigated for federated
                 libraries, where the exchange of collection specific
                 information suffices to enable homogeneous TFxIDF
                 rankings across the participating collections, no
                 solutions are known for PageRank-based ranking schemes,
                 important for personalized retrieval on the desktop.
                 \par

                 Connected users share fulltext resources and metadata
                 expressing information about them and connecting them.
                 Based on which information is shared or private, we
                 propose several algorithms for computing personalized
                 PageRank-based rankings for these connected peers. We
                 discuss which information is needed for the ranking
                 computation and how Page-Rank values can be estimated
                 in case of incomplete information. We analyze the
                 performance of our algorithms through a set of
                 experiments, and conclude with suggestions for choosing
                 among these algorithms.",
  acknowledgement = ack-nhfb,
  keywords =     "distributed search; pagerank; personalization;
                 privacy",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Melucci:2007:PWO,
  author =       "Massimo Melucci and Luca Pretto",
  editor =       "Anonymous",
  booktitle =    "Proceedings of the 29th European Conference on IR
                 Research",
  title =        "{PageRank}: when order changes",
  volume =       "????",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "581--588",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1145/1060745.1060827",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  bibdate =      "Sat May 8 18:33:10 MDT 2010",
  series =       ser-LNCS,
  abstract =     "As PageRank is a ranking algorithm, it is of prime
                 interest to study the order induced by its values on
                 webpages. In this paper a thorough mathematical
                 analysis of PageRank-induced order changes when the
                 damping factor varies is provided. Conditions that do
                 not allow variations in the order are studied, and the
                 mechanisms that make the order change are
                 mathematically investigated. Moreover the influence on
                 the order of a truncation in the actual computation of
                 PageRank through a power series is analysed.
                 Experiments carried out on a large Web digraph to
                 integrate the mathematical analysis show that PageRank
                 -- while working on a real digraph -- tends to hinder
                 variations in the order of large rankings, presenting a
                 high stability in its induced order both in the face of
                 large variations of the damping factor value and in the
                 face of truncations in its computation.",
  acknowledgement = ack-nhfb,
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Qiao:2007:EAP,
  author =       "Jonathan Qiao and Brittany Jones and Stacy Thrall",
  editor =       "Anonymous",
  booktitle =    "Proceedings of the 7th international conference on
                 Computational Science, Part I: ICCS 2007",
  title =        "An Efficient Algorithm and Its Parallelization for
                 Computing {PageRank}",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "237--244",
  year =         "2007",
  CODEN =        "4487",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-72584-8_31",
  ISBN =         "3-540-72583-0",
  ISBN-13 =      "978-3-540-72583-1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  bibdate =      "Sat May 8 18:33:07 MDT 2010",
  series =       ser-LNCS,
  abstract =     "In this paper, an efficient algorithm and its
                 parallelization to compute PageRank are proposed. There
                 are existing algorithms to perform such tasks. However,
                 some algorithms exclude dangling nodes which are an
                 important part and carry important information of the
                 web graph. In this work, we consider dangling nodes as
                 regular web pages without changing the web graph
                 structure and therefore fully preserve the information
                 carried by them. This differs from some other
                 algorithms which include dangling nodes but treat them
                 differently from regular pages for the purpose of
                 efficiency. We then give an efficient algorithm with
                 negligible overhead associated with dangling node
                 treatment. Moreover, the treatment poses little
                 difficulty in the parallelization of the algorithm.",
  acknowledgement = ack-nhfb,
  keywords =     "PageRank; algorithm; dangling nodes; power method",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Volkovich:2007:DFB,
  author =       "Yana Volkovich and Nelly Litvak and Debora Donato",
  title =        "Determining factors behind the {PageRank} log-log
                 plot",
  crossref =     "Bonato:2007:AMW",
  pages =        "108--123",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "68U35 (05C90 68M10 68R10 91D30)",
  MRnumber =     "MR2504910",
  bibdate =      "Wed May 5 19:28:06 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  ZMnumber =     "1136.68339",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Wicks:2007:PCP,
  author =       "John Wicks and Amy Greenwald",
  title =        "Parallelizing the computation of {PageRank}",
  crossref =     "Bonato:2007:AMW",
  pages =        "202--208",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77004-6_17",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  MRclass =      "68U35 (68M10 68R10 68W10)",
  MRnumber =     "MR2504918",
  bibdate =      "Wed May 5 19:28:06 2010",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
  ZMnumber =     "1136.68340",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@InProceedings{Zhang:2007:SPW,
  author =       "Li Zhang and Tao Qin and Tie-Yan Liu and Ying Bao and
                 Hang Li",
  editor =       "Anonymous",
  booktitle =    "Proceedings of the 29th European Conference on IR
                 Research",
  title =        "{N}-step {PageRank} for {Web} search",
  volume =       "????",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "653--660",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1145/324133.324140",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  bibdate =      "Sat May 8 18:33:08 MDT 2010",
  series =       ser-LNCS,
  abstract =     "PageRank has been widely used to measure the
                 importance of web pages based on their interconnections
                 in the web graph. Mathematically speaking, PageRank can
                 be explained using a Markov random walk model, in which
                 only the direct outlinks of a page contribute to its
                 transition probability. In this paper, we propose
                 improving the PageRank algorithm by looking N -step
                 ahead when constructing the transition probability
                 matrix. The motivation comes from the similar 'looking
                 N -step ahead' strategy that is successfully used in
                 computer chess. Specifically, we assume that if the
                 random surfer knows the N -step outlinks of each web
                 page, he/she can make a better decision on choosing
                 which page to navigate for the next time. It is clear
                 that the classical PageRank algorithm is a special case
                 of our proposed N -step PageRank method. Experimental
                 results on the dataset of TREC Web track show that our
                 proposed algorithm can boost the search accuracy of
                 classical PageRank by more than 15\% in terms of mean
                 average precision.",
  acknowledgement = ack-nhfb,
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

%%% ====================================================================
%%% Cross-referenced entries must come last; they are sorted in volume
%%% order with ``bibsort --byseriesvolume'':

@Proceedings{Furbach:2007:ART,
  editor =       "Ulrich Furbach and Natarajan Shankar",
  booktitle =    "{Automated Reasoning: Third International Joint
                 Conference, IJCAR 2006, Seattle, WA, USA, August
                 17--20, 2006: Proceedings}",
  title =        "{Automated Reasoning: Third International Joint
                 Conference, IJCAR 2006, Seattle, WA, USA, August
                 17--20, 2006: Proceedings}",
  volume =       "4130",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xv + 680",
  year =         "2007",
  ISBN =         "3-540-37187-7 (paperback), 3-540-37188-5 (e-book)",
  ISBN-13 =      "978-3-540-37187-8 (paperback), 978-3-540-37188-5
                 (e-book)",
  LCCN =         "QA76.9.A96 I33 2006",
  bibdate =      "Thu May 22 15:32:05 MDT 2014",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 http://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
  series =       "Lecture Notes in Computer Science Ser.",
  URL =          "http://WX7CF7ZP2H.search.serialssolutions.com/?V=1.0\%26L=WX7CF7ZP2H\%26S=JCs\%26C=TC",
  abstract =     "Here are the proceedings of the Third International
                 Joint Conference on Automated Reasoning, IJCAR 2006,
                 held in Seattle, Washington, USA, August 2006. The book
                 presents 41 revised full research papers and 8 revised
                 system descriptions, with 3 invited papers and a
                 summary of a systems competition. The papers are
                 organized in topical sections on proofs, search,
                 higher-order logic, proof theory, proof checking,
                 combination, decision procedures, CASC-J3, rewriting,
                 and description logic.",
  acknowledgement = ack-nhfb,
  subject =      "Automatic theorem proving; Artificial intelligence",
}

@Proceedings{Cai:2007:TAM,
  editor =       "Jin-yi Cai and S. B. (S. Barry) Cooper and Hong Zhu",
  booktitle =    "{Theory and applications of models of computation: 4th
                 international conference, TAMC 2007, Shanghai, China,
                 May 22--25, 2007: proceedings}",
  title =        "{Theory and applications of models of computation: 4th
                 international conference, TAMC 2007, Shanghai, China,
                 May 22--25, 2007: proceedings}",
  volume =       "4484",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiii + 772",
  year =         "2007",
  ISBN =         "3-540-72503-2 (softcover)",
  ISBN-13 =      "978-3-540-72503-9 (softcover)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "QA267.7 .T36 2007",
  bibdate =      "Thu May 6 10:38:25 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       ser-LNCS,
  URL =          "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4484",
  acknowledgement = ack-nhfb,
  meetingname =  "TAMC 2007 (2007: Shanghai, China)",
  subject =      "Computational complexity; Congresses; Computable
                 functions",
}

@Proceedings{Boavida:2007:WWI,
  editor =       "Fernando Boavida and Edmundo Monteiro and Saverio
                 Mascolo",
  booktitle =    "{Wired\slash wireless Internet communications: 5th
                 international conference, WWIC 2007, Coimbra, Portugal,
                 May 23--25, 2007. proceedings}",
  title =        "{Wired\slash wireless Internet communications: 5th
                 international conference, WWIC 2007, Coimbra, Portugal,
                 May 23--25, 2007. proceedings}",
  volume =       "4517",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "????",
  year =         "2007",
  ISBN =         "3-540-72694-2 (softcover)",
  ISBN-13 =      "978-3-540-72694-4 (softcover)",
  LCCN =         "????",
  bibdate =      "Wed Apr 25 14:53:11 MDT 2007",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib;
                 z3950.loc.gov:7090/Voyager",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Proceedings{Dehne:2007:ADS,
  editor =       "Frank Dehne and J{\"o}rg-R{\"u}diger Sack and Norbert
                 Zeh",
  booktitle =    "{Algorithms and Data Structures. 10th International
                 Workshop, WADS 2007, Halifax, Canada, August 15--17,
                 2007. Proceedings}",
  title =        "{Algorithms and Data Structures. 10th International
                 Workshop, WADS 2007, Halifax, Canada, August 15--17,
                 2007. Proceedings}",
  volume =       "4619",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "139--150",
  year =         "2007",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-73951-7",
  ISBN =         "3-540-73948-3",
  ISBN-13 =      "978-3-540-73948-7",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  LCCN =         "????",
  bibdate =      "Mon Dec 10 13:58:02 MST 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/hash.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
}

@Proceedings{Menezes:2007:ACC,
  editor =       "A. J. (Alfred J.) Menezes",
  booktitle =    "{Advances in cryptology --- CRYPTO 2007: 27th Annual
                 International Cryptology Conference, Santa Barbara, CA,
                 USA, August 19--23, 2007: proceedings}",
  title =        "{Advances in cryptology --- CRYPTO 2007: 27th Annual
                 International Cryptology Conference, Santa Barbara, CA,
                 USA, August 19--23, 2007: proceedings}",
  volume =       "4622",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "xiv + 630",
  year =         "2007",
  ISBN =         "3-540-74142-9 (paperback)",
  ISBN-13 =      "978-3-540-74142-8 (paperback)",
  LCCN =         "QA76.9.A25 C79 2007",
  bibdate =      "Thu Apr 21 10:08:28 MDT 2011",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       "Lecture notes in computer science, 0302-9743",
  URL =          "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4622",
  acknowledgement = ack-nhfb,
  meetingname =  "CRYPTO (Conference) (27th : 2007 : Santa Barbara,
                 Calif.)",
  subject =      "International conference proceedings. International
                 Association for Cryptologic Research; computers; access
                 control; congresses; cryptography",
  tableofcontents = "I: Cryptanalysis I \\
                 Practical Cryptanalysis of SFLASH \\
                 Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
                 \\
                 II: Secure Searching \\
                 How Should We Solve Search Problems Privately? \\
                 Public Key Encryption That Allows PIR Queries \\
                 III: Invited Talk \\
                 Information Security Economics --- and Beyond \\
                 IV: Theory I \\
                 Cryptography with Constant Input Locality \\
                 Universally-Composable Two-Party Computation in Two
                 Rounds \\
                 Indistinguishability Amplification \\
                 V: Lattices \\
                 A Hybrid Lattice-Reduction and Meet-in-the-Middle
                 Attack Against NTRU \\
                 Improved Analysis of Kannan's Shortest Lattice Vector
                 Algorithm (Extended Abstract) \\
                 VI: Random Oracles \\
                 Domain Extension of Public Random Functions: Beyond the
                 Birthday Barrier \\
                 Random Oracles and Auxiliary Input \\
                 VII: Hash Functions \\
                 Security-Amplifying Combiners for Collision-Resistant
                 Hash Functions \\
                 Hash Functions and the (Amplified) Boomerang Attack \\
                 Amplifying Collision Resistance: A Complexity-Theoretic
                 Treatment \\
                 VIII: Theory II \\
                 How Many Oblivious Transfers Are Needed for Secure
                 Multiparty Computation? \\
                 Simulatable VRFs with Applications to Multi-theorem
                 NIZK \\
                 Cryptography in the Multi-string Model \\
                 IX: Quantum Cryptography \\
                 Secure Identification and QKD in the
                 Bounded-Quantum-Storage Model \\
                 A Tight High-Order Entropic Quantum Uncertainty
                 Relation with Applications \\
                 X: Cryptanalysis II \\
                 Finding Small Roots of Bivariate Integer Polynomial
                 Equations: A Direct Approach \\
                 A Polynomial Time Attack on RSA with Private
                 CRT-Exponents Smaller Than N<sup>0.073</sup> \\
                 XI: Encryption \\
                 Invertible Universal Hashing and the TET Encryption
                 Mode \\
                 Reducing Trust in the PKG in Identity Based
                 Cryptosystems \\
                 Pirate Evolution: How to Make the Most of Your Traitor
                 Keys \\
                 XII: Protocol Analysis \\
                 A Security Analysis of the NIST SP 800-90 Elliptic
                 Curve Random Number Generator \\
                 A Generalization of DDH with Applications to Protocol
                 Analysis and Computational Soundness \\
                 Chernoff-Type Direct Product Theorems \\
                 XIII: Public-Key Encryption \\
                 Rerandomizable RCCA Encryption \\
                 Deterministic and Efficiently Searchable Encryption \\
                 Secure Hybrid Encryption from Weakened Key
                 Encapsulation \\
                 XIV: Multi-party Computation \\
                 Scalable and Unconditionally Secure Multiparty
                 Computation \\
                 On Secure Multi-party Computation in Black-Box Groups
                 \\
                 A Note on Secure Computation of the Moore-Penrose
                 Pseudoinverse and Its Application to Secure Linear
                 Algebra \\
                 Author Index",
}

@Proceedings{Stutzle:2007:ESL,
  editor =       "Thomas St{\"u}tzle and Mauro Birattari and Holger H.
                 Hoos",
  booktitle =    "{Engineering Stochastic Local Search Algorithms.
                 Designing, Implementing and Analyzing Effective
                 Heuristics, International Workshop, SLS 2007, Brussels,
                 Belgium, September 6--8, 2007, Proceedings}",
  title =        "{Engineering Stochastic Local Search Algorithms.
                 Designing, Implementing and Analyzing Effective
                 Heuristics, International Workshop, SLS 2007, Brussels,
                 Belgium, September 6--8, 2007, Proceedings}",
  volume =       "4638",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  year =         "2007",
  ISBN =         "3-540-74445-2",
  ISBN-13 =      "978-3-540-74445-0",
  bibdate =      "Thu Aug 13 18:38:32 2009",
  bibsource =    "DBLP;
                 http://dblp.uni-trier.de/db/conf/sls/sls2007.html;
                 http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
  series =       ser-LNCS,
  acknowledgement = ack-nhfb,
}

@Proceedings{Bonato:2007:AMW,
  editor =       "Anthony Bonato and Fan R. K. Chung",
  booktitle =    "{Algorithms and models for the web-graph: 5th
                 international workshop, WAW 2007, San Diego, CA, USA,
                 December 11--12, 2007: proceedings}",
  title =        "{Algorithms and models for the web-graph: 5th
                 international workshop, WAW 2007, San Diego, CA, USA,
                 December 11--12, 2007: proceedings}",
  volume =       "4863",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 216",
  year =         "2007",
  ISBN =         "3-540-77003-8 (softcover)",
  ISBN-13 =      "978-3-540-77003-9 (softcover)",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  LCCN =         "QA76.9.A43 W39 2007; QA76.9.A43 W428 2007; QA76.9.A43
                 W428 2007; Internet; QA76.9.A43 W63 2007",
  bibdate =      "Thu May 6 08:22:51 MDT 2010",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib;
                 melvyl.cdlib.org:210/CDL90",
  series =       ser-LNCS,
  URL =          "http://www.springerlink.com/content/978-3-540-77003-9",
  acknowledgement = ack-nhfb,
  meetingname =  "WAW 2007 (2007: San Diego, Calif.)",
  subject =      "computer algorithms; congresses; data mining",
}

@Proceedings{Botana:2007:ADG,
  editor =       "Francisco Botana and Tomas Recio",
  booktitle =    "{Automated deduction in geometry: 6th international
                 workshop, ADG 2006, Pontevedra, Spain, August
                 31--September 2, 2006. revised papers}",
  title =        "{Automated deduction in geometry: 6th international
                 workshop, ADG 2006, Pontevedra, Spain, August
                 31--September 2, 2006. revised papers}",
  volume =       "4869",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "x + 211",
  year =         "2007",
  DOI =          "http://dx.doi.org/10.1007/978-3-540-77356-6",
  ISBN =         "3-540-77355-X (softcover)",
  ISBN-13 =      "978-3-540-77355-9 (softcover)",
  LCCN =         "QA448.D38 I577 2006",
  MRclass =      "68-06 (03B35 51-06 68T15 68U05)",
  MRnumber =     "2866844 (2012h:68002)",
  bibdate =      "Thu May 22 15:42:50 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/kepler.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2007a.bib",
  note =         "Revised papers from the 6th International Workshop
                 (ADG 2006) held at the University of Vigo, Pontevedra,
                 August 31--September 2, 2006",
  series =       "Lecture Notes in Computer Science",
  abstract =     "This book constitutes the thoroughly refereed
                 post-proceedings of the 6th International Workshop on
                 Automated Deduction in Geometry, ADG 2006, held at
                 Pontevedra, Spain, in August\slash September 2006 as a
                 satellite event of the International Congress of
                 Mathematicians, ICM 2006. The 13 revised full papers
                 presented were carefully selected from the submissions
                 made due to a call for papers --- within the scope of
                 ADG shortly after the meeting. The papers show the
                 lively variety of topics and methods and the current
                 applicability of automated deduction in geometry to
                 different branches of mathematics and to other sciences
                 and technologies.",
  acknowledgement = ack-nhfb,
}