Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 239,527,567 papers from all fields of science
Search
Sign In
Create Free Account
Deterministic algorithm
In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Aanderaa–Karp–Rosenberg conjecture
Abstract machine
Adleman–Pomerance–Rumely primality test
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Robust and efficient estimation of high dimensional scatter and location
R. Maronna
,
V. Yohai
2015
Corpus ID: 88521571
We deal with the equivariant estimation of scatter and location for p-dimensional data, giving emphasis to scatter. It it…
Expand
2012
2012
Automatic Extraction of Domain Name Generation Algorithms from Current Malware
Thomas Barabosch
,
André Wichmann
,
F. Leder
,
Elmar Gerhards-Padilla
2012
Corpus ID: 493675
Many botnets employ a method called domain fluxing for resilience. This technique strengthens the addressing layer of a botnet…
Expand
2007
2007
Scalable and deterministic key agreement for large scale networks
Yun Zhou
,
Yuguang Fang
IEEE Transactions on Wireless Communications
2007
Corpus ID: 18909746
Key agreement is a central problem to build up secure infrastructures for networks. Public key technology may not be suitable in…
Expand
2006
2006
Prototyping of automotive control systems in a time-triggered environment using flexray
J. Stroop
,
Ralf Stolpe
IEEE Conference on Computer Aided Control System…
2006
Corpus ID: 16805946
Highly sophisticated control systems are a driving force for innovation in automotive electronics. However, the integration of…
Expand
2005
2005
Price of Anarchy of Network Routing Games with Incomplete Information
Dinesh Garg
,
Y. Narahari
Workshop on Internet and Network Economics
2005
Corpus ID: 13926916
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m…
Expand
2004
2004
Using Sample-based Representations Under Communications Constraints
A. Ihler
,
John W. Fisher III
,
A. Willsky
2004
Corpus ID: 14427575
In many applications, particularly power-constrained sensor networks, it is important to conserve the amount of data exchanged…
Expand
2000
2000
An evaluation of the recovery-related properties of software faults
Subhachandra Chandra
,
Peter M. Chen
2000
Corpus ID: 18694037
In building systems that can survive random software failures, system designers make assumptions about the behavior of software…
Expand
1998
1998
Protocols for non-deterministic communication over synchronous channels
E. Demaine
Proceedings of the First Merged International…
1998
Corpus ID: 2279388
In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process…
Expand
Review
1996
Review
1996
An Effective and Practical Performance Prediction Model for Parallel Computing on Nondedicated Heterogeneous NOW
Yong Yan
,
Xiao-Dong Zhang
,
Yong-Sheng Song
J. Parallel Distributed Comput.
1996
Corpus ID: 206572931
cated system effects of the underlying system. In this paper, we focus on developing a practical performance prediction…
Expand
1994
1994
Occluding contour detection using affine invariants and purposive viewpoint control
Kiriakos N. Kutulakos
,
C. Dyer
Proceedings of IEEE Conference on Computer Vision…
1994
Corpus ID: 6729566
We present an approach for identifying the occluding contour and determining its sidedness using an active (i.e., moving…
Expand