Spring til hovednavigation
Spring til søgning
Spring til hovedindhold
IT-Universitetet i København Forside
Support til ITU faculty
Link åbnes på en ny fane
Dansk
English
Søg efter indhold i IT-Universitetet i København
Forside
Enheder
Forskere
Projekter
Publikationer
Forskningsdatasæt
Kurser
Presse/medier
Aktiviteter
Priser
Riko Jacob
Sektionsleder
Lektor
,
Theoretical Computer Science
Algorithms
Machine Learning
Center for Information Security and Trust
https://orcid.org/0000-0001-9470-1809
E-mail
rikj
itu
dk
2014
2025
Publikationer pr. år
Vis
Fingeraftryk
Netværk
Publikationer
(22)
Projekter
(4)
Aktiviteter
(3)
Kurser
(9)
Lignende profiler
(6)
Vejledning
(2)
Fingeraftryk
Dyk ned i forskningsemnerne, hvor Riko Jacob er aktive. Disse emneetiketter kommer fra dennes persons arbejder. Sammen danner de et unikt fingerprint.
Sorter
Vægt
Alfabetisk
Keyphrases
External Memory Model
71%
Fragile Complexity
63%
External Memory
52%
Competitive Ratio
47%
I/O Complexity
42%
Cache-oblivious
39%
Convex Hull
39%
Graph Algorithms
39%
Generalized Sorting
39%
Kleinberg
36%
Algorithm Comparison
34%
Adaptive Algorithm
31%
Bichromatic
31%
Priority Queue
31%
Shor
31%
Instance Optimal
31%
Optimal Algorithm
31%
Waypoint Routing
31%
Algorithmic Complexity
31%
High-dimensional PDEs
31%
Communication Scheme
31%
Global Communication
31%
Numerical Solution
31%
Cache Miss
31%
Optimal Alternative
31%
Caching
31%
Sorted Matrices
31%
Logarithmic Function
31%
Feasibility Trial
31%
Iterated Logarithm
31%
Recursive Method
31%
Hierarchization
31%
Frac-N
31%
K-nearest
31%
Product Matrix
31%
Semi-streaming
31%
Graph Drawing
31%
Streaming Model
31%
Dijkstras Algorithm
31%
Oblivious Data Structure
31%
Fast Output
31%
Atomic Power
31%
Shortest Path
28%
Combined Method
23%
Price Information
22%
Polynomial Space
21%
Routing Model
21%
Routing Problem
21%
Sparse Matrix
18%
SIMPLE Algorithm
18%
Computer Science
Input/Output
84%
External Memory
68%
Adaptive Algorithm
63%
Matrix Multiplication
63%
Data Structure
47%
Synchronism
47%
Memory Model
42%
Competitive Ratio
31%
Optimal Algorithm
31%
Memory Access
31%
Join Operation
31%
Comparator
31%
Algorithmic Complexity
31%
Minimum Element
31%
Communication Overhead
31%
Cache Line Size
31%
Arithmetic Operation
31%
Routing Problem
31%
Polynomial Space
31%
Dijkstras Algorithm
31%
Persistence
31%
Supercomputer
31%
Operation Insert
31%
Partial Differential Equation
31%
Numerical Solution
31%
Communication Scheme
31%
Randomized Algorithm
26%
Simple Algorithm
26%
Computational Complexity
15%
Maximal Number
15%
Approximation Algorithms
15%
Fundamental Problem
15%
Dijkstra Algorithms
15%
Network Support
15%
Partial Order
15%
Network Community
15%
Discretization
15%
Computer Network
15%
Network Service
15%
Modern Computer
15%
Grand Challenge
15%
Exascale Computing
15%
Proof
15%
High-Performance Computing
15%
Communication Model
15%
High Dimensionality
15%
Sparsity
10%
Industrial Applications
10%
Space Requirement
10%
Subgraphs
10%
Mathematics
Matrix (Mathematics)
100%
Competitive Ratio
94%
Convex Hull
47%
Worst Case
43%
Optimality
39%
Probability
37%
Matrix Multiplication
31%
Partial Differential Equation
31%
Numerical Solution
31%
Asymmetric
31%
Main Result
31%
Edge-Connectivity
31%
Data Structure
31%
Minimum Spanning Tree
31%
Nearest Neighbor
31%
Lower and upper bounds
31%
Comparator
31%
Upper Bound
26%
Randomization
23%
Constant Factor
21%
Nonzero Entry
18%
Arithmetic Operation
18%
Simulation Model
15%
Minimizes
15%
Time Step
15%
Permutation
15%
Total Cost
15%
Partial Order
15%
Wide Range
15%
Cost Function
15%
Discretization
15%
Grand Challenge
15%
Sparse Grids
15%
Nash Equilibrium
15%
Extreme Points
12%
Polynomial
12%
Approximates
12%
Diagonal
10%
Running Time
10%
Hamiltonian Path
7%
Open Problem
7%
Arbitrary Field
7%
Matrix Product
6%
Monte Carlo Algorithm
6%
Intersects
6%
Square Matrix
6%
Product of Matrix
6%
Unit Costs
6%
Asymptotics
6%
Simplest Case
6%
