<--- Back to Details
First PageDocument Content
Programming language implementation / Assembly languages / Macro programming languages / RDOFF / Netwide Assembler / Constant / Macro / Microsoft Macro Assembler / Preprocessor / Computing / Software / Assemblers
Date: 2015-02-21 14:45:07
Programming language implementation
Assembly languages
Macro programming languages
RDOFF
Netwide Assembler
Constant
Macro
Microsoft Macro Assembler
Preprocessor
Computing
Software
Assemblers

NASM — The Netwide Assembler version[removed] © 1996−2012 The NASM Development Team — All Rights Reserved This document is redistributable under the license given in the file "LICENSE" distributed in the NASM arch

Add to Reading List

Source URL: www.nasm.us

Download Document from Source Website

File Size: 779,10 KB

Share Document on Facebook

Similar Documents

Human behavior / Violence / Abuse / Crimes / Rape / Violence against women / Sexual abuse / Domestic violence / Sexual assault / Address confidentiality program / Stalking

Survivors of assault and abuse often live in constant fear. Their days are filled with anxiety, knowing that their abuser or attacker might strike again. Sadly, this is a scenario many Iowans face every day. More than 3,

DocID: 1xVMJ - View Document

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

DocID: 1xUA8 - View Document

Efficient, Constant-Round and Actively Secure MPC:  Beyond the Three-Party Case

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case

DocID: 1xUoQ - View Document

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

DocID: 1xUb2 - View Document