History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 85 total

Mobile network creation games. (English)
Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30‒July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 159-170 (2012).
1
Size-hiding in private set intersection: existential results and constructions. (English)
Mitrokotsa, Aikaterini (ed.) et al., Progress in cryptology ‒ AFRICACRYPT 2012. 5th international conference on cryptology in Africa, Ifrane, Morocco, July 10‒12, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31409-4/pbk). Lecture Notes in Computer Science 7374, 378-394 (2012).
2
Group theoretic cryptography. (to appear). (English)
Chapman \& Hall/CRC Cryptography and Network Security. Boca Raton, FL: CRC Press (ISBN 978-1-58488-836-9/hbk). 320~p. \sterling~57.99 (2012).
3
Analysis of the particle swarm algorithm in the optimization of a three-phase slurry catalytic reactor (English)
Computers & Chemical Engineering 35, No. 12, 2741-2749 (2011).
4
DFT and minimum leakage pattern generation for static power reduction during test and burn-in. (English)
IEEE Trans. VLSI Syst. 18, No. 3, 392-400 (2010).
5
Improving unsatisfiability-based algorithms for Boolean optimization. (English)
Strichman, Ofer (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2010. 13th international conference, SAT 2010, Edinburgh, UK, July 11‒14, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14185-0/pbk). Lecture Notes in Computer Science 6175, 181-193 (2010).
6
A note on the security of $\text{MST} _{3}$. (English)
Des. Codes Cryptography 55, No. 2-3, 189-200 (2010).
7
Improving unsatisfiability-based algorithms for Boolean optimization (English)
SAT, 181-193 (2010).
8
Improving search space splitting for parallel SAT solving (English)
ICTAI (1), 336-343 (2010).
9
Anonymous subscription schemes - A flexible construction for on-line services access (English)
SECRYPT, 120-131 (2010).
10
A bio-inspired crime simulation model. (English)
Decis. Support Syst. 48, No. 1, 282-292 (2009).
11
Algorithms for weighted Boolean optimization. (English)
Comput. Res. Repos. 2009, Article No. 0903.0843 (2009).
12
Algorithms for weighted Boolean optimization. (English)
Kullmann, Oliver (ed.), Theory and applications of satisfiability testing ‒ SAT 2009. 12th international conference, SAT 2009, Swansea, UK, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02776-5/pbk). Lecture Notes in Computer Science 5584, 495-508 (2009).
13
Cryptanalysis of a key exchange scheme based on block matrices (English)
IACR Cryptology ePrint Archive 2009, 553 (2009).
14
A note on the security of MST3 (English)
IACR Cryptology ePrint Archive 2009, 96 (2009).
15
Related message attacks to public key encryption schemes: relations among security notions (English)
IACR Cryptology ePrint Archive 2009, 205 (2009).
16
Pseudo-Boolean and cardinality constraints (English)
Handbook of Satisfiability, 695-733 (2009).
17
Algorithms for weighted Boolean optimization (English)
SAT, 495-508 (2009).
18
Computing the summed adjacency disruption number between two genomes with duplicate genes using pseudo-Boolean optimization (English)
RECOMB-CG, 138-149 (2009).
19
Symmetry breaking for maximum satisfiability. (English)
Comput. Res. Repos. 2008, Article No. 0804.0599 (2008).
20
first | previous | 1 21 41 61 81 | next | last

Result 1 to 20 of 85 total