Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Ron Brown
@proceedings{DBLP:conf/wisee/2015, editor = {Ron Brown and Ali Abedi}, title = {2015 {IEEE} International Conference on Wireless for Space and Extreme Environments, WiSEE 2015, Orlando, FL, USA, December 14-16, 2015}, publisher = {{IEEE}}, year = {2015}, url = {https://ieeexplore.ieee.org/xpl/conhome/7386388/proceeding}, isbn = {978-1-4673-9946-3}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wisee/2015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pmh/BrownM03, author = {Ron Brown and Jonathan L. Merzel}, title = {Limiting behavior in Ducci sequences}, journal = {Period. Math. Hung.}, volume = {47}, number = {1-2}, pages = {45--50}, year = {2003}, url = {https://doi.org/10.1023/B\%3AMAHU.0000010810.99668.e2}, doi = {10.1023/B\%3AMAHU.0000010810.99668.E2}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pmh/BrownM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toms/RenkaB99, author = {Robert J. Renka and Ron Brown}, title = {Algorithm 791: {TSHEP2D:} cosine series Shepard method for bivariate interpolation of scattered data}, journal = {{ACM} Trans. Math. Softw.}, volume = {25}, number = {1}, pages = {74--77}, year = {1999}, url = {https://doi.org/10.1145/305658.305754}, doi = {10.1145/305658.305754}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toms/RenkaB99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toms/RenkaB99a, author = {Robert J. Renka and Ron Brown}, title = {Algorithm 792: accuracy test of {ACM} algorithms for interpolation of scattered data in the plane}, journal = {{ACM} Trans. Math. Softw.}, volume = {25}, number = {1}, pages = {78--94}, year = {1999}, url = {https://doi.org/10.1145/305658.305745}, doi = {10.1145/305658.305745}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toms/RenkaB99a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toms/RenkaB98, author = {Robert J. Renka and Ron Brown}, title = {Remark on Algorithm 761}, journal = {{ACM} Trans. Math. Softw.}, volume = {24}, number = {4}, pages = {383--385}, year = {1998}, url = {https://doi.org/10.1145/293686.293689}, doi = {10.1145/293686.293689}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toms/RenkaB98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Brown91, author = {Ron Brown}, title = {Minimal covers of \emph{S}\({}_{\mbox{\emph{n}}}\) by abelian subgroups and maximal subsets of pairwise noncommuting elements, {II}}, journal = {J. Comb. Theory, Ser. {A}}, volume = {56}, number = {2}, pages = {285--289}, year = {1991}, url = {https://doi.org/10.1016/0097-3165(91)90037-H}, doi = {10.1016/0097-3165(91)90037-H}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/Brown91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Brown88, author = {Ron Brown}, title = {Minimal covers of \emph{S}\({}_{\mbox{\emph{n}}}\) by abelian subgroups and maximal subsets of pairwise noncommuting elements}, journal = {J. Comb. Theory, Ser. {A}}, volume = {49}, number = {2}, pages = {294--307}, year = {1988}, url = {https://doi.org/10.1016/0097-3165(88)90057-X}, doi = {10.1016/0097-3165(88)90057-X}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/Brown88.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.