Ohcanbohtosat - "Data Structures and Algorithms"
-
1
Incremental Deployment of Network Monitors Based on Group Betweenness Centrality
Almmustuhtton 2009Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
2
A Polynomial time Algorithm for 3SAT
Almmustuhtton 2010Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
3
Local algorithms for the maximum flow and minimum cut in bounded-degree networks
Almmustuhtton 2010Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
4
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy
Almmustuhtton 2011Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
5
Approximation Algorithms for Digraph Width Parameters
Almmustuhtton 2011Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
6
Model for networks of spatial objects and simulation of geographical phenomena propagation
Almmustuhtton 2011Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
7
Correlation Decay up to Uniqueness in Spin Systems
Almmustuhtton 2011Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
8
Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components
Almmustuhtton 2012Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
9
Better bounds for matchings in the streaming model
Almmustuhtton 2012Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
10
The Longest Queue Drop Policy for Shared-Memory Switches is 1.5-competitive
Almmustuhtton 2012Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
11
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Almmustuhtton 2012Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
12
Lightweight Lempel-Ziv Parsing
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
13
Operational Concurrency Control in the Face of Arbitrary Scale and Latency
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
14
Lempel-Ziv Parsing in External Memory
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
15
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
16
Approximation Algorithms for the Load Balanced Capacitated Vehicle Routing Problem
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
17
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
Almmustuhtton 2013Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
18
Static Level Ancestors in Practice
Almmustuhtton 2014Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
19
Local Algorithms for Sparse Spanning Graphs
Almmustuhtton 2014Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal -
20
Bounds on Herman's algorithm
Almmustuhtton 2014Fáttát: “…Data Structures and Algorithms…”
Viečča ollesdeavstta
Viečča ollesdeavstta
Artihkal