D
Danny Krizanc
Researcher at Carleton University
Publications - 103
Citations - 2512
Danny Krizanc is an academic researcher from Carleton University. The author has contributed to research in topics: Sorting & Processor array. The author has an hindex of 23, co-authored 103 publications receiving 2453 citations. Previous affiliations of Danny Krizanc include University of Rochester.
Papers
More filters
Journal ArticleDOI
Power consumption in packet radio networks
TL;DR: For points in three dimensions it is shown that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard and an O(n 2 ) time approximation algorithm is given which provides a completerange assignment with cost within a factor of two of the minimum.
Journal ArticleDOI
Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency
TL;DR: A new concept of the asymptotic Z-score is introduced and a fast, whole-genome scanning algorithm is described to compute asymPTotic minimum free energy Z-scores of moving-window contents of ESTs and genomes.
Journal ArticleDOI
Approximating the unsatisfiability threshold of random formulas
TL;DR: Kirousis et al. as mentioned in this paper considered the problem of computing the least real number k such that if the ratio of the number of clauses over k strictly exceeds k, then f is almost certainly unsatisfiable.
Journal ArticleDOI
Rigorous results for random (2 + p)-SAT
TL;DR: The 1rst rigorous results for random (2 + p)-SAT are given, including the following surprising fact: for p ≤ 2/5, with probability 1 - o(1), a random (1 + p) -SAT formula is satisfiable if its 2-SAT subformula is Satisfiable.
Book
The Mobile Agent Rendezvous Problem in the Ring
TL;DR: This monograph provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.