( en | de | ru )

 

Disambiguation of "Romanik, Kathleen"

Author of the publication

copydeleteadd this publication to your clipboard
Using computational learning theory to analyze the testing complexity of program segments.

, and . COMPSAC, page 367-373. IEEE, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kathleen Herkommer

Das familiäre Prostatakarzinom in Deutschland: Vorsorge, klinische Präsentation, progressfreies Überleben und karzinomspezifische Mortalität. TU München, habilitation, (2009)

Kathleen Müller

Kathleen Fritz

Kathleen Schubert

Kathleen Heinrich

 

Other publications of authors with the same name

Using computational learning theory to analyze the testing complexity of program segments., and . COMPSAC, page 367-373. IEEE, (1993)Directed rectangle visibility graphs have unbounded dimension.. CCCG, page 163-167. Carleton University, Ottawa, Canada, (1995)Testing Simple Polygons., , , , , , and . CCCG, page 387-392. University of Waterloo, (1993)Localizing a Robot with Minimum Travel., , and . SODA, page 437-446. ACM/SIAM, (1995)Approximate Testing and Learnability.. COLT, page 327-332. ACM, (1992)A Practical Approximation Algorithm for the LMS Line Estimator., , , , and . SODA, page 473-482. ACM/SIAM, (1997)Directed VR-Representable Graphs have Unbounded Dimension.. GD, volume 894 of Lecture Notes in Computer Science, page 177-181. Springer, (1994)A Visibility Representation for Graphs in Three Dimensions., , , , , , , , , and 1 other author(s). J. Graph Algorithms Appl., 2 (3): 1-16 (1998)A practical approximation algorithm for the LMS line estimator, , , , and . Computational Statistics & Data Analysis, 51 (5): 2461--2486 (Feb 1, 2007)