Karen  Villaverde
Assistant Professor PhD New Mexico State University   2002 Email: kvillave@cs.nmsu.edu   Phone: (575) 646-1609 Office: SH 144 Home Page
Karen Villaverde received a Bachelor's degree in Computer Science in 1991 and a Master's degree in Computer Science in 1993 from the University of Texas at El Paso, and a PhD in Computer Science from New Mexico State University in 2002. Karen graduated with high honors for her Bachelor's degree, graduated at the top of her class for her Master's degree, and received the outstanding graduating senior award for her doctoral research. During her Bachelor's studies she was supported by an academic scholarship, during her Master's studies she was supported by an NSF fellowship, and during her PhD studies she was supported by a GAANN fellowship from the US department of Education. Karen has published more than 30 research papers and has presented them at local, national, and international conferences. Karen's current research interests are in the areas of Interval Computations and Computer Gaming.

Publications
V. Kreinovich, O. Kosheleva, S. Starks, K. Tupelly, " From Intervals to Domains: Towards a General Description of Validated Uncertainty with Potential Applications to Geospatial and Meteorological Data, " From Intervals to Domains: Towards a General Description of Validated Uncertainty with Potential Applications to Geospatial and Meteorological Data, Journal of Computational and Applied Mathematics 199, pp 411–417,, 2007

E. Pontelli, K. Villaverde, H. Guo, G. Gupta, " Stack Splitting: A Technique for Efficient Exploitation of Search Parallelism on Share-Nothing Platforms, " Stack Splitting: A Technique for Efficient Exploitation of Search Parallelism on Share-Nothing Platforms, Journal of Parallel and Distributed Computing, vol 66, issue 10, pp 1267-1293,, 2006

E. Pontelli, K. Villaverde, H. Guo, G. Gupta, " PALS: Efficient Or-Parallel Execution of Prolog on Beowulf Clusters, " PALS: Efficient Or-Parallel Execution of Prolog on Beowulf Clusters, Theory and Practice of Logic Programming, vol 7, issue 3, pp 1-63,, 2006

D. Pengelley, I. Pivkina, D. Ranjan, K. Villaverde, " Introducing a Primary Historical Source Project in a Discrete Mathematics and Computer Science Course: Counting Triangulations of a Polygon, " Introducing a Primary Historical Source Project in a Discrete Mathematics and Computer Science Course: Counting Triangulations of a Polygon, 37th Technical Symposium in Computer Science Education, pp 318-322,, 2006

Tupelly, K., Kreinovich, V., Villaverde K, " Checking if there exists a Monotonic Function that Is Consistent with the Measurement Results: An Efficient Algorithm, " Checking if there exists a Monotonic Function that Is Consistent with the Measurement Results: An Efficient Algorithm, Reliable Computing, vol 11, pp 291-312,, 2005

K. Villaverde and E. Pontelli, " An Investigation of Scheduling in Distributed Constraint Logic Programming, " An Investigation of Scheduling in Distributed Constraint Logic Programming, 17th International Conference on Parallel and Distributed Computing Systems, pp 98-123,, 2004

K. Villaverde, E. Pontelli, H-F. Guo, and G. Gupta, " A Methodology for Order-Sensitive Execution of Non-deterministic Languages on Beowulf Platforms, " A Methodology for Order-Sensitive Execution of Non-deterministic Languages on Beowulf Platforms, 9th International Euro-Par Conference on Parallel and Distributed Processing, pp 694-703,, 2003

K. Villaverde, H. Guo, E. Pontelli, G. Gupta, " High Performance (Constraint) Logic Programming on the Beowulf Architecture, " High Performance (Constraint) Logic Programming on the Beowulf Architecture, 17th International Conference on Logic Programming, Springer Verlag LNCS 2237, pp 27-42,, 2002

K. Villaverde, E. Pontelli, H. Guo, G. Gupta, " Incremental Stack-Splitting Mechanisms for Efficient Parallel Implementation of Search-based AI Systems, " Incremental Stack-Splitting Mechanisms for Efficient Parallel Implementation of Search-based AI Systems, 30th International Conference on Parallel Processing, pp 287-294,, 2001