[{"citation":{"short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","ieee":"P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","ama":"Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). ; 2008. doi:10.1007/978-3-540-70575-8_66","apa":"Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). https://doi.org/10.1007/978-3-540-70575-8_66","chicago":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.","bibtex":"@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing Problem}, DOI={10.1007/978-3-540-70575-8_66}, booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }","mla":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66."},"year":"2008","type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-70575-8_66","_id":"19686","date_updated":"2022-01-06T06:54:10Z","publication_status":"published","publication_identifier":{"isbn":["9783540705741","9783540705758"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2020-09-25T09:45:40Z","author":[{"first_name":"Patrick","full_name":"Briest, Patrick","last_name":"Briest"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","title":"Uniform Budgets and the Envy-Free Pricing Problem","user_id":"15415"},{"title":"The Kinetic Facility Location Problem","user_id":"15415","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540699002","9783540699033"]},"status":"public","date_created":"2020-09-04T10:04:49Z","author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"}],"publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","department":[{"_id":"63"}],"doi":"10.1007/978-3-540-69903-3_34","date_updated":"2022-01-06T06:53:57Z","_id":"19003","type":"conference","year":"2008","citation":{"mla":"Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.","bibtex":"@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility Location Problem}, DOI={10.1007/978-3-540-69903-3_34}, booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008}, pages={378–389} }","chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic Facility Location Problem.” In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 378–89, 2008. https://doi.org/10.1007/978-3-540-69903-3_34.","apa":"Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34","ama":"Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT). ; 2008:378-389. doi:10.1007/978-3-540-69903-3_34","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389."},"page":"378-389","language":[{"iso":"eng"}]},{"title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","user_id":"15415","publication_identifier":{"isbn":["9783540691334","9783540691341"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","volume":5040,"date_created":"2020-11-16T13:55:39Z","status":"public","publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Wörn","first_name":"Heinz","full_name":"Wörn, Heinz"}],"doi":"10.1007/978-3-540-69134-1_44","_id":"20367","date_updated":"2022-01-06T06:54:26Z","intvolume":" 5040","page":"447--456","citation":{"bibtex":"@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={10.1007/978-3-540-69134-1_44}, booktitle={The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456} }","mla":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456, doi:10.1007/978-3-540-69134-1_44.","ama":"Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08). Vol 5040. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44","apa":"Hamann, H., & Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In The tenth International Conference on Simulation of Adaptive Behavior (SAB’08) (Vol. 5040, pp. 447--456). https://doi.org/10.1007/978-3-540-69134-1_44","chicago":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” In The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 5040:447--456, 2008. https://doi.org/10.1007/978-3-540-69134-1_44.","ieee":"H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in The tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.","short":"H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456."},"type":"conference","year":"2008","language":[{"iso":"eng"}]},{"date_created":"2020-08-14T13:19:24Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540851936","9783540851943"]},"publication":"Unconventional Computing","department":[{"_id":"63"}],"author":[{"last_name":"Lürwer-Brüggemeier","first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"user_id":"15415","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"citation":{"ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg, 2008.","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.","bibtex":"@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={10.1007/978-3-540-85194-3_11}, booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2008} }","ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11","apa":"Lürwer-Brüggemeier, K., & Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In Unconventional Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_11","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” In Unconventional Computing. Berlin, Heidelberg, 2008. https://doi.org/10.1007/978-3-540-85194-3_11."},"type":"book_chapter","year":"2008","doi":"10.1007/978-3-540-85194-3_11","date_updated":"2022-01-06T06:53:24Z","_id":"17978"},{"year":"2007","citation":{"apa":"Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-73951-7_30","ama":"Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007. doi:10.1007/978-3-540-73951-7_30","chicago":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73951-7_30.","mla":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73951-7_30.","bibtex":"@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg}, title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}, DOI={10.1007/978-3-540-73951-7_30}, booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and Kutyłowski, Jarosław}, year={2007} }","short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","ieee":"M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30."},"type":"conference","language":[{"iso":"eng"}],"_id":"24276","date_updated":"2022-01-06T06:56:13Z","doi":"10.1007/978-3-540-73951-7_30","publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"},{"full_name":"Kutyłowski, Jarosław","first_name":"Jarosław","last_name":"Kutyłowski"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2021-09-13T13:07:57Z","status":"public","abstract":[{"lang":"eng","text":"We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.\r\nBasing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.\r\n"}],"place":"Berlin, Heidelberg","title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","user_id":"15415"},{"author":[{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"publisher":"Springer Berlin Heidelberg","department":[{"_id":"64"}],"publication":"Advances in Cryptology — CRYPTO 2002","publication_status":"published","publication_identifier":{"isbn":["9783540440505","9783540457084"],"issn":["0302-9743"]},"status":"public","date_created":"2018-06-05T08:26:03Z","place":"Berlin, Heidelberg","title":"Cryptanalysis of Unbalanced RSA with Small CRT-Exponent","user_id":"25078","type":"book_chapter","citation":{"mla":"May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.","bibtex":"@inbook{May_2007, place={Berlin, Heidelberg}, title={Cryptanalysis of Unbalanced RSA with Small CRT-Exponent}, DOI={10.1007/3-540-45708-9_16}, booktitle={Advances in Cryptology — CRYPTO 2002}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2007}, pages={242–256} }","chicago":"May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45708-9_16.","ama":"May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: Advances in Cryptology — CRYPTO 2002. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:242-256. doi:10.1007/3-540-45708-9_16","apa":"May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45708-9_16","ieee":"A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.","short":"A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256."},"year":"2007","page":"242-256","_id":"3019","date_updated":"2022-01-06T06:58:51Z","doi":"10.1007/3-540-45708-9_16"},{"user_id":"25078","title":"Low Secret Exponent RSA Revisited","place":"Berlin, Heidelberg","status":"public","date_created":"2018-06-05T08:26:29Z","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"publication_status":"published","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","doi":"10.1007/3-540-44670-2_2","_id":"3020","date_updated":"2022-01-06T06:58:51Z","type":"book_chapter","year":"2007","citation":{"short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.","ieee":"J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.","ama":"Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2","apa":"Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2","chicago":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret Exponent RSA Revisited}, DOI={10.1007/3-540-44670-2_2}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }","mla":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2."},"page":"4-19"},{"doi":"10.1007/3-540-45537-x_26","_id":"3021","date_updated":"2022-01-06T06:58:51Z","citation":{"mla":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation with Interval Cover Families}, DOI={10.1007/3-540-45537-x_26}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }","ama":"Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26","apa":"Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26","chicago":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.","ieee":"J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.","short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341."},"type":"book_chapter","year":"2007","page":"325-341","title":"Key Revocation with Interval Cover Families","user_id":"25078","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540430667","9783540455370"],"issn":["0302-9743"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:26:50Z","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"department":[{"_id":"64"}],"publication":"Selected Areas in Cryptography"},{"page":"110-125","type":"book_chapter","year":"2007","citation":{"mla":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.","bibtex":"@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension Reduction Methods for Convolution Modular Lattices}, DOI={10.1007/3-540-44670-2_10}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125} }","chicago":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_10.","ama":"May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10","apa":"May, A., & Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_10","ieee":"A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.","short":"A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125."},"doi":"10.1007/3-540-44670-2_10","_id":"3022","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424888","9783540446705"]},"date_created":"2018-06-05T08:27:10Z","status":"public","department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","author":[{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"},{"last_name":"Silverman","full_name":"Silverman, Joseph H.","first_name":"Joseph H."}],"publisher":"Springer Berlin Heidelberg","title":"Dimension Reduction Methods for Convolution Modular Lattices","user_id":"25078","place":"Berlin, Heidelberg"},{"place":"Berlin, Heidelberg","user_id":"25078","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","publication":"Algorithms — ESA’ 98","department":[{"_id":"64"}],"publisher":"Springer Berlin Heidelberg","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"}],"date_created":"2018-06-05T08:28:39Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"date_updated":"2022-01-06T06:58:51Z","_id":"3026","doi":"10.1007/3-540-68530-8_13","page":"151-162","type":"book_chapter","year":"2007","citation":{"bibtex":"@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={10.1007/3-540-68530-8_13}, booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2007}, pages={151–162} }","mla":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.","chicago":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.","ama":"Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13","apa":"Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13","ieee":"J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162."}}]