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 74 reviews

  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  
  Recent advances in computational optimization: results of the Workshop on Computational Optimization (WCO 2015)
Fidanova S.,  Springer International Publishing, New York, NY, 2016. 303 pp. Type: Book (978-3-319401-31-7)

There exist many optimization techniques ranging from the more traditional techniques of numerical optimization to heuristic techniques such as evolutionary computation, ant optimization, and so on. In numerical analysis, the quality of different ...

Nov 7 2016  
  Representing 3-manifolds by filling Dehn surfaces
Vigara R., Lozano-Rojo A.,  World Scientific Publishing Co, Inc., River Edge, NJ, 2016. 350 pp. Type: Book

In many applications we encounter manifolds, that is, topological spaces that are locally homeomorphic to the usual Euclidean space. Probably the most well-known example is general relativity, according to which our space-time is a manifold (excep...

Sep 2 2016  
  Truthfulness and stochastic dominance with monetary transfers
Hoefer M., Kesselheim T., Vöcking B.  ACM Transactions on Economics and Computation 4(2): 1-18, 2016. Type: Article

It is desirable to design auctions in such a way that participants have a financial incentive to provide true information about their interests. At first glance, an ideal description of this truthfulness requirement is that, in all possible situat...

Apr 29 2016  
  Computing the distance between piecewise-linear bivariate functions
Moroz G., Aronov B.  ACM Transactions on Algorithms 12(1): 1-13, 2016. Type: Article

To map a terrain, we measure elevations at different spatial locations and then interpolate the resulting values. Usually, the measurement locations are used to triangulate the area. Then, on each of the resulting triangles, we perform linear inte...

Mar 4 2016  
  Reconsidering pairs and functions as sets
Brown C.  Journal of Automated Reasoning 55(3): 199-210, 2015. Type: Article

In set theory, a pair (x,y) is normally described using Kuratowski’s representation {{x},{x,y}}. The set of all the pairs (x,
Dec 8 2015  
  A time series retrieval tool for sub-series matching
Bottrighi A., Leonardi G., Montani S., Portinale L., Terenziani P.  Applied Intelligence 43(1): 132-149, 2015. Type: Article

In many practical applications, it is important to check whether certain patterns occurred in the past. For example, when performing a medical procedure such as dialysis, it is important to check whether the patient experienced a fast decrease in ...

Oct 7 2015  
  A hybrid dynamic programming approach to the biobjective binary knapsack problem
Delort C., Spanjaard O.  Journal of Experimental Algorithmics 181.1-1.21, 2013. Type: Article

When we have several different objective functions, and we are not sure how to combine them into a single objective function that describes our preferences, it’s reasonable to generate the Pareto set, which is the set of all alternatives tha...

Nov 20 2013  
   Algorithms unlocked
Cormen T.,  The MIT Press, Cambridge, MA, 2013. 240 pp. Type: Book (978-0-262518-80-2), Reviews: (1 of 2)

Computers are ubiquitous. Everyone uses computers and computer-based systems for many daily activities. Many computer applications are very user-friendly, meaning we can use them without understanding how they work, just as we can drive a car with...

Sep 24 2013  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy