Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Kathleen Romanik
@article{DBLP:journals/csda/MountNRSW07, author = {David M. Mount and Nathan S. Netanyahu and Kathleen Romanik and Ruth Silverman and Angela Y. Wu}, title = {A practical approximation algorithm for the {LMS} line estimator}, journal = {Comput. Stat. Data Anal.}, volume = {51}, number = {5}, pages = {2461--2486}, year = {2007}, url = {https://doi.org/10.1016/j.csda.2006.08.033}, doi = {10.1016/J.CSDA.2006.08.033}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/csda/MountNRSW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FleischerRST01, author = {Rudolf Fleischer and Kathleen Romanik and Sven Schuierer and Gerhard Trippen}, title = {Optimal Robot Localization in Trees}, journal = {Inf. Comput.}, volume = {171}, number = {2}, pages = {224--247}, year = {2001}, url = {https://doi.org/10.1006/inco.2001.2972}, doi = {10.1006/INCO.2001.2972}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FleischerRST01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/BoseEFHLMRRSWZ98, author = {Prosenjit Bose and Hazel Everett and S{\'{a}}ndor P. Fekete and Michael E. Houle and Anna Lubiw and Henk Meijer and Kathleen Romanik and G{\"{u}}nter Rote and Thomas C. Shermer and Sue Whitesides and Christian Zelle}, title = {A Visibility Representation for Graphs in Three Dimensions}, journal = {J. Graph Algorithms Appl.}, volume = {2}, number = {3}, pages = {1--16}, year = {1998}, url = {https://doi.org/10.7155/jgaa.00006}, doi = {10.7155/JGAA.00006}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/BoseEFHLMRRSWZ98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DudekRW98, author = {Gregory Dudek and Kathleen Romanik and Sue Whitesides}, title = {Localizing a Robot with Minimum Travel}, journal = {{SIAM} J. Comput.}, volume = {27}, number = {2}, pages = {583--604}, year = {1998}, url = {https://doi.org/10.1137/S0097539794279201}, doi = {10.1137/S0097539794279201}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DudekRW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/ArkinBMMRSS97, author = {Esther M. Arkin and Patrice Belleville and Joseph S. B. Mitchell and David M. Mount and Kathleen Romanik and Steven Salzberg and Diane L. Souvaine}, title = {Testing Simple Polygons}, journal = {Comput. Geom.}, volume = {8}, pages = {97--114}, year = {1997}, url = {https://doi.org/10.1016/S0925-7721(96)00015-6}, doi = {10.1016/S0925-7721(96)00015-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/ArkinBMMRSS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Romanik97, author = {Kathleen Romanik}, title = {Directed Rectangle-visibility Graphs Have Unbounded Dimension}, journal = {Discret. Appl. Math.}, volume = {73}, number = {1}, pages = {35--39}, year = {1997}, url = {https://doi.org/10.1016/S0166-218X(96)00075-3}, doi = {10.1016/S0166-218X(96)00075-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Romanik97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Romanik97, author = {Kathleen Romanik}, title = {Approximate Testing and Its Relationship to Learning}, journal = {Theor. Comput. Sci.}, volume = {188}, number = {1-2}, pages = {79--99}, year = {1997}, url = {https://doi.org/10.1016/S0304-3975(96)00241-1}, doi = {10.1016/S0304-3975(96)00241-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Romanik97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MountNRSW97, author = {David M. Mount and Nathan S. Netanyahu and Kathleen Romanik and Ruth Silverman and Angela Y. Wu}, editor = {Michael E. Saks}, title = {A Practical Approximation Algorithm for the {LMS} Line Estimator}, booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}}, pages = {473--482}, publisher = {{ACM/SIAM}}, year = {1997}, url = {http://dl.acm.org/citation.cfm?id=314161.314349}, timestamp = {Thu, 05 Jul 2018 07:29:42 +0200}, biburl = {https://dblp.org/rec/conf/soda/MountNRSW97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/RomanikV96, author = {Kathleen Romanik and Jeffrey Scott Vitter}, title = {Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments}, journal = {Inf. Comput.}, volume = {128}, number = {2}, pages = {87--108}, year = {1996}, url = {https://doi.org/10.1006/inco.1996.0065}, doi = {10.1006/INCO.1996.0065}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/RomanikV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/RomanikS96, author = {Kathleen Romanik and Sven Schuierer}, editor = {Sue Whitesides}, title = {Optimal Robot Localization in Trees}, booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996}, pages = {264--273}, publisher = {{ACM}}, year = {1996}, url = {https://doi.org/10.1145/237218.237395}, doi = {10.1145/237218.237395}, timestamp = {Mon, 14 Jun 2021 16:25:18 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/RomanikS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/RomanikS95, author = {Kathleen Romanik and Steven Salzberg}, title = {Testing Orthogonal Shapes}, journal = {Comput. Geom.}, volume = {5}, pages = {33--49}, year = {1995}, url = {https://doi.org/10.1016/0925-7721(94)00016-O}, doi = {10.1016/0925-7721(94)00016-O}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/RomanikS95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/Romanik95, author = {Kathleen Romanik}, title = {Directed rectangle visibility graphs have unbounded dimension}, booktitle = {Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995}, pages = {163--167}, publisher = {Carleton University, Ottawa, Canada}, year = {1995}, url = {http://www.cccg.ca/proceedings/1995/cccg1995\_0027.pdf}, timestamp = {Wed, 12 May 2021 14:19:37 +0200}, biburl = {https://dblp.org/rec/conf/cccg/Romanik95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DudekRW95, author = {Gregory Dudek and Kathleen Romanik and Sue Whitesides}, editor = {Kenneth L. Clarkson}, title = {Localizing a Robot with Minimum Travel}, booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 22-24 January 1995. San Francisco, California, {USA}}, pages = {437--446}, publisher = {{ACM/SIAM}}, year = {1995}, url = {http://dl.acm.org/citation.cfm?id=313651.313783}, timestamp = {Thu, 05 Jul 2018 07:29:25 +0200}, biburl = {https://dblp.org/rec/conf/soda/DudekRW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/RomanikS94, author = {Kathleen Romanik and Carl Smith}, title = {Testing Geometric Objects}, journal = {Comput. Geom.}, volume = {4}, pages = {157--176}, year = {1994}, url = {https://doi.org/10.1016/0925-7721(94)90005-1}, doi = {10.1016/0925-7721(94)90005-1}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/RomanikS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gd/Romanik94, author = {Kathleen Romanik}, editor = {Roberto Tamassia and Ioannis G. Tollis}, title = {Directed VR-Representable Graphs have Unbounded Dimension}, booktitle = {Graph Drawing, {DIMACS} International Workshop, {GD} '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {894}, pages = {177--181}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-58950-3\_369}, doi = {10.1007/3-540-58950-3\_369}, timestamp = {Sun, 13 Nov 2022 09:57:39 +0100}, biburl = {https://dblp.org/rec/conf/gd/Romanik94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/ArkinBMMRSS93, author = {Esther M. Arkin and Patrice Belleville and Joseph S. B. Mitchell and David M. Mount and Kathleen Romanik and Steven Salzberg and Diane L. Souvaine}, title = {Testing Simple Polygons}, booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993}, pages = {387--392}, publisher = {University of Waterloo}, year = {1993}, timestamp = {Wed, 19 May 2021 16:29:07 +0200}, biburl = {https://dblp.org/rec/conf/cccg/ArkinBMMRSS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compsac/RomanikV93, author = {Kathleen Romanik and Jeffrey Scott Vitter}, title = {Using computational learning theory to analyze the testing complexity of program segments}, booktitle = {Seventeenth Annual International Computer Software and Applications Conference, {COMPSAC} 1993, Proceedings, Phoenix, AZ, USA, 1-5 November, 1993}, pages = {367--373}, publisher = {{IEEE}}, year = {1993}, url = {https://doi.org/10.1109/CMPSAC.1993.404242}, doi = {10.1109/CMPSAC.1993.404242}, timestamp = {Wed, 16 Oct 2019 14:14:53 +0200}, biburl = {https://dblp.org/rec/conf/compsac/RomanikV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Romanik92, author = {Kathleen Romanik}, editor = {David Haussler}, title = {Approximate Testing and Learnability}, booktitle = {Proceedings of the Fifth Annual {ACM} Conference on Computational Learning Theory, {COLT} 1992, Pittsburgh, PA, USA, July 27-29, 1992}, pages = {327--332}, publisher = {{ACM}}, year = {1992}, url = {https://doi.org/10.1145/130385.130422}, doi = {10.1145/130385.130422}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/Romanik92.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.