@inproceedings{conf/icalp/PatrascuP05,
  added-at = {2017-05-23T00:00:00.000+0200},
  author = {Patrascu, Corina E. and Patrascu, Mihai},
  biburl = {https://www.bibsonomy.org/bibtex/2736ec826e1585c94b924afcbbce8d213/dblp},
  booktitle = {ICALP},
  crossref = {conf/icalp/2005},
  editor = {Caires, Luís and Italiano, Giuseppe F. and Monteiro, Luís and Palamidessi, Catuscia and Yung, Moti},
  ee = {https://doi.org/10.1007/11523468_78},
  interhash = {113c087211405ecce0fcbea19bfcd643},
  intrahash = {736ec826e1585c94b924afcbbce8d213},
  isbn = {3-540-27580-0},
  keywords = {dblp},
  pages = {969-981},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T16:27:21.000+0200},
  title = {On Dynamic Bit-Probe Complexity.},
  url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#PatrascuP05},
  volume = 3580,
  year = 2005
}

{"_id":"X8rJvTDNYc3wwfuFv","bibbaseid":"patrascu-patrascu-ondynamicbitprobecomplexity-2005","authorIDs":[],"author_short":["Patrascu, C. E.","Patrascu, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-23T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Patrascu"],"firstnames":["Corina","E."],"suffixes":[]},{"propositions":[],"lastnames":["Patrascu"],"firstnames":["Mihai"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2736ec826e1585c94b924afcbbce8d213/dblp","booktitle":"ICALP","crossref":"conf/icalp/2005","editor":[{"propositions":[],"lastnames":["Caires"],"firstnames":["Luís"],"suffixes":[]},{"propositions":[],"lastnames":["Italiano"],"firstnames":["Giuseppe","F."],"suffixes":[]},{"propositions":[],"lastnames":["Monteiro"],"firstnames":["Luís"],"suffixes":[]},{"propositions":[],"lastnames":["Palamidessi"],"firstnames":["Catuscia"],"suffixes":[]},{"propositions":[],"lastnames":["Yung"],"firstnames":["Moti"],"suffixes":[]}],"ee":"https://doi.org/10.1007/11523468_78","interhash":"113c087211405ecce0fcbea19bfcd643","intrahash":"736ec826e1585c94b924afcbbce8d213","isbn":"3-540-27580-0","keywords":"dblp","pages":"969-981","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T16:27:21.000+0200","title":"On Dynamic Bit-Probe Complexity.","url":"http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#PatrascuP05","volume":"3580","year":"2005","bibtex":"@inproceedings{conf/icalp/PatrascuP05,\n added-at = {2017-05-23T00:00:00.000+0200},\n author = {Patrascu, Corina E. and Patrascu, Mihai},\n biburl = {https://www.bibsonomy.org/bibtex/2736ec826e1585c94b924afcbbce8d213/dblp},\n booktitle = {ICALP},\n crossref = {conf/icalp/2005},\n editor = {Caires, Luís and Italiano, Giuseppe F. and Monteiro, Luís and Palamidessi, Catuscia and Yung, Moti},\n ee = {https://doi.org/10.1007/11523468_78},\n interhash = {113c087211405ecce0fcbea19bfcd643},\n intrahash = {736ec826e1585c94b924afcbbce8d213},\n isbn = {3-540-27580-0},\n keywords = {dblp},\n pages = {969-981},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T16:27:21.000+0200},\n title = {On Dynamic Bit-Probe Complexity.},\n url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#PatrascuP05},\n volume = 3580,\n year = 2005\n}\n\n","author_short":["Patrascu, C. E.","Patrascu, M."],"editor_short":["Caires, L.","Italiano, G. F.","Monteiro, L.","Palamidessi, C.","Yung, M."],"key":"conf/icalp/PatrascuP05","id":"conf/icalp/PatrascuP05","bibbaseid":"patrascu-patrascu-ondynamicbitprobecomplexity-2005","role":"author","urls":{"Link":"https://doi.org/10.1007/11523468_78","Paper":"http://dblp.uni-trier.de/db/conf/icalp/icalp2005.html#PatrascuP05"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/corina?items=1000","creationDate":"2019-05-18T19:26:18.304Z","downloads":0,"keywords":["dblp"],"search_terms":["dynamic","bit","probe","complexity","patrascu","patrascu"],"title":"On Dynamic Bit-Probe Complexity.","year":2005,"dataSources":["nk4Sfi2ddzBtdLpRN"]}