scientific article; zbMATH DE number 710624

From MaRDI portal
Publication:4319638

zbMath0825.68147MaRDI QIDQ4319638

Andrew S. Tanenbaum

Publication date: 11 January 1995


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (53)

A Logical Approach to Data-Aware Automated Sequence GenerationRefinement-oriented probability for CSPDesign alternatives for wireless local area networksNearly optimal bounds for distributed wireless scheduling in the SINR modelPerformance analysis of a scheme for concurrency/synchronization using queueing network modelsExplicit-State Model CheckingOn the communication complexity of pollingReal time process algebraInterpreting message flow graphsReliable broadcasts and communication models: tradeoffs and lower boundsCompact separator decompositions in dynamic trees and applications to labeling schemesSYNTHESIS OF PIECEWISE-LINEAR CHAOTIC MAPS: INVARIANT DENSITIES, AUTOCORRELATIONS, AND SWITCHINGA single server queue with gated processor-sharing disciplineSelf avoiding paths routing algorithm in scale-free networksCombined capacity planning and concentrator location in computer communications networksVerification of graph grammars using a logical approachTechniques for pipelined broadcast on Ethernet switched clustersLink scheduling in wireless sensor networks: distributed edge-coloring revisitedThe influence of dependence on data network modelsDeterministic broadcasting in ad hoc radio networksPerformance modeling and optimization of networks of bridged LANsA unified set of proposals for control and design of high speed data networksSynchronization in federation community networksDecomposition algorithms for data placement problem based on Lagrangian relaxation and randomized roundingOn single courier problemTopological Design of Centralized Computer NetworksGreedy Routing via Embedding Graphs onto Semi-metric SpacesState Coverage Metrics for Specification-Based Testing with Büchi AutomataContinuous relaxation for discrete DC programmingSolving the degree-concentrated fault-tolerant spanning subgraph problem by DC programmingPerformance modeling of heterogeneous data networksA CCS-based investigation of deadlock in a multi-process electronic mail systemLiMoSense: live monitoring in dynamic sensor networksIntra-domain traffic engineering with shortest path routing protocolsVariable neighbourhood search for the minimum labelling Steiner tree problemTwo phases encryption and its applicationsA new password authentication mechanism based on two phases encryptionTask assignment in distributed computing systemsDistribution of distinguishable objects to bins: generating all distributionsA Reliability and Performance Model For Static Data Flow MachinesDeveloping Topology Discovery in Event-BGenerating all distributions of objects to binsSpecification and analysis of a composition of protocolsCharacterising Testing Preorders for Broadcasting Distributed SystemsUNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKSNetwork modules help the identification of key transport routes, signaling pathways in cellular and other networksUnnamed ItemUnnamed ItemTHE CONTROL OF STARVATIONPerformance analysis and functional verification of the stop-and-wait protocol in HOLThe paging drum queue: A uniform perspective and further resultsInformation theoretic analysis for a general queueing system at equilibrium with application to queues in tandemUnnamed Item




This page was built for publication: