A tight upper bound on the benefits of replication and consistency control protocols
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reliability analysis of the double counter-rotating ring with concentrator attachments
IEEE/ACM Transactions on Networking (TON)
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The reliability of queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Routing Schemes for Multiple Random Broadcasts in Arbitrary Network Topologies
IEEE Transactions on Parallel and Distributed Systems
IEEE/ACM Transactions on Networking (TON)
Survivability performance analysis of rerouting strategies in an ATM/VP DCS survivable mesh network
ACM SIGCOMM Computer Communication Review
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Fast backtracking principles applied to find new cages
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
High availability path design in ring-based optimal networks
IEEE/ACM Transactions on Networking (TON)
Path set selection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Chain polynomials and Tutte polynomials
Discrete Mathematics
Assessing Reliability of Multistage Interconnection Networks
IEEE Transactions on Computers
Reliability Models for Fault-Tolerant Private Network Applications
IEEE Transactions on Computers
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
IEEE Transactions on Parallel and Distributed Systems
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
Optimal Subcube Fault Tolerance in a Circuit-Switched Hypercube
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Matroid Intersections, Polymatroid Inequalities, and Related Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On Dualization in Products of Forests
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Simulation Algorithm for Source Terminal Communication Network Reliability
SS '96 Proceedings of the 29th Annual Simulation Symposium (SS '96)
Expected value expansions in rooted graphs
Discrete Applied Mathematics
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability
The Journal of Supercomputing
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics
Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics
Journal of Heuristics
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
Combinatorics, Probability and Computing
Zeros of Reliability Polynomials and f-vectors of Matroids
Combinatorics, Probability and Computing
Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
Combinatorics, Probability and Computing
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
Computing the performability of layered distributed systems with a management architecture
WOSP '04 Proceedings of the 4th international workshop on Software and performance
THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY
Probability in the Engineering and Informational Sciences
SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
Probability in the Engineering and Informational Sciences
COUNTEREXAMPLES TO CONJECTURES FOR UNIFORMLY OPTIMALLY RELIABLE GRAPHS
Probability in the Engineering and Informational Sciences
Analyzing the effectiveness of fault-management architectures in layered distributed systems
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
A limit characterization for the number of spanning trees of graphs
Information Processing Letters
The Brown--Colbourn conjecture on zeros of reliability polynomials is false
Journal of Combinatorial Theory Series B
Polynomials with the half-plane property and the support theorems
Journal of Combinatorial Theory Series B
On the inference of semi-coherent structures from data
Computers and Operations Research
A Tutte decomposition for matrices and bimatroids
Journal of Combinatorial Theory Series B
New event-driven sampling techniques for network reliability estimation
WSC '04 Proceedings of the 36th conference on Winter simulation
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
Discrete Applied Mathematics
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
Failed disk recovery in double erasure RAID arrays
Journal of Discrete Algorithms
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Cutsets and anti-chains in linear lattices
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
An interactive augmented max-min MCS-RSM method for the multi-objective network reliability problem
International Journal of Systems Science
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Enumerating spanning and connected subsets in graphs and matroids
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Expected rank and randomness in rooted graphs
Discrete Applied Mathematics
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Combining network reductions and simulation to estimate network reliability
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
A flow-based reliability measure for wireless sensor networks
International Journal of Sensor Networks
Robust routing in networks with time-varying links
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
Combinatorial and computational properties of a diameter constrained network reliability model
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
The Most Reliable Subgraph Problem
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
WSEAS TRANSACTIONS on COMMUNICATIONS
Computers and Operations Research
Network location of a reliable center using the most reliable route policy
Computers and Operations Research
Listing minimal edge-covers of intersecting families with applications to connectivity problems
Discrete Applied Mathematics
International Journal of Network Management
Towards a precise semantics for authenticity and trust
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph
IEICE - Transactions on Information and Systems
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Note on the Recognition of Nested Graphs
Graph Theory, Computational Intelligence and Thought
The availability and reliability of wireless multi-hop networks with stochastic link failures
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The economy of redundancy in wireless multi-hop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Performance analysis of cellular automata Monte Carlo Simulation for estimating network reliability
Expert Systems with Applications: An International Journal
On optimally-λ(3) transitive graphs
Discrete Applied Mathematics
A simple universal generating function method to search for all minimal paths in networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Weighted interlace polynomials
Combinatorics, Probability and Computing
Logarithmic keying of communication networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Efficient traffic loss evaluation for transport backbone networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discrete Applied Mathematics
Information Sciences: an International Journal
Measuring the network robustness by Monte Carlo estimation of shortest path length distribution
Mathematics and Computers in Simulation
Computers and Operations Research
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
Theoretical Computer Science
Overlay routing under geographically correlated failures in distributed event-based systems
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
FlowTrust: trust inference with network flows
Frontiers of Computer Science in China
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Computing diameter constrained reliability of a network with junction points
Automation and Remote Control
Aggregating trust using triangular norms in the keynote trust management system
STM'10 Proceedings of the 6th international conference on Security and trust management
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Designing an optimal network using the cross-entropy method
IDEAL'05 Proceedings of the 6th international conference on Intelligent Data Engineering and Automated Learning
Upper bounds on the connection probability for 2-D meshes and tori
Journal of Parallel and Distributed Computing
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Counting spanning trees and other structures in non-constant-jump circulant graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Unhooking circulant graphs: a combinatorial method for counting spanning trees and other parameters
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Calculating two-terminal reliability in a diameter constrained network with cutnodes
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
Analysis and synthesis problems for network resilience
Mathematical and Computer Modelling: An International Journal
Chip firing and all-terminal network reliability bounds
Discrete Optimization
Reliability analysis of a simple replicated and-fork/and-join graph
Operations Research Letters
Maximizing circle of trust in online social networks
Proceedings of the 23rd ACM conference on Hypertext and social media
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON)
Finding representative nodes in probabilistic graphs
Bisociative Knowledge Discovery
Biomine: a network-structured resource of biological entities for link prediction
Bisociative Knowledge Discovery
Computing transitive closure of bipolar weighted digraphs
Discrete Applied Mathematics
Generating minimal k-vertex connected spanning subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Dependent failures in highly reliable static networks
Proceedings of the Winter Simulation Conference
Graph reductions to speed up importance sampling-based static reliability estimation
Proceedings of the Winter Simulation Conference
Proceedings of the Winter Simulation Conference
Static Network Reliability Estimation via Generalized Splitting
INFORMS Journal on Computing
Learning in probabilistic graphs exploiting language-constrained patterns
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
An overview of algorithms for network survivability
ISRN Communications and Networking
Towards development of an analytical model relating FPGA architecture parameters to routability
ACM Transactions on Reconfigurable Technology and Systems (TRETS) - Special Section on 19th Reconfigurable Architectures Workshop (RAW 2012)
Mincuts in generalized Fibonacci graphs of degree 3
Journal of Computational Methods in Sciences and Engineering
International Journal of Metaheuristics
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |