Area dell'Ingegneria

n. 21.1 -

When are two algorithms the same?  (A.A. nessuno)

Data Structures Algorithms Computer Science

n. 21.2 -

Applying Practice to Theory  (A.A. nessuno)

Computational Complexity Data Structures Algorithms

n. 21.3 -

An Efficient Algorithm for Partial Order Production  (A.A. nessuno)

partial order algorithm set theory

n. 21.4 -

Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes  (A.A. nessuno)

B-trees Bitmap Indexes Database

n. 21.5 -

An experimental analysis of Lemke-Howson algorithm  (A.A. nessuno)

Numerical Analysis Nash equilibrium Data Structures

n. 21.6 -

A CACHE-AWARE ALGORITHM FOR PDES ON HIERARCHICAL DATA STRUCTURES BASED ON SPACE-FILLING CURVES  (A.A. nessuno)

partial differential equations space-tree space-filling curves cache-awareness

n. 21.7 -

Dynamic Data Structures for a Direct  (A.A. nessuno)

global optimization DIRECT algorithm direct search dynamic data structures

n. 21.8 -

Computer algebra in Java: libraries and scripting  (A.A. nessuno)

Symbolic Computation Java computer algebra

n. 21.9 -

A Dynamic Data Structure for Checking Hyperacyclicity  (A.A. nessuno)

n. 21.10 -

Refactoring Sequential Java Code for Concurrency via Concurrent Libraries  (A.A. nessuno)

concurrency refactoring library program transformations

n. 21.11 -

Set Interfaces for Generalized Typestate and Data Structure Consistency Verification  (A.A. nessuno)