
Search dblp for Publications
export results for "logarithmic upper bound"
@article{DBLP:journals/cce/Salama13, author = {Ahmed I. A. Salama}, title = {Another confirmation that counter-current logarithmic mean is upper bound and a note on approximations}, journal = {Comput. Chem. Eng.}, volume = {48}, pages = {154--164}, year = {2013}, url = {https://doi.org/10.1016/j.compchemeng.2012.07.013}, doi = {10.1016/j.compchemeng.2012.07.013}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cce/Salama13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejcon/BurkanU06, author = {Recep Burkan and Ibrahim Uzmay}, title = {Application of Logarithmic-based Parameter and Upper Bounding Estimation Rules to Adaptive-Robust Control of Robot Manipulators}, journal = {Eur. J. Control}, volume = {12}, number = {2}, pages = {156--170}, year = {2006}, url = {https://doi.org/10.3166/ejc.12.156-170}, doi = {10.3166/ejc.12.156-170}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejcon/BurkanU06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejcon/Yaz06, author = {Edwin Engin Yaz}, title = {Discussion on: "Application of Logarithmic-based Parameter and Upper Bounding Estimation Rules to Adaptive-Robust Control of Robot Manipulators"}, journal = {Eur. J. Control}, volume = {12}, number = {2}, pages = {171--175}, year = {2006}, url = {https://doi.org/10.3166/ejc.12.171-175}, doi = {10.3166/ejc.12.171-175}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejcon/Yaz06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Breiling04, author = {Marco Breiling}, title = {A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {50}, number = {8}, pages = {1692--1710}, year = {2004}, url = {https://doi.org/10.1109/TIT.2004.831763}, doi = {10.1109/TIT.2004.831763}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Breiling04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BerkmanMR98, author = {Omer Berkman and Yossi Matias and Prabhakar Ragde}, title = {Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains}, journal = {J. Algorithms}, volume = {28}, number = {2}, pages = {197--215}, year = {1998}, url = {https://doi.org/10.1006/jagm.1997.0905}, doi = {10.1006/jagm.1997.0905}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BerkmanMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BerkmanMR93, author = {Omer Berkman and Yossi Matias and Prabhakar Ragde}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Nicola Santoro and Sue Whitesides}, title = {Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs}, booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al, Canada, August 11-13, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {709}, pages = {175--187}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57155-8\_246}, doi = {10.1007/3-540-57155-8\_246}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/BerkmanMR93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

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.