Tight bounds for the performance of Longest In System on DAGs
type: Item
instance of: scholarly article
title: Tight bounds for the performance of Longest In System on DAGs
zbMATH Open document ID: 1105.68004
author: Adi Rosén
author: Micah Adler
published in: Journal of Algorithms
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2184158
zbMATH Keywords: adversarial queueing theory
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jalgor.2004.04.013
OpenAlex ID: W2042849760
DOI: 10.1016/J.JALGOR.2004.04.013
Recommended article: Q4736830
Recommended article: Tight Bounds for Graph Problems in Insertion Streams
Recommended article: Q2766669
Recommended article: A linear-time parameterized algorithm for computing the width of a DAG
Recommended article: Fast Lowest Common Ancestor Computations in Dags
Recommended article: Tight lower bounds for the longest common extension problem
Recommended article: Q5417666
Recommended article: Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
Recommended article: Q5414582
Recommended article: Efficient Algorithms for k-Disjoint Paths Problems on DAGs
description: scientific article; zbMATH DE number 2184158