On the public citation graph
Optimal Client-Server Assignment for Internet Distributed Systems
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-15883-4_29openalex-snapshot
Improved MinMax Cut Graph Clustering with Nonnegative Relaxation
inferredcites →https://doi.org/10.1109/34.244673openalex-snapshot
An optimal graph theoretic approach to data clustering: theory and its application to image segmentation
inferredcites →https://doi.org/10.1109/34.868688openalex-snapshot
Normalized cuts and image segmentation
inferredcites →https://doi.org/10.1109/43.103500openalex-snapshot
An improved two-way partitioning algorithm with stable performance (VLSI)
inferredcites →https://doi.org/10.1109/43.310898openalex-snapshot
Spectral K-way ratio-cut partitioning and clustering
inferredcites →https://doi.org/10.1109/71.993202openalex-snapshot
An efficient partitioning algorithm for distributed virtual environment systems
inferredcites →https://doi.org/10.1109/9780470544419openalex-snapshot
Distributed Operating Systems: Concepts and Design
inferredcites →https://doi.org/10.1109/icdm.2001.989507openalex-snapshot
A min-max cut algorithm for graph partitioning and data clustering
inferredcites →https://doi.org/10.1109/ipdps.2006.1639288openalex-snapshot
Efficient client-to-server assignments for distributed virtual environments
inferredcites →https://doi.org/10.1109/iv.2007.10openalex-snapshot
A Fast Algorithm for Balanced Graph Clustering
inferredcites →https://doi.org/10.1109/mcc.1998.678836openalex-snapshot
Distributed Operating Systems: Concepts And Design
inferredcites →https://doi.org/10.1109/tpami.2007.1115openalex-snapshot
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
inferredcites →https://doi.org/10.1109/tpds.2005.83openalex-snapshot
Improving the performance of distributed virtual environment systems
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1348549.1348559openalex-snapshot
Spectral clustering in telephone call graphs
inferredcites →https://doi.org/10.1145/1889863.1889910openalex-snapshot
Heat diffusion based dynamic load balancing for distributed virtual environments
inferredcites →https://doi.org/10.1147/rd.175.0420openalex-snapshot
Lower Bounds for the Partitioning of Graphs
inferredcites →https://doi.org/10.1162/089976698300017467openalex-snapshot
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
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-319-42553-5_3openalex-snapshot
Cost Optimal Resource Provisioning for Live Video Forwarding Across Video Data Centers
inferred← citeshttps://doi.org/10.1007/s12083-012-0175-1openalex-snapshot
A novel method for delivering multimedia e-advertisement data base on use multi-path and multi-seed peer-to-peer-like approach
inferred← citeshttps://doi.org/10.1016/j.jvcir.2017.01.010openalex-snapshot
Online multi-objective optimization for live video forwarding across video data centers
inferred← citeshttps://doi.org/10.1109/ccac.2019.8921068openalex-snapshot
Optimal Assignment of Resources for Distributed Computing in Real-Time Applications
inferred← citeshttps://doi.org/10.1109/comst.2018.2846284openalex-snapshot
Middleware Architectures for the Smart Grid: A Survey on the State-of-the-Art, Taxonomy and Main Open Issues
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417491openalex-snapshot
Virtual Machine Placement via Q-Learning with Function Approximation
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417491openalex-snapshot
Virtual Machine Placement via Q-Learning with Function Approximation
inferred← citeshttps://doi.org/10.1109/icccn.2011.6006007openalex-snapshot
Optimal Client-Server Assignment for Internet Distributed Systems
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848227openalex-snapshot
An approximation algorithm for client assignment in client/server systems
inferred← citeshttps://doi.org/10.1109/tc.2016.2536032openalex-snapshot
Bio-Inspired Load-Balancing Framework for Loosely Coupled Heterogeneous Server Systems
inferred← citeshttps://doi.org/10.1109/tmm.2017.2760627openalex-snapshot
Traffic-Optimized Data Placement for Social Media
inferred← citeshttps://doi.org/10.1109/tnsm.2016.2597269openalex-snapshot
Efficient Client Assignment for Client-Server Systems
inferred← citeshttps://doi.org/10.1109/wsc48552.2020.9383914openalex-snapshot
A Simulation Model for Volunteer Computing Micro-Blogging Services
inferred← citeshttps://doi.org/10.11606/d.55.2012.tde-23012013-094514openalex-snapshot
Avaliação de algoritmos de agrupamento em grafos para segmentação de imagens
inferred← citeshttps://doi.org/10.14445/22315381/ijett-v10p237openalex-snapshot
An Enhanced Client-Server Assignment for Internet Distributed Systems
inferred← citeshttps://doi.org/10.17148/ijarcce.2015.4141openalex-snapshot
Traffic free distributed interactive applications in client assignment problem
inferred← citeshttps://doi.org/10.20868/upm.thesis.47152openalex-snapshot
Contribution to the design, implementation and standardization of semantic middleware architectures for the Smart Grid
inferred← citeshttps://doi.org/10.3934/mbe.2022529openalex-snapshot
Secure access control using updateable attribute keys
inferred← citeshttps://doi.org/10.4018/978-1-7998-5339-8.ch069openalex-snapshot
An Efficient Server Minimization Algorithm for Internet Distributed Systems
inferred← citeshttps://doi.org/10.4018/ijkdb.2017010106openalex-snapshot
Efficient Fault Tolerant Algorithms for Internet Distributed Systems
inferred← citeshttps://doi.org/10.4018/ijrsda.2017010101openalex-snapshot
An Efficient Intra-Server and Inter-Server Load Balancing Algorithm for Internet Distributed Systems
inferred← citeshttps://doi.org/10.4018/ijrsda.2017100102openalex-snapshot
An Efficient Server Minimization Algorithm for Internet Distributed Systems
inferred← citeshttps://doi.org/10.5815/ijeme.2019.06.04openalex-snapshot
Running Google Colaboratory as a server – transferring dynamic data in and out of colabs
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.