Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Kreinovich, Vladik
University of Texas at El Paso
El Paso, Texas
   Featured Reviewer
   Reader Recommended
Follow this Reviewer

Vladik Kreinovich received his MS in Mathematics and Computer Science from St. Petersburg University, Russia, in 1974, and PhD from the Institute of Mathematics, Soviet Academy of Sciences, Novosibirsk, in 1979. From 1975 to 1980, he worked with the Soviet Academy of Sciences; during this time, he worked with the Special Astrophysical Observatory (focusing on the representation and processing of uncertainty in radioastronomy). For most of the 1980s, he worked on error estimation and intelligent information processing for the National Institute for Electrical Measuring Instruments, Russia. In 1989, he was a visiting scholar at Stanford University. Since 1990, he has worked in the Department of Computer Science at the University of Texas at El Paso. In addition, he has served as an invited professor in Paris (University of Paris VI), France; Hong Kong; St. Petersburg, Russia; and Brazil.


His main research interests are the representation and processing of uncertainty, especially interval computations and intelligent control. He has written three books, edited six books, and written more than 800 papers. Vladik is a member of the editorial board of the international journal Reliable Computing (formerly Interval Computations) and several other journals. In addition, he is the co-maintainer of the international Web site on interval computations (


Vladik serves as president of the North American Fuzzy Information Processing Society; is a foreign member of the Russian Academy of Metrological Sciences; was the recipient of the 2003 El Paso Energy Foundation Faculty Achievement Award for Research awarded by the University of Texas at El Paso; and was a co-recipient of the 2005 Star Award from the University of Texas System.

Date Reviewed  
- 10 of 82 reviews

   Exact algorithms via monotone local search
Fomin F., Gaspers S., Lokshtanov D., Saurabh S.  Journal of the ACM 66(2): 1-23, 2019. Type: Article

Many important problems are NP-complete; this means that, unless P = NP, we cannot have a polynomial-time (feasible) algorithm for solving all instances of this problem. For each such problem, there is an exhaustive search algorithm that requires ...

Apr 26 2021  
  Is the stack distance between test case and method correlated with test effectiveness?
Niedermayr R., Wagner S.  EASE 2019 (Proceedings of the Evaluation and Assessment on Software Engineering, Copenhagen, Denmark,  Apr 15-17, 2019) 189-198, 2019. Type: Proceedings

In general, it is not algorithmically possible to always prove a program’s correctness or incorrectness. So, in practice, a program’s correctness is usually judged by testing the program on test cases from some test suite. How can we g...

Mar 15 2021  
  Credulous acceptability, poison games and modal logic
Grossi D., Rey S.  AAMAS 2019 (Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal, QC, Canada,  May 13-17, 2019) 1994-1996, 2019. Type: Proceedings

Abstract argumentation theory is based on the notion that argument x attacks argument y. A set of arguments S is “admissible” if no arguments within the set attack each other, an...

Sep 30 2020  
  Explaining explanations in AI
Mittelstadt B., Russell C., Wachter S.  FAT* 2019 (Proceedings of the Conference on Fairness, Accountability, and Transparency, Atlanta, GA,  Jan 29-31, 2019) 279-288, 2019. Type: Proceedings

Everyone agrees that artificial intelligence (AI) should be explainable; there is even an abbreviation for this: xAI. But opinions differ on what it means. This paper is a survey of different approaches to xAI....

Feb 21 2020  
  Frequency domain techniques for H control of distributed parameter systems
Özbay H., Gümüssoy S., Kashima K., Yamamoto Y.,  SIAM-Society for Industrial and Applied Mathematics, Philadelphia, PA, 2018. 192 pp. Type: Book (978-1-611975-39-0)

In traditional control theory, the object to be controlled (called a plant) is described by a differential equation (or by a system of such equations) in which the rate of change of the plant’s state depends on the current control value. Ana...

Aug 23 2019  
  Computing the homology of basic semialgebraic sets in weak exponential time
Bürgisser P., Cucker F., Lairez P.  Journal of the ACM 66(1): 1-30, 2019. Type: Article

A semialgebraic set is a subset of a finite-dimensional Euclidean space defined by a finite list of polynomial equalities and inequalities. These sets can be weird, so it desirable to be able to describe their topological shape, in particular, to ...

Mar 26 2019  
  Computing the expected value and variance of geometric measures
Tsirogiannis C., Staals F., Pellissier V.  Journal of Experimental Algorithmics 23(2): 1-32, 2018. Type: Article

Do species that inhabit a certain area form an ecosystem or are they a random collection? To answer this question, ecologists select appropriate numerical characteristics: average body mass, body length, and so on. Each species is described by a p...

Nov 9 2018  
  An effective characterization of the alternation hierarchy in two-variable logic
Krebs A., Straubing H.  ACM Transactions on Computational Logic 18(4): 1-22, 2017. Type: Article

Many interesting properties of words can be described in a first-order language with variables (x, y, ...) for positions and two basic properties: x < y (meaning that ...

Jul 6 2018  
  Optimizing search results for human learning goals
Syed R., Collins-Thompson K.  Information Retrieval 20(5): 506-523, 2017. Type: Article

For many students, web search is an important part of the learning process. However, existing search engines are optimized so as to achieve the largest average customer satisfaction among different categories of customers. Because of this, search ...

Feb 7 2018  
  Belief revision in structured probabilistic argumentation
Shakarian P., Simari G., Moores G., Paulo D., Parsons S., Falappa M., Aleali A.  Annals of Mathematics and Artificial Intelligence 78(3-4): 259-301, 2016. Type: Article

Traditional logic assumes, sometimes implicitly, that we are absolutely sure about each statement S in the knowledge base (KB); the question is what we can deduce from this knowledge. In practice, we often have some uncertainty ...

May 11 2017  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy