Sciweavers

4781 search results - page 154 / 957
» Complexity at large
Sort
View
CSMR
1998
IEEE
14 years 2 months ago
A Metrics Suite for Concurrent Logic Programs
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
Jianjun Zhao, Jingde Cheng, Kazuo Ushijima
SPLC
2007
13 years 11 months ago
CIDE: Decomposing Legacy Applications into Features
Taking an extractive approach to decompose a legacy application into features is difficult and laborious with current approaches and tools. We present a prototype of a tooldriven...
Christian Kästner
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
14 years 1 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
RECOMB
2005
Springer
14 years 10 months ago
A Partial Solution to the C-Value Paradox
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
Jeffrey M. Marcus
IJNSEC
2008
128views more  IJNSEC 2008»
13 years 10 months ago
Attacking LCCC Batch Verification of RSA Signatures
Batch verification of digital signatures is used to improve the computational complexity when a large number of digital signatures must be verified. Lee at al. [2] proposed a new ...
Martin Stanek