IP (complexity)

Known as: IP 
In computational complexity theory, the class IP (which stands for Interactive Polynomial time) is the class of problems solvable by an interactive… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
There has been significant recent interest in covert communication using timing channels. In network timing channels, information… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
It is commonly believed that steganography within TCP/IP is easily achieved by embedding data in header fields seemingly filled… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2004
2004
Recently, the detection of distributed denial of service (DDoS) and the discovery of DDoS attacking signature used the mean of… (More)
  • table I
  • table 111
  • table I
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Using probabilistic learning, we develop a naive Bayesian classifier to passively infer a host’s operating system from packet… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2004
2004
In this paper, we examine the feasibility of incorporating network calculus based models in simulating TCP/IP networks. By… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present a performance comparison of a number of key micromobility protocols that have been discussed in the IETF Mobile IP… (More)
  • table 1
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The main objective of this paper is to explore how much information about the characteristics of end-to-end network paths can be… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper develops an algorithm for integrated dynamic routing of bandwidth guaranteed paths in IP over WDM networks. By… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
High performance Internet routers require a mechanism for very efficient IP address look-ups. Some techniques used to this end… (More)
  • figure 1
  • table I
  • table II
  • table III
  • table IV
Is this relevant?