Sciweavers

400 search results - page 40 / 80
» Derandomization and Distinguishing Complexity
Sort
View
PLDI
2010
ACM
15 years 7 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
ECOOP
2000
Springer
15 years 6 months ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen
ECCC
2007
124views more  ECCC 2007»
15 years 1 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
BMCBI
2005
90views more  BMCBI 2005»
15 years 1 months ago
An algorithm for the determination and quantification of components of nucleic acid mixtures based on single sequencing reaction
Background: Determination and quantification of nucleic acid components in a mixture is usually accomplished by microarray approaches, where the mixtures are hybridized against sp...
Alexander E. Pozhitkov, Kathryn Stemshorn, Diethar...
JUCS
2007
95views more  JUCS 2007»
15 years 1 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow