Filter by
Introduction to the design and analysis of algorithms
Contents: 1 Introduction 1.1 What is an algorithm 1.2 Fundamentals of algorithmic problem solving 1.3 Important problem types 1.4 Fundamentals data structures Summary 2 Fundamentals of the analysis of algorithm efficiency 2.1 The analysis framework 2.2 Asymptotic notations and basic efficiency classes 2.3 Mathematical analysis of recursive algorithms 2.4 Mathematical analysis of …
- Edition
- Third Edition
- ISBN/ISSN
- 9780132316811
- Collation
- xxiv, 564 hal.; ilus.; 24 cm
- Series Title
- --
- Call Number
- 518.1 LEV i
Pemrograman linear
Daftar Isi: MODUL 1: MODEL PROGRAM LINEAR DAN DAERAH PENYELESAIAN MASALAH Kegiatan Belajar 1: Model Masalah Program Linear Latihan Rangkuman Tes Formatis 1 Kegiatan Belajar 2: Daerah Penyelesaian Program Linear Latihan Rangkuman Tes Formatf 2 KUNCI JAWABAN TES FORMATIF DAFTAR PUSTAKA MODUL 2: PENGERTIAN DASAR MATEMATIS DAN METODE GRAFIK Kegiatan Belajar 1: Peng…
- Edition
- Edisi kesatu
- ISBN/ISSN
- 9789790113138
- Collation
- iii, 964 hlm.; ilus.; 21 cm
- Series Title
- --
- Call Number
- 519.7 DJA p
Pengenalan algoritma pendekatan secara visual dan interaktif menggunakan Raptor
Daftar Isi: BAB 1 PENGANTAR SISTEM KOMPUTER DAN PEMPROGRAMAN 1.1 Sistem Komputer 1.2 Program, Aplikasi, Pemprogram, dan Pemprograman 1.3 Kompiler dan Internet 1.4 Kesalahan Perogram BAB 2 PENGANTAR ALGORITMA 2.1 Prinsip Pembuatan Program 2.2 Pengertian Algotritma 2.3 Algoritma Tidak Berhubungan dengan Bahasa Pemprograman Tertentu 2.4 Bagaimana Membuat Algoritma? BAB 3 FLOWCHA…
- Edition
- Ed. I
- ISBN/ISSN
- 9789792935240
- Collation
- viii, 334 hal.; ilus.; 24 cm.+ 1 CD
- Series Title
- --
- Call Number
- 004.0151 ABD p
Pengantar logika dan algoritma
Daftar Isi: BAB I PENGERTIAN DASAR LOGIKA DAN ALGORITMA 1.1. Definisi 1.2. Kriteria Pemilihan Algoritma 1.3. Studi Lanjut Tentang Algoritma 1.4. Analisis Suatu Algoritma 1.5. Time Complexity (Kompleksitas Waktu) 1.6. Keadaan Dari Time Complexity 1.7. Sifat-Sifat Algoritma BAB II KONSEP TIPE DATA 2.1. Mengenal Pascal 2.2. Struktur Program Pascal 2.3. Konsep Data Pascal …
- Edition
- Ed. I
- ISBN/ISSN
- 9797313921
- Collation
- viii, 103 hlm.; ilus.; 23 cm
- Series Title
- --
- Call Number
- 518.1 YUL p
Algoritma pemrograman
Daftar isi: 1. Pendahuluan 2. Tipe data, variabel, nilai dan ekspresi 3. Instruksi utama 4. Contoh permasalahan 5. Prosedur dan fungsi 6. Pemrosesan teks 7. Larik (array) 8. Teknik pencarian 9. Teknik pengurutan 10. Operasi matriks 11. Algoritma dan struktur data 12. Pemrograman berorientasi objek
- Edition
- Ed. I
- ISBN/ISSN
- 9797631168
- Collation
- 155 hlm.; ilusi.; 21 cm.
- Series Title
- --
- Call Number
- 004.0151 SUA a
Algorithmic cryptanalysis
CONTENTS: 1. A bird's-eye view of modern cryptography 2. Elementary number theory and algebra background 3. Linear algebra 4. Sieve algorithms 5. Brute force cryptanalysis 6. The birthday paradox : sorting or not? 7. Birthday-based algorithms for functions 8. Birthday attacks through quadrisection 9. Fourier and Hadamard-Walsh transforms 10. Lattice reduction 11. Polynomial…
- Edition
- --
- ISBN/ISSN
- 9781420070026
- Collation
- 501 hal.; 24 cm
- Series Title
- Mathematics/Computer Science
- Call Number
- 005.8 JOU a
Security of block ciphers: from algorithm design to hardware implementation
Contents 1 Introduction to block ciphers 2 Introduction to digital circuits 3 Handware implementation for block ciphers 4 Cryptanalysis on block ciphers 5 Side-channel analysis and fault analysis on block ciphers 6 Advanced fault analysis with techniques from cryptanalysis 7 Countermeasures against side-channel analysis and fault analysis
- Edition
- --
- ISBN/ISSN
- 9781118660010
- Collation
- ix, 295 hal.; ilus.; 25 cm
- Series Title
- --
- Call Number
- 005.82 KAZ s
Introduction to algorithms
Table of contents: I. Foundations 1. The Role of Algorithms in Computing 2. Getting Started 3. Growth of Functions 4. Divide-and-Conquer 5. Probabilistic Analysis and Randomized Algorithms II. Sorting and Order Statistics 6. Heapsort 7. Quicksort 8. Sorting in Linear Time 9. Medians and Order Statistics III. Data Structures 10. Elementary Data Structures 11. Hash Tables 12. B…
- Edition
- Third Edition
- ISBN/ISSN
- 9780262033848
- Collation
- xi, 1292 hal.; ilus.; 23 cm
- Series Title
- --
- Call Number
- 005.1 COR i
Algorithm design
Table of Contents About the Authors iv Preface xi 1. Introduction: Some Representative Problems 1 1.1 A First Problem: Stable Matching 1 Five Representatives Problems 12 Solved Exercises 19 Exercises 22 Notes and Further Reading 28 2. Basic of Algorithm Analysis 29 2.1 Computational Tractability 29 2.2 Asymptotic Order of Growth 35 2.3 Implementating the Stable Matching Algo…
- Edition
- -
- ISBN/ISSN
- -
- Collation
- -
- Series Title
- -
- Call Number
- 005.73 KLE a
Graph theory : modeling, applications, and algorithms
Once considered an “unimportant” branch of topology, graph theory has come into its own through many important contributions to a wide range of fields – and is now one of the fastest-growing areas in discrete mathematics and computer science. This practical, intuitive book introduces basic concepts, definitions, theorems, and examples from graph theory. Presents a collection of interestin…
- Edition
- International Edition
- ISBN/ISSN
- 131565362
- Collation
- xvii, 446 hlm.; ilus.; 23 cm.
- Series Title
- -
- Call Number
- 511.5 AGN g
Computer Science, Information & General Works 
Philosophy & Psychology 
Religion 
Social Sciences 
Language 
Pure Science 
Applied Sciences 
Art & Recreation 
Literature 
History & Geography