Cited in
(26)- scientific article; zbMATH DE number 1343986 (Why is no real title available?)
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- Two novel closure rules for constructing phylogenetic super-networks
- Supercharging plant configurations using Z3
- Structured connectionist models and language learning
- Encoding phylogenetic trees in terms of weighted quartets
- Improvements to core-guided binary search for MaxSAT
- Oracle PL/SQL programming. Guide to Oracle8i features. Translated from the English by Wolfgang Gabriel. Incl. 1 disc
- The evolution of cooperation in patent races:Theory and experimental evidence
- Progress in Cryptology – Mycrypt 2005
- scientific article; zbMATH DE number 1324817 (Why is no real title available?)
- What's decidable about program verification modulo axioms?
- Interactive PCP
- HMQV
- MSUnCore
- MUSer2
- JViews
- EUFORIA
- A formal model of explanation
- Necessary versus probable cause
- Reconstruction of large phylogenetic trees: a parallel approach
- Additive two-mode clustering: The error-variance approach revisited
- On the ancestral compatibility of two phylogenetic trees with nested taxa
- Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
- EUFORIA: complete software model checking with uninterpreted functions
This page was built for software: Reveal
