Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,101,583 papers from all fields of science
Search
Sign In
Create Free Account
DTIME
Known as:
DTIME(f(n))
, Deterministic time
, TIME(f(n))
In computational complexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
2-EXPTIME
Advice (complexity)
Algorithm
Analysis of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions
A. Bremler-Barr
,
David Hay
,
Yaron Koral
IEEE/ACM Transactions on Networking
2014
Corpus ID: 446532
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often…
Expand
2011
2011
Efficient Distributed Communication in Ad-Hoc Radio Networks
Bogdan S. Chlebus
,
D. Kowalski
,
A. Pelc
,
Mariusz A. Rokicki
International Colloquium on Automata, Languages…
2011
Corpus ID: 1799481
We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering…
Expand
2010
2010
Weak existence of the squared Bessel and CIR processes with skew reflection on a deterministic time-dependent curve
Gerald Trutnau
2010
Corpus ID: 17979108
Review
2006
Review
2006
Acquisition footprint suppression on 3D land surveys
N. Gulunay
,
N. Benjamin
,
M. Magesan
2006
Corpus ID: 124144220
A cquisition geometry footprint on 3D land surveys manifests itself as striping on time slices of stack volumes with inline and…
Expand
2005
2005
Navigating in the Cayley graphs of SL_N(Z) and SL_N(F_p)
T. Riley
2005
Corpus ID: 10269550
We give a non-deterministic algorithm that expresses elements of SL_N(Z), for N > 2, as words in a finite set of generators, with…
Expand
Highly Cited
2001
Highly Cited
2001
A Randomized Algorithm for Approximate String Matching
M. Atallah
,
F. Chyzak
,
P. Dumas
Algorithmica
2001
Corpus ID: 1070335
Abstract. We give a randomized algorithm in deterministic time O(Nlog M) for estimating the score vector of matches between a…
Expand
Highly Cited
1999
Highly Cited
1999
Analysis of Acoustic Signatures from Moving Vehicles Using Time-Varying Autoregressive Models
K. Eom
Multidimensional systems and signal processing
1999
Corpus ID: 58004383
Time-varying autoregressive (TVAR) modeling approach for the analysis of acoustic signatures from moving vehicles is presented in…
Expand
Highly Cited
1991
Highly Cited
1991
Comparison of call gapping and percent blocking for overload control in distributed switching systems and telecommunications networks
A. Berger
IEEE Transactions on Communications
1991
Corpus ID: 33462384
Two overload control techniques are compared. A percent blocking throttle blocks and rejects an arrival with a given probability…
Expand
1989
1989
A simple reliable solver for all the roots of a nonlinear function in a given domain
X. Ying
,
I. Katz
Computing
1989
Corpus ID: 35210370
A simple and reliable solver based on an exclusion method is formulated to find all the zeros of a nonlinear function in a given…
Expand
Highly Cited
1984
Highly Cited
1984
Discrete-time adaptive control for deterministic time-varying systems
Xianya Xie
,
R. Evans
at - Automatisierungstechnik
1984
Corpus ID: 333063
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE