On the public citation graph

Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10719839_9openalex-snapshot
The LCA Problem Revisited
inferredcites →https://doi.org/10.1007/bf02837777openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/j.dam.2007.05.018openalex-snapshot
On the range maximum-sum segment query problem
inferredcites →https://doi.org/10.1016/s0304-3975(02)00741-7openalex-snapshot
Dynamic orthogonal range queries in OLAP
inferredcites →https://doi.org/10.1109/codas.2001.945152openalex-snapshot
Range sum queries in dynamic OLAP data cubes
inferredcites →https://doi.org/10.1109/ctrq.2008.11openalex-snapshot
Optimal Offline TCP Sender Buffer Management Strategy
inferredcites →https://doi.org/10.1109/tkde.2005.40openalex-snapshot
Analysis of data structures for admission control of advance reservation requests
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.48550/arxiv.0806.3827openalex-snapshot
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-40820-5_8openalex-snapshot
Research on the RRB+ Tree for Resource Reservation
inferred← citeshttps://doi.org/10.1007/978-3-642-53959-6_6openalex-snapshot
Research on Efficient Non-slotted Tree Structures for Advance Reservation
inferred← citeshttps://doi.org/10.1007/s10766-012-0219-4openalex-snapshot
List-based Data Structures for Efficient Management of Advance Reservations
inferred← citeshttps://doi.org/10.1109/access.2020.2976613openalex-snapshot
An Advance Reservation System to Improve Network Resource Utilization in Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/isscs.2009.5206110openalex-snapshot
Decision optimization techniques for efficient delivery of multimedia streams
inferred← citeshttps://doi.org/10.1109/synasc.2008.40openalex-snapshot
Towards a Real-Time Scheduling Framework for Data Transfers in Tree Networks
inferred← citeshttps://doi.org/10.1109/synasc.2008.99openalex-snapshot
Time Slot Groups - A Data Structure for QoS-Constrained Advance Bandwidth Reservation and Admission Control
inferred← citeshttps://doi.org/10.1109/synasc.2009.38openalex-snapshot
Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.0903.3622openalex-snapshot
Algorithmic Solutions to Some Transportation Optimization Problems with Applications in the Metallurgical Industry
inferred← citeshttps://doi.org/10.48550/arxiv.0906.0350openalex-snapshot
Towards a Centralized Scheduling Framework for Communication Flows in Distributed Systems
inferred← citeshttps://doi.org/10.48550/arxiv.0906.0376openalex-snapshot
Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0906.1341openalex-snapshot
Efficient Algorithms for Several Constrained Activity Scheduling Problems in the Time and Space Domains
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3490openalex-snapshot
Optimal Constrained Resource Allocation Strategies under Low Risk Circumstances
inferred← citeshttps://doi.org/10.48550/arxiv.0908.0060openalex-snapshot
Algorithmic Decision Optimization Techniques for Multiple Types of Agents with Contrasting Interests
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1454openalex-snapshot
Multidimensional Data Structures and Techniques for Efficient Decision Making
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3968openalex-snapshot
Practical Range Aggregation, Selection and Set Maintenance Techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5038openalex-snapshot
Algorithmic Solutions for Several Offline Constrained Resource Processing and Data Transfer Multicriteria Optimization Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.