Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Igor Muttik

Igor Muttik (born 1962 in Russia) is a computer security expert, researcher and inventor.
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Dexterous multi-fingered hands are extremely versatile and provide a generic way to perform multiple tasks in human-centric… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2018
Highly Cited
2018
We study the effects of enabling peer supply through Airbnb in the accommodation industry. We present a model of competition… Expand
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Abstract : Lecture notes from course ORF 570 - Probability in High Dimension, Princeton University (educational material made… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Extracting opinion expressions from text is usually formulated as a token-level sequence labeling task tackled using Conditional… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present a technique for finding security vulnerabilities in Web applications. SQL Injection (SQLI) and cross-site scripting… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In recent years, various computational models have been developed for studying the dynamics of belief formation in a population… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Abstract: Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Achieving understanding of nature is one of the aims of science. In this paper we offer an analysis of the nature of scientific… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We show that it is decidable in time complexity \(2^{2^{2^{O{(n)}}}}\) whether the language accepted by an n-state non… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract Despite the fact that all successful, documented cases of industrial symbiosis to this day have been self-organizing… Expand
Is this relevant?