Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: E. P. Braad
@inproceedings{DBLP:conf/iccsa/BekkerBG05, author = {Henk Bekker and E. P. Braad and Boris Goldengorin}, editor = {Osvaldo Gervasi and Marina L. Gavrilova and Vipin Kumar and Antonio Lagan{\`{a}} and Heow Pueh Lee and Youngsong Mun and David Taniar and Chih Jeng Kenneth Tan}, title = {Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations}, booktitle = {Computational Science and Its Applications - {ICCSA} 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part {IV}}, series = {Lecture Notes in Computer Science}, volume = {3483}, pages = {397--406}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11424925\_43}, doi = {10.1007/11424925\_43}, timestamp = {Wed, 20 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iccsa/BekkerBG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wea/BekkerBG05, author = {Henk Bekker and E. P. Braad and Boris Goldengorin}, editor = {Sotiris E. Nikoletseas}, title = {Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching}, booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop, {WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3503}, pages = {610--613}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11427186\_55}, doi = {10.1007/11427186\_55}, timestamp = {Wed, 20 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wea/BekkerBG05.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.