The Complexity of Enumeration and Reliability Problems
Abstract
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In
Copyright
History
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Fair integer programming under dichotomous and cardinal preferencesEuropean Journal of Operational Research, Vol. 320, No. 3 | 1 Feb 2025
- Weighted automata and logics meet computational complexityInformation and Computation, Vol. 301 | 1 Dec 2024
- A survey on checkpointing strategies: Should we always checkpoint à la Young/Daly?Future Generation Computer Systems, Vol. 161 | 1 Dec 2024
- Generating minimal redundant and maximal irredundant subhypergraphsDiscrete Applied Mathematics, Vol. 358 | 1 Dec 2024
- Counting Subgraphs in Somewhere Dense GraphsSIAM Journal on Computing, Vol. 53, No. 5 | 27 September 2024
- On measuring inconsistency in graph databases with regular path constraintsArtificial Intelligence, Vol. 335 | 1 Oct 2024
- On the benefits of knowledge compilation for feature-model analysesAnnals of Mathematics and Artificial Intelligence, Vol. 92, No. 5 | 6 November 2023
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languagesAnnals of Mathematics and Artificial Intelligence, Vol. 92, No. 5 | 3 June 2024
- International Competition on Graph Counting Algorithms 2023IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E107.A, No. 9 | 1 Sep 2024
- Which Coefficients Matter Most—Consecutive $k$-Out-of-$n$:$F$ Systems RevisitedIEEE Transactions on Reliability, Vol. 73, No. 3 | 1 Sep 2024
- Counting the number of solutions in satisfiability problems with tensor-network message passingPhysical Review E, Vol. 110, No. 3 | 24 September 2024
- Enumeration of multivariate independence polynomial for iterations of Sierpinski triangle graphThe European Physical Journal Special Topics, Vol. 12 | 26 August 2024
- Hardening Active Directory Graphs via Evolutionary Diversity Optimization based PoliciesACM Transactions on Evolutionary Learning and Optimization, Vol. 33 | 12 August 2024
- A Graphical #SAT Algorithm for Formulae with Small Clause DensityElectronic Proceedings in Theoretical Computer Science, Vol. 406 | 12 August 2024
- A Scalable t-Wise Coverage Estimator: Algorithms and ApplicationsIEEE Transactions on Software Engineering, Vol. 50, No. 8 | 1 Aug 2024
- Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet InequalitiesMathematics of Operations Research, Vol. 49, No. 3 | 1 Aug 2024
- Computational complexity of counting coincidencesTheoretical Computer Science | 1 Aug 2024
- Reusing d-DNNFs for Efficient Feature-Model CountingACM Transactions on Software Engineering and Methodology, Vol. 17 | 30 July 2024
- Tractable Circuits in Database TheoryACM SIGMOD Record, Vol. 53, No. 2 | 31 July 2024
- An optimization‐based Monte Carlo method for estimating the two‐terminal survival signature of networks with two component classesNaval Research Logistics (NRL), Vol. 77 | 28 July 2024
- Complexity Classification of Counting Graph Homomorphisms Modulo a Prime NumberSIAM Journal on Computing, Vol. 0, No. 0 | 1 July 2024
- Misinformation blocking maximization in online social networksMultimedia Tools and Applications, Vol. 83, No. 23 | 9 January 2024
- On computing small variable disjunction branch-and-bound treesMathematical Programming, Vol. 206, No. 1-2 | 13 May 2023
- Efficient Betweenness Centrality Computation over Large Heterogeneous Information NetworksProceedings of the VLDB Endowment, Vol. 17, No. 11 | 30 August 2024
- The ACPATH Structural Complexity Metric2024 IEEE 24th International Conference on Software Quality, Reliability and Security (QRS) | 1 Jul 2024
- Database Repairing with Soft Functional DependenciesACM Transactions on Database Systems, Vol. 49, No. 2 | 10 April 2024
- Hypergraph Horn FunctionsSIAM Journal on Discrete Mathematics, Vol. 38, No. 2 | 2 May 2024
- Quantitative Robustness for Vulnerability AssessmentProceedings of the ACM on Programming Languages, Vol. 8, No. PLDI | 20 June 2024
- Lifted algorithms for symmetric weighted first-order model samplingArtificial Intelligence, Vol. 331 | 1 Jun 2024
- Flexible Paths: A Path Planning Approach to Dynamic NavigationIEEE Transactions on Intelligent Transportation Systems, Vol. 25, No. 6 | 1 Jun 2024
- Flow-Network-Based Method for the Reliability Analysis of Decentralized Power System Topologies With a Sequential Monte-Carlo SimulationIEEE Transactions on Reliability, Vol. 73, No. 2 | 1 Jun 2024
- Fast Query Answering by Labeling Index on Uncertain Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE) | 13 May 2024
- LearnSC: An Efficient and Unified Learning-Based Framework for Subgraph Counting Problem2024 IEEE 40th International Conference on Data Engineering (ICDE) | 13 May 2024
- IVE: Accelerating Enumeration-Based Subgraph Matching via Exploring Isolated Vertices2024 IEEE 40th International Conference on Data Engineering (ICDE) | 13 May 2024
- Social disruption games in signed networksCommunications in Nonlinear Science and Numerical Simulation, Vol. 132 | 1 May 2024
- Proper colorability of segment intersection graphsJournal of Combinatorial Optimization, Vol. 47, No. 4 | 5 May 2024
- Ising model partition-function computation as a weighted counting problemPhysical Review E, Vol. 109, No. 5 | 6 May 2024
- Energy Formulation for Infinite Structures: Order Parameter for Percolation, Critical Bonds, and Power-Law Scaling of Contact-Based TransportPhysical Review Letters, Vol. 132, No. 19 | 7 May 2024
- Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity BoundsACM Transactions on Algorithms, Vol. 20, No. 2 | 13 February 2024
- Algorithmic aspects of temporal betweennessNetwork Science, Vol. 9 | 12 April 2024
- Unit Testing in ASP Revisited: Language and Test-Driven Development EnvironmentTheory and Practice of Logic Programming, Vol. 5 | 2 April 2024
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flowsComputers & Operations Research, Vol. 163 | 1 Mar 2024
- Influence Maximization via Vertex CounteringProceedings of the VLDB Endowment, Vol. 17, No. 6 | 3 May 2024
- Exponential Time Complexity of the Complex Weighted Boolean #CSPComputing and Combinatorics | 9 December 2023
- Top-k Graph Similarity Search Algorithm Based on Chi-Square Statistics in Probabilistic GraphsElectronics, Vol. 13, No. 1 | 1 January 2024
- Does Isolating High-Modularity Communities Prevent Cascading Failure?Complex Networks & Their Applications XII | 29 February 2024
- Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction ProblemsIntelligent Computing | 15 June 2024
- Formally Certified Approximate Model CountingComputer Aided Verification | 26 July 2024
- What is a combinatorial interpretation?Open Problems in Algebraic Combinatorics | 1 Jan 2024
- Coyan: Fault Tree Analysis – Exact and ScalableComputer Safety, Reliability, and Security | 9 September 2024
- Is P equal to NP? Answer and Method to solve puzzles with God's algorithmLATAM Revista Latinoamericana de Ciencias Sociales y Humanidades, Vol. 4, No. 6 | 11 December 2023
- Structure of single-peaked preferencesJournal of Mathematical Psychology, Vol. 117 | 1 Dec 2023
- Lifted inference with tree axiomsArtificial Intelligence, Vol. 324 | 1 Nov 2023
- Enhance Rumor Controlling Algorithms Based on Boosting and Blocking Users in Social NetworksIEEE Transactions on Computational Social Systems, Vol. 10, No. 5 | 1 Oct 2023
- Model Counting Meets F0 EstimationACM Transactions on Database Systems, Vol. 48, No. 3 | 9 August 2023
- Efficient and Generic Algorithms for Quantitative Attack Tree AnalysisIEEE Transactions on Dependable and Secure Computing, Vol. 20, No. 5 | 1 Sep 2023
- Model Counting Meets Distinct ElementsCommunications of the ACM, Vol. 66, No. 9 | 23 August 2023
- Picturing Counting Reductions with the ZH-CalculusElectronic Proceedings in Theoretical Computer Science, Vol. 384 | 30 August 2023
- Mining frequent generators and closures in data streams with FGC-StreamKnowledge and Information Systems, Vol. 65, No. 8 | 3 April 2023
- Smoothed counting of 0–1 points in polyhedraRandom Structures & Algorithms, Vol. 63, No. 1 | 30 December 2022
- Growing Directed Acyclic Graphs: Optimization Functions for Pathway Reconstruction AlgorithmsJournal of Computational Biology, Vol. 30, No. 7 | 1 Jul 2023
- Multimodal Vaccine Distribution Network Design with DronesTransportation Science, Vol. 57, No. 4 | 1 Jul 2023
- Matrix permanent and determinant from a spin systemPhysical Review A, Vol. 108, No. 1 | 19 July 2023
- Parameterized Counting and Cayley Graph ExpandersSIAM Journal on Discrete Mathematics, Vol. 37, No. 2 | 26 April 2023
- Discrete Optimal Transport with Independent Marginals is #P-HardSIAM Journal on Optimization, Vol. 33, No. 2 | 1 June 2023
- Shortest Paths Discovery in Uncertain Networks via Transfer LearningProceedings of the ACM on Management of Data, Vol. 1, No. 2 | 20 June 2023
- Multi-Topology Routing based traffic optimization for IEEE 802.1 Time Sensitive NetworkingReal-Time Systems, Vol. 59, No. 2 | 6 March 2023
- Solving independent set problems with photonic quantum circuitsProceedings of the National Academy of Sciences, Vol. 120, No. 22 | 22 May 2023
- Exact and Efficient Network Reliability Evaluation per Outage ScaleICC 2023 - IEEE International Conference on Communications | 28 May 2023
- Probabilistic Reasoning at Scale: Trigger Graphs to the RescueProceedings of the ACM on Management of Data, Vol. 1, No. 1 | 30 May 2023
- A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability MeasureIEEE INFOCOM 2023 - IEEE Conference on Computer Communications | 17 May 2023
- Approximately Counting Independent Sets of a Given Size in Bounded-Degree GraphsSIAM Journal on Computing, Vol. 52, No. 2 | 26 April 2023
- On the Roots of a Family of PolynomialsFractal and Fractional, Vol. 7, No. 4 | 19 April 2023
- M5: Multi-modal Multi-task Model Mapping on Multi-FPGA with Accelerator Configuration Search2023 Design, Automation & Test in Europe Conference & Exhibition (DATE) | 1 Apr 2023
- Global Routing Optimization In Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE) | 1 Apr 2023
- PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE) | 1 Apr 2023
- Most Probable Densest Subgraphs2023 IEEE 39th International Conference on Data Engineering (ICDE) | 1 Apr 2023
- Towards Efficient Shortest Path Counting on Billion-Scale Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE) | 1 Apr 2023
- Time-bounded targeted influence spread in online social networksMultimedia Tools and Applications, Vol. 82, No. 6 | 29 June 2022
- A dichotomy for bounded degree graph homomorphisms with nonnegative weightsJournal of Computer and System Sciences, Vol. 132 | 1 Mar 2023
- Optimal balanced chain decomposition of partially ordered sets with applications to operating cost minimization in aircraft routing problemsPublic Transport, Vol. 15, No. 1 | 5 September 2022
- Identification of Key Components After Unintentional Failures for Cascading Failure ProtectionIEEE Transactions on Network Science and Engineering, Vol. 10, No. 2 | 1 Mar 2023
- Applying Machine Learning Methods to Improve All-Terminal Network Reliability2023 Annual Reliability and Maintainability Symposium (RAMS) | 23 Jan 2023
- Little tricks leading to a significant acceleration of the calculation of the reliability of a random graph2023 17th International Conference on Ubiquitous Information Management and Communication (IMCOM) | 3 Jan 2023
- Bridging Reliability to Efficiency Consecutive Elegant and Simple DesignIntelligent Methods Systems and Applications in Computing, Communications and Control | 25 September 2022
- On the Roots of Certain Reliability PolynomialsIntelligent Methods Systems and Applications in Computing, Communications and Control | 25 September 2022
- Using Delta-Wye Transformations for Estimating Networks’ ReliabilityIntelligent Methods Systems and Applications in Computing, Communications and Control | 25 September 2022
- Community Detection Using Moore-Shannon Network Reliability: Application to Food NetworksComplex Networks and Their Applications XI | 26 January 2023
- Attribution-Scores and Causal Counterfactuals as Explanations in Artificial IntelligenceReasoning Web. Causality, Explanations and Declarative Knowledge | 28 April 2023
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEBFractals, Vol. 31, No. 03 | 25 March 2023
- Rounding Meets Approximate Model CountingComputer Aided Verification | 18 July 2023
- Attribution-Scores in Data Management and Explainable Machine LearningAdvances in Databases and Information Systems | 28 August 2023
- Consecutive Systems Asymptotic Threshold BehaviorsSoft Computing Applications | 27 October 2023
- Power of Counting by Nonuniform Families of Polynomial-Size Finite AutomataFundamentals of Computation Theory | 21 September 2023
- Extending Defeasible Reasoning Beyond Rational ClosureArtificial Intelligence Research | 29 November 2023
- Co-location Pattern Mining Under the Spatial Structure ConstraintDatabase and Expert Systems Applications | 18 August 2023
- Solving Projected Model Counting by Utilizing Treewidth and its LimitsArtificial Intelligence, Vol. 314 | 1 Jan 2023
- Optimizing network microsegmentation policy for cyber resilienceThe Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, Vol. 20, No. 1 | 8 October 2021
- Exact and Scalable Network Reliability Evaluation for Probabilistic Correlated FailuresGLOBECOM 2022 - 2022 IEEE Global Communications Conference | 4 Dec 2022
- Alternative method of counting the number of efficient paths in a transportation networkTransportmetrica A: Transport Science, Vol. 18, No. 3 | 15 June 2021
- On computing Banzhaf power index for k-edge connectivity in graphsSocial Network Analysis and Mining, Vol. 12, No. 1 | 29 October 2022
- On the Capacity of Families of Characteristic Functions That Ensure Diagnostic Problems Are Solved CorrectlyScientific and Technical Information Processing, Vol. 49, No. 5 | 6 March 2023
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friendNetworks, Vol. 80, No. 4 | 16 April 2022
- Uniformly optimally reliable graphs: A surveyNetworks, Vol. 80, No. 4 | 6 December 2021
- Counting the Answers to a QueryACM SIGMOD Record, Vol. 51, No. 3 | 21 November 2022
- Adaptive Bin Packing with OverflowMathematics of Operations Research, Vol. 47, No. 4 | 1 Nov 2022
- Belief propagation on the random k-SAT modelThe Annals of Applied Probability, Vol. 32, No. 5 | 1 Oct 2022
- Guest column: A panorama of counting problems the decision version of which is in P 3ACM SIGACT News, Vol. 53, No. 3 | 30 August 2022
- Opinion influence maximization problem in online social networks based on group polarization effectInformation Sciences, Vol. 609 | 1 Sep 2022
- Compression with wildcards: abstract simplicial complexesQuaestiones Mathematicae, Vol. 64 | 1 September 2022
- Exact reliability optimization for series‐parallel graphs using convex envelopesNetworks, Vol. 80, No. 2 | 27 January 2022
- Polynomial-time algorithms for multimarginal optimal transport problems with structureMathematical Programming, Vol. 60 | 16 August 2022
- Influence Maximization for Emergency Information Diffusion in Social Internet of VehiclesIEEE Transactions on Vehicular Technology, Vol. 71, No. 8 | 1 Aug 2022
- ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivationJournal of Systems Architecture, Vol. 129 | 1 Aug 2022
- Counting Complexity of Reachability Problem for Boolean Control Networks with Free Control Sequence2022 41st Chinese Control Conference (CCC) | 25 Jul 2022
- Quantum- Inspired Structure- Preserving Probabilistic Inference2022 IEEE Congress on Evolutionary Computation (CEC) | 18 Jul 2022
- Some Combinatorial Problems in Power-Law GraphsThe Computer Journal, Vol. 65, No. 7 | 27 March 2021
- Optimal Partial Observation for Estimating Network Connectivity2022 American Control Conference (ACC) | 8 Jun 2022
- A Multi-Objective Approach for Security Hardening and Probabilistic Vulnerability Assessment on Attack Graphs2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC) | 1 Jun 2022
- Efficient shortest path counting on large road networksProceedings of the VLDB Endowment, Vol. 15, No. 10 | 1 Jun 2022
- Fast reliability ranking of matchstick minimal networksNetworks, Vol. 79, No. 4 | 10 June 2021
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networksTheoretical Computer Science, Vol. 923 | 1 Jun 2022
- Counting dominating sets in some subclasses of bipartite graphsTheoretical Computer Science, Vol. 923 | 1 Jun 2022
- Model Counting Meets Distinct Elements in a Data StreamACM SIGMOD Record, Vol. 51, No. 1 | 31 May 2022
- Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-OneThe Computer Journal, Vol. 65, No. 5 | 4 March 2021
- Impact of Link Availability Uncertainty on Network Reliability: Analyses with VariancesICC 2022 - IEEE International Conference on Communications | 16 May 2022
- Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach2022 IEEE 38th International Conference on Data Engineering (ICDE) | 1 May 2022
- Maximizing Time-aware Welfare for Mixed Items2022 IEEE 38th International Conference on Data Engineering (ICDE) | 1 May 2022
- Maximal clique enumeration problem on graphs: status and challengesSCIENTIA SINICA Informationis, Vol. 52, No. 5 | 14 April 2022
- Completeness, approximability and exponential time results for counting problems with easy decision versionTheoretical Computer Science, Vol. 915 | 1 May 2022
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean DomainSIAM Journal on Computing, Vol. 51, No. 2 | 5 November 2019
- Counting Small Induced Subgraphs Satisfying Monotone PropertiesSIAM Journal on Computing, Vol. 0, No. 0 | 11 April 2022
- MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKSProbability in the Engineering and Informational Sciences, Vol. 36, No. 2 | 20 November 2020
- Bound Inference and Reinforcement Learning-Based Path Construction in Bandwidth TomographyIEEE/ACM Transactions on Networking, Vol. 30, No. 2 | 1 Apr 2022
- Classical Simulation of Quantum Circuits by Half Gauss SumsCommunications in Mathematical Physics, Vol. 390, No. 2 | 31 January 2022
- Abduction with probabilistic logic programming under the distribution semanticsInternational Journal of Approximate Reasoning, Vol. 142 | 1 Mar 2022
- Optimizations for Computing Relatedness in Biomedical Heterogeneous Information Networks: SemNet 2.0Big Data and Cognitive Computing, Vol. 6, No. 1 | 1 March 2022
- Computing the execution probability of jobs with replication in mixed-criticality schedulesAnnals of Operations Research, Vol. 309, No. 1 | 1 January 2022
- MAJORITY-3SAT (and Related Problems) in Polynomial Time2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- Reliability Maximization in Uncertain GraphsIEEE Transactions on Knowledge and Data Engineering, Vol. 34, No. 2 | 1 Feb 2022
- Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap PercolationAutomata and Complexity | 20 April 2022
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound ProofsInteger Programming and Combinatorial Optimization | 27 May 2022
- Projected Model Counting: Beyond Independent SupportAutomated Technology for Verification and Analysis | 21 October 2022
- Constructing driver Hamiltonians for optimization problems with linear constraintsQuantum Science and Technology, Vol. 7, No. 1 | 25 November 2021
- A Review on Optimal Energy Management of Multimicrogrid System Considering UncertaintiesIEEE Access, Vol. 10 | 1 Jan 2022
- Network Reliability, Performability Metrics, Rare Events and Standard Monte CarloAdvances in Modeling and Simulation | 1 December 2022
- Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum CompromiseMulti-Agent Systems | 11 December 2022
- AI Techniques for Forecasting Epidemic Dynamics: Theory and PracticeArtificial Intelligence in Covid-19 | 10 November 2022
- Fast controlling of rumors with limited cost in social networksComputer Communications, Vol. 182 | 1 Jan 2022
- Exploiting Partial Observability for Optimal DeceptionIEEE Transactions on Automatic Control, Vol. 231 | 1 Jan 2022
- An Exact Method for the Minimum Feedback Arc Set ProblemACM Journal of Experimental Algorithmics, Vol. 26 | 23 April 2021
- FGC-Stream: A novel joint miner for frequent generators and closed itemsets in data streams2021 IEEE International Conference on Data Mining (ICDM) | 1 Dec 2021
- Efficient Network Reliability Evaluation for Client-Server Model2021 IEEE Global Communications Conference (GLOBECOM) | 1 Dec 2021
- Generalized Convexity Properties and Shape-Based Approximation in Networks ReliabilityMathematics, Vol. 9, No. 24 | 9 December 2021
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKETFractals, Vol. 29, No. 07 | 16 September 2021
- Aptenodytes Forsteri Optimization: Algorithm and applicationsKnowledge-Based Systems, Vol. 232 | 1 Nov 2021
- The Complexity of Counting Problems Over Incomplete DatabasesACM Transactions on Computational Logic, Vol. 22, No. 4 | 8 September 2021
- Path-integral formulation of spreading processes in complex networksThe European Physical Journal Special Topics, Vol. 230, No. 14-15 | 19 June 2021
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi HypergraphsSIAM Journal on Computing, Vol. 0, No. 0 | 14 September 2021
- On the scalability of building binary decision diagrams for current feature modelsProceedings of the 25th ACM International Systems and Software Product Line Conference - Volume A | 6 September 2021
- Tensor Network Rewriting Strategies for Satisfiability and CountingElectronic Proceedings in Theoretical Computer Science, Vol. 340 | 6 September 2021
- Efficient Hop-constrained s-t Simple Path EnumerationThe VLDB Journal, Vol. 30, No. 5 | 8 May 2021
- Computational complexity of three-dimensional discrete tomography with missing dataJapan Journal of Industrial and Applied Mathematics, Vol. 38, No. 3 | 25 March 2021
- Efficient Approximation of Two-Terminal Networks Reliability Polynomials Using Cubic SplinesIEEE Transactions on Reliability, Vol. 70, No. 3 | 1 Sep 2021
- Cognitively-constrained learning from neighborsGames and Economic Behavior, Vol. 129 | 1 Sep 2021
- A Model for Tacit Communication in Collaborative Human-UAV Search-and-RescueEntropy, Vol. 23, No. 8 | 10 August 2021
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore ModelSIAM Journal on Computing, Vol. 0, No. 0 | 12 July 2021
- Sequential stratified splitting for efficient Monte Carlo integrationSequential Analysis, Vol. 40, No. 3 | 13 September 2021
- Calculating the number of Hamilton cycles in layered polyhedral graphsComputational and Mathematical Methods, Vol. 3, No. 4 | 12 January 2021
- Reliability and importance measure analysis of networks with shared risk link groupsReliability Engineering & System Safety, Vol. 211 | 1 Jul 2021
- The Rank-One Quadratic Assignment ProblemINFORMS Journal on Computing, Vol. 33, No. 3 | 1 Jul 2021
- Rumors clarification with minimum credibility in social networksComputer Networks, Vol. 193 | 1 Jul 2021
- The number of satisfying assignments of random 2‐SAT formulasRandom Structures & Algorithms, Vol. 58, No. 4 | 17 January 2021
- Responsibility and verification: Importance value in temporal logics2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 29 Jun 2021
- Controlling the Maximum Link Estimation Error in Network Performance Tomography2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS) | 25 Jun 2021
- Model Counting meets F 0 EstimationProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 June 2021
- When is approximate counting for conjunctive queries tractable?Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- When the Recursive Diversity Anonymity Meets the Ring SignatureProceedings of the 2021 International Conference on Management of Data | 18 June 2021
- A proactive route planning approach to navigation errorsInternational Journal of Geographical Information Science, Vol. 35, No. 6 | 22 September 2020
- Probabilistic Tractable Models in Mixed Discrete-Continuous DomainsData Intelligence, Vol. 3, No. 2 | 2 June 2021
- Parameterized Counting of Partially Injective HomomorphismsAlgorithmica, Vol. 83, No. 6 | 11 March 2021
- Bound Inference and Reinforcement Learning-based Path Construction in Bandwidth TomographyIEEE INFOCOM 2021 - IEEE Conference on Computer Communications | 10 May 2021
- Permanental generating functions and sequential importance samplingAdvances in Applied Mathematics, Vol. 126 | 1 May 2021
- Genetic Algorithms for Drain Placement in Wireless Sensor Networks Optimal by the Reliability CriterionOptoelectronics, Instrumentation and Data Processing, Vol. 57, No. 3 | 25 October 2021
- Uniformly Most Reliable Three-Terminal Graph of Dense GraphsMathematical Problems in Engineering, Vol. 2021 | 19 Apr 2021
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphsDiscrete Mathematics, Algorithms and Applications, Vol. 13, No. 02 | 5 October 2020
- LachesisProceedings of the VLDB Endowment, Vol. 14, No. 8 | 21 October 2021
- Shortest Alternative Path Finding on Road Network2021 IEEE 3rd Global Conference on Life Sciences and Technologies (LifeTech) | 9 Mar 2021
- Tropical Tensor Network for Ground States of Spin GlassesPhysical Review Letters, Vol. 126, No. 9 | 5 March 2021
- Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV NetworksIEEE Transactions on Network and Service Management, Vol. 18, No. 1 | 1 Mar 2021
- Bayesian Importance Measures for Network Edges Under Saturated Lagrangian Poisson FailuresIEEE Transactions on Reliability, Vol. 70, No. 1 | 1 Mar 2021
- Shortest paths and centrality in uncertain networksProceedings of the VLDB Endowment, Vol. 14, No. 7 | 12 April 2021
- Rumor correction maximization problem in social networksTheoretical Computer Science, Vol. 861 | 1 Mar 2021
- Fairness in machine learning with tractable modelsKnowledge-Based Systems, Vol. 215 | 1 Mar 2021
- Applications of #SAT Solvers on Feature Models15th International Working Conference on Variability Modelling of Software-Intensive Systems | 9 February 2021
- Time-Constrained Adaptive Influence MaximizationIEEE Transactions on Computational Social Systems, Vol. 8, No. 1 | 1 Feb 2021
- Probabilistic Security for Multirobot SystemsIEEE Transactions on Robotics, Vol. 37, No. 1 | 1 Feb 2021
- Resilience in an Evolving Electrical GridEnergies, Vol. 14, No. 3 | 29 January 2021
- A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based NetworksSIAM Journal on Discrete Mathematics, Vol. 35, No. 4 | 19 October 2021
- On Posets for Reliability: How Fine Can They Be?Soft Computing Applications | 15 August 2020
- Tight Bounds on the Coefficients of Consecutive k-out-of-n:F SystemsIntelligent Methods in Computing, Communications and Control | 28 July 2020
- Experimenting with Beta Distributions for Approximating Hammocks’ ReliabilityIntelligent Methods in Computing, Communications and Control | 28 July 2020
- The Shape of the Reliability Polynomial of a Hammock NetworkIntelligent Methods in Computing, Communications and Control | 28 July 2020
- Uncertain Spatial Data Management: An OverviewHandbook of Big Geospatial Data | 17 December 2020
- New Challenges and Opportunities in Reliability Engineering of Complex Technical SystemsReliability Engineering and Computational Intelligence | 7 August 2021
- On the Usefulness of Linear Modular Arithmetic in Constraint ProgrammingIntegration of Constraint Programming, Artificial Intelligence, and Operations Research | 17 June 2021
- Counting Minimal Unsatisfiable SubsetsComputer Aided Verification | 15 July 2021
- Barnette’s Conjecture Through the Lens of the $$Mod_{k}P$$ Complexity ClassesDiscrete and Computational Geometry, Graphs, and Games | 29 October 2021
- ESampler: Efficient Sampling of Satisfying Assignments for Boolean FormulasDependable Software Engineering. Theories, Tools, and Applications | 18 November 2021
- Reliability assessment of a stochastic air transport network with late arrivalsComputers & Industrial Engineering, Vol. 151 | 1 Jan 2021
- Twin-Component Near-Pareto Routing Optimization for AANETs in the North-Atlantic Region Relying on Real Flight StatisticsIEEE Open Journal of Vehicular Technology, Vol. 2 | 1 Jan 2021
- Four Input Sorter Good, Larger Ones Not So GoodIEEE Transactions on Nanotechnology, Vol. 20 | 1 Jan 2021
- On locally most reliable three-terminal graphs of sparse graphsAIMS Mathematics, Vol. 6, No. 7 | 1 Jan 2021
- Network reliability: Heading out on the highwayNetworks, Vol. 77, No. 1 | 14 August 2020
- Reliability-Aware Multipath Routing of Time-Triggered Traffic in Time-Sensitive NetworksElectronics, Vol. 10, No. 2 | 8 January 2021
- A multi-objective model for identifying valuable nodes in complex networks with minimum costCluster Computing, Vol. 23, No. 4 | 2 January 2020
- A structured view on weighted counting with relations to counting, quantum computation and applicationsInformation and Computation, Vol. 275 | 1 Dec 2020
- Fixed-parameter tractable algorithms for Tracking Shortest PathsTheoretical Computer Science, Vol. 846 | 1 Dec 2020
- A Dichotomy for Real Boolean Holant Problems2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Counting Small Induced Subgraphs Satisfying Monotone Properties2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Some Estimates of Computational Complexity When Predicting the Properties of New Objects Using Characteristic FunctionsAutomatic Documentation and Mathematical Linguistics, Vol. 54, No. 6 | 26 February 2021
- Selecting Influential Features by a Learnable Content-Aware Linear Threshold ModelProceedings of the 29th ACM International Conference on Information & Knowledge Management | 19 October 2020
- Diverse Enumeration of Maximal CliquesProceedings of the 29th ACM International Conference on Information & Knowledge Management | 19 October 2020
- Optimizing mmWave Wireless Backhaul SchedulingIEEE Transactions on Mobile Computing, Vol. 19, No. 10 | 1 Oct 2020
- Target users' activation probability maximization with different seed set constraints in social networksTheoretical Computer Science, Vol. 838 | 1 Oct 2020
- The Approximability of Multiple Facility Location on Directed Networks with Random Arc FailuresAlgorithmica, Vol. 82, No. 9 | 11 March 2020
- Finding k-shortest paths with limited overlapThe VLDB Journal, Vol. 29, No. 5 | 21 February 2020
- MAP Inference for Probabilistic Logic ProgrammingTheory and Practice of Logic Programming, Vol. 20, No. 5 | 21 September 2020
- A Binding Algorithm of Lower Boundary Points Generation for Network Reliability EvaluationIEEE Transactions on Reliability, Vol. 69, No. 3 | 1 Sep 2020
- Algorithmic Aspects of Temporal BetweennessProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining | 20 August 2020
- Robustness of the Young/Daly formula for stochastic iterative applications49th International Conference on Parallel Processing - ICPP | 17 August 2020
- Bound Inference in Network Performance Tomography With Additive MetricsIEEE/ACM Transactions on Networking, Vol. 28, No. 4 | 1 Aug 2020
- Sparse Hashing for Scalable Approximate Model CountingProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 8 July 2020
- Abstracting probabilistic models: Relations, constraints and beyondKnowledge-Based Systems, Vol. 199 | 1 Jul 2020
- Industrial Network Topology Generation with Genetic Algorithms2020 International Young Engineers Forum (YEF-ECE) | 1 Jul 2020
- Counting Problems over Incomplete DatabasesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 29 May 2020
- Queries with Arithmetic on Incomplete DatabasesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 29 May 2020
- Probabilistic Databases for AllProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 29 May 2020
- Causality-based Explanation of Classification OutcomesProceedings of the Fourth International Workshop on Data Management for End-to-End Machine Learning | 14 June 2020
- The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic ApproachesProceedings of the 2020 ACM SIGMOD International Conference on Management of Data | 11 June 2020
- Hub Labeling for Shortest Path CountingProceedings of the 2020 ACM SIGMOD International Conference on Management of Data | 11 June 2020
- Maximizing Boosted Influence Spread with Edge Addition in Online Social NetworksACM/IMS Transactions on Data Science, Vol. 1, No. 2 | 30 May 2020
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic AlgorithmsOperations Research, Vol. 68, No. 3 | 1 May 2020
- Improving user specifications for robot behavior through active preference learning: Framework and evaluationThe International Journal of Robotics Research, Vol. 39, No. 6 | 18 March 2020
- Location of zeros for the partition function of the Ising model on bounded degree graphsJournal of the London Mathematical Society, Vol. 101, No. 2 | 5 November 2019
- Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain PrivacyIEICE Transactions on Communications, Vol. E103.B, No. 4 | 1 Apr 2020
- Efficient Enumeration Algorithms for Regular Document SpannersACM Transactions on Database Systems, Vol. 45, No. 1 | 8 February 2020
- Path Puzzles: Discrete Tomography with a Path Constraint is HardGraphs and Combinatorics, Vol. 36, No. 2 | 26 September 2019
- Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar GraphsGraphs and Combinatorics, Vol. 36, No. 2 | 5 October 2019
- Beyond non-backtracking: non-cycling network centrality measuresProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 476, No. 2235 | 11 March 2020
- A survey of uncertain data managementFrontiers of Computer Science, Vol. 14, No. 1 | 6 September 2018
- The complexity of planar Boolean #CSP with complex weightsJournal of Computer and System Sciences, Vol. 107 | 1 Feb 2020
- The Power of Self-Reducibility: Selectivity, Information, and ApproximationComplexity and Approximation | 21 February 2020
- A Study of Symmetry Breaking Predicates and Model CountingTools and Algorithms for the Construction and Analysis of Systems | 17 April 2020
- Hyper-Parameter-Free Generative Modelling with Deep Boltzmann TreesMachine Learning and Knowledge Discovery in Databases | 30 April 2020
- On the Sparsity of XORs in Approximate Model CountingTheory and Applications of Satisfiability Testing – SAT 2020 | 26 June 2020
- Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and SamplingComputer Aided Verification | 14 July 2020
- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join TreesPrinciples and Practice of Constraint Programming | 2 September 2020
- A Faster Exact Algorithm to Count X3SAT SolutionsPrinciples and Practice of Constraint Programming | 2 September 2020
- Multi-speed Gearbox Synthesis Using Global Search and Non-convex OptimizationIntegration of Constraint Programming, Artificial Intelligence, and Operations Research | 19 September 2020
- Enumerative Branching with Less RepetitionIntegration of Constraint Programming, Artificial Intelligence, and Operations Research | 19 September 2020
- Multi-Topic Misinformation Blocking With Budget Constraint on Online Social NetworksIEEE Access, Vol. 8 | 1 Jan 2020
- О некоторых оценках сложности вычислений при прогнозировании свойств новых объектов средствами характеристических функцийНаучно-техническая информация. Серия 2: Информационные процессы и системы, No. 12 | 1 Jan 2020
- Community based acceptance probability maximization for target users on social networks: Algorithms and analysisTheoretical Computer Science, Vol. 803 | 1 Jan 2020
- Parameterized Optimization in Uncertain Graphs—A Survey and Some ResultsAlgorithms, Vol. 13, No. 1 | 19 December 2019
- Dichotomies for Evaluating Simple Regular Path QueriesACM Transactions on Database Systems, Vol. 44, No. 4 | 15 October 2019
- Multi-period process flexibility with inventoryFlexible Services and Manufacturing Journal, Vol. 31, No. 4 | 11 March 2019
- Identifying influential nodes based on ant colony optimization to maximize profit in social networksSwarm and Evolutionary Computation, Vol. 51 | 1 Dec 2019
- Percolation Is OddPhysical Review Letters, Vol. 123, No. 23 | 3 December 2019
- Counting dominating sets in generalized series-parallel graphsDiscrete Mathematics, Algorithms and Applications, Vol. 11, No. 06 | 19 December 2019
- Combinatorial properties of Farey graphsTheoretical Computer Science, Vol. 796 | 1 Dec 2019
- Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation ModelsInformation, Vol. 10, No. 12 | 25 November 2019
- Minimum budget for misinformation blocking in online social networksJournal of Combinatorial Optimization, Vol. 38, No. 4 | 25 July 2019
- Principled network reliability approximation: A counting-based approachReliability Engineering & System Safety, Vol. 191 | 1 Nov 2019
- The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2019
- On the Problem of Medical Diagnostic Evidence: Intelligent Analysis of Empirical Data on Patients in Samples of Limited SizeAutomatic Documentation and Mathematical Linguistics, Vol. 53, No. 6 | 26 February 2020
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexityArtificial Intelligence, Vol. 276 | 1 Nov 2019
- The complexity of solution-free sets of integers for general linear equationsDiscrete Applied Mathematics, Vol. 270 | 1 Nov 2019
- Not all FPRASs are equal: demystifying FPRASs for DNF-countingConstraints, Vol. 24, No. 3-4 | 26 December 2018
- MIDAS: Multilinear detection at scaleJournal of Parallel and Distributed Computing, Vol. 132 | 1 Oct 2019
- A Deep Learning Approach for Probabilistic Security in Multi-Robot TeamsIEEE Robotics and Automation Letters, Vol. 4, No. 4 | 1 Oct 2019
- On the complexity of inconsistency measurementArtificial Intelligence, Vol. 275 | 1 Oct 2019
- Reliability Analysis for Disjoint PathsIEEE Transactions on Reliability, Vol. 68, No. 3 | 1 Sep 2019
- Efficient construction of binary decision diagrams for network reliability with imperfect verticesReliability Engineering & System Safety, Vol. 188 | 1 Aug 2019
- A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any LengthAlgorithmica, Vol. 81, No. 7 | 15 February 2019
- Lifted discriminative learning of probabilistic logic programsMachine Learning, Vol. 108, No. 7 | 20 August 2018
- Gadgets and Anti-Gadgets Leading to a Complexity DichotomyACM Transactions on Computation Theory, Vol. 11, No. 2 | 17 February 2019
- Resilient design of large-scale distribution feeders with networked microgridsElectric Power Systems Research, Vol. 171 | 1 Jun 2019
- Extensions of Network Reliability Analysis2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) | 1 Jun 2019
- Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic ApproachApplied Sciences, Vol. 9, No. 11 | 1 June 2019
- Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraintIISE Transactions, Vol. 51, No. 5 | 26 February 2019
- An efficient algorithm for computing exact system and survival signatures of K-terminal network reliabilityReliability Engineering & System Safety, Vol. 185 | 1 May 2019
- Approximate Probabilistic Security for Networked Multi-Robot Systems2019 International Conference on Robotics and Automation (ICRA) | 1 May 2019
- The query complexity of a permutation-based variant of MastermindDiscrete Applied Mathematics, Vol. 260 | 1 May 2019
- A top down approach to enumerate α-maximal cliques in uncertain graphsJournal of Intelligent & Fuzzy Systems, Vol. 36, No. 4 | 10 Apr 2019
- Influence maximization for effective advertisement in social networksProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing | 8 April 2019
- Bound-based Network Tomography with Additive MetricsIEEE INFOCOM 2019 - IEEE Conference on Computer Communications | 1 Apr 2019
- Point-Based Policy Synthesis for POMDPs With Boolean and Quantitative ObjectivesIEEE Robotics and Automation Letters, Vol. 4, No. 2 | 1 Apr 2019
- An in-depth comparison of s-t reliability algorithms over uncertain graphsProceedings of the VLDB Endowment, Vol. 12, No. 8 | 1 April 2019
- The Complexity of Boolean Surjective General-Valued CSPsACM Transactions on Computation Theory, Vol. 11, No. 1 | 21 November 2018
- Minimal Edge Addition for Network ControllabilityIEEE Transactions on Control of Network Systems, Vol. 6, No. 1 | 1 Mar 2019
- Counting Near-Perfect Matchings on Cm × Cn Tori of Odd Order in the Maple SystemProgramming and Computer Software, Vol. 45, No. 2 | 27 May 2019
- Foundations for model‐based systems engineering and model‐based safety assessmentSystems Engineering, Vol. 22, No. 2 | 25 September 2018
- Evaluating network importance measures based on the construction spectrumAdvances in Mechanical Engineering, Vol. 11, No. 3 | 13 March 2019
- Uniquely pressable graphs: Characterization, enumeration, and recognitionAdvances in Applied Mathematics, Vol. 103 | 1 Feb 2019
- On blockwise symmetric matchgate signatures and higher domain #CSPInformation and Computation, Vol. 264 | 1 Feb 2019
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core ModelSIAM Journal on Computing, Vol. 48, No. 2 | 30 April 2019
- A Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilitySIAM Journal on Computing, Vol. 48, No. 3 | 9 May 2019
- Optimality Clue for Graph Coloring ProblemIntegration of Constraint Programming, Artificial Intelligence, and Operations Research | 28 April 2019
- Assessing Heuristic Machine Learning Explanations with Model CountingTheory and Applications of Satisfiability Testing – SAT 2019 | 29 June 2019
- On Symbolic Approaches for Computing the Matrix PermanentPrinciples and Practice of Constraint Programming | 23 September 2019
- Approximate Model Counting, Sparse XOR Constraints and Minimum DistanceThe Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy | 4 November 2019
- Identifying Sources of Random Walk-Based Epidemic Spreading in NetworksMachine Learning and Intelligent Communications | 28 October 2019
- Approximate Querying on Property GraphsScalable Uncertainty Management | 2 December 2019
- An Efficient Approximation of Betweenness Centrality for Uncertain GraphsIEEE Access, Vol. 7 | 1 Jan 2019
- Influence Maximization in Signed Social Networks With Opinion FormationIEEE Access, Vol. 7 | 1 Jan 2019
- К проблеме доказательности медицинского диагноза: интеллектуальный анализ эмпирических данных o пациентах в выборках ограниченного размераНаучно-техническая информация. Серия 2: Информационные процессы и системы, No. 12 | 1 Jan 2019
- A quantum algorithm for uniform sampling of models of propositional logic based on quantum probabilityThe Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, Vol. 16, No. 1 | 17 May 2016
- Stochastic Enumeration with Importance SamplingMethodology and Computing in Applied Probability, Vol. 20, No. 4 | 14 February 2018
- Simulating SIR processes on networks using weighted shortest pathsScientific Reports, Vol. 8, No. 1 | 26 April 2018
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphsDiscrete Applied Mathematics, Vol. 251 | 1 Dec 2018
- Public Projects, Boolean Functions, and the Borders of Border’s TheoremACM Transactions on Economics and Computation, Vol. 6, No. 3-4 | 16 November 2018
- The fewest clues problemTheoretical Computer Science, Vol. 748 | 1 Nov 2018
- Bug synthesis: challenging bug-finding tools with deep faultsProceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering | 26 October 2018
- Decomposition algorithms for system reliability estimation with applications to interdependent lifeline networksEarthquake Engineering & Structural Dynamics, Vol. 47, No. 13 | 16 August 2018
- Efficient and effective influence maximization in social networks: A hybrid-approachInformation Sciences, Vol. 465 | 1 Oct 2018
- Influence Maximization on Social Graphs: A SurveyIEEE Transactions on Knowledge and Data Engineering, Vol. 30, No. 10 | 1 Oct 2018
- Analysis on Probabilistic Construction of Connected Dominating Sets over Regular Graph Ensembles2018 International Symposium on Information Theory and Its Applications (ISITA) | 1 Oct 2018
- Quantifying the Resilience of Cloud-Based Manufacturing Composite ServicesInternational Journal of Cloud Applications and Computing, Vol. 8, No. 4 | 1 Oct 2018
- Influence maximisation in social networks: A target-oriented estimationJournal of Information Science, Vol. 44, No. 5 | 14 February 2018
- Foundations of Modern Query Languages for Graph DatabasesACM Computing Surveys, Vol. 50, No. 5 | 26 September 2017
- Some observations on holographic algorithmscomputational complexity, Vol. 27, No. 3 | 29 August 2017
- The complexity of Bayesian networks specified by propositional and relational languagesArtificial Intelligence, Vol. 262 | 1 Sep 2018
- A Message-Passing Based Algorithm for k-Terminal Reliability2018 14th European Dependable Computing Conference (EDCC) | 1 Sep 2018
- Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length FourIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101.A, No. 9 | 1 Sep 2018
- On uniformly most reliable two‐terminal graphsNetworks, Vol. 72, No. 2 | 20 February 2018
- Simulating cardinal preferences in Boolean games: A proof techniqueInformation and Computation, Vol. 261 | 1 Aug 2018
- On Uncertain GraphsSynthesis Lectures on Data Management, Vol. 10, No. 1 | 23 Jul 2018
- Clar structures vs Fries structures in hexagonal systemsApplied Mathematics and Computation, Vol. 329 | 1 Jul 2018
- Computing the expected makespan of task graphs in the presence of silent errorsParallel Computing, Vol. 75 | 1 Jul 2018
- Finding and Counting Tree-Like Subgraphs Using MapReduceIEEE Transactions on Multi-Scale Computing Systems, Vol. 4, No. 3 | 1 Jul 2018
- Probe generation for active probingInternational Journal of Network Management, Vol. 28, No. 4 | 24 May 2018
- WotanACM Transactions on Reconfigurable Technology and Systems, Vol. 11, No. 2 | 26 July 2018
- Euclidean Matchings in Ultra-Dense NetworksIEEE Communications Letters, Vol. 22, No. 6 | 1 Jun 2018
- Boosting Information Spread: An Algorithmic ApproachIEEE Transactions on Computational Social Systems, Vol. 5, No. 2 | 1 Jun 2018
- Closest Paths in Graph Drawings under an Elastic MetricInternational Journal of Applied Mathematics and Computer Science, Vol. 28, No. 2 | 29 June 2018
- Constant Delay Algorithms for Regular Document SpannersProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 27 May 2018
- Maximizing misinformation restriction within time and budget constraintsJournal of Combinatorial Optimization, Vol. 35, No. 4 | 21 February 2018
- Hammocks versus hammock2018 7th International Conference on Computers Communications and Control (ICCCC) | 1 May 2018
- On algorithms for evaluating the reliability of large Hammock networks2018 7th International Conference on Computers Communications and Control (ICCCC) | 1 May 2018
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphsDiscrete Applied Mathematics, Vol. 239 | 1 Apr 2018
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasketTheoretical Computer Science, Vol. 720 | 1 Apr 2018
- Bipartite graphs in systems biology and medicine: a survey of methods and applicationsGigaScience, Vol. 7, No. 4 | 19 February 2018
- Sensitive Task Assignments in Crowdsourcing Markets with Colluding Workers2018 IEEE 34th International Conference on Data Engineering (ICDE) | 1 Apr 2018
- Optimizing Network Reliability via Best-First Search over Decision DiagramsIEEE INFOCOM 2018 - IEEE Conference on Computer Communications | 1 Apr 2018
- On the analysis of independent sets via multilevel splittingNetworks, Vol. 71, No. 3 | 10 January 2018
- Node reactivation model to intensify influence on network targetsKnowledge and Information Systems, Vol. 54, No. 3 | 7 June 2017
- Cost-efficient scheduling of FAST observationsExperimental Astronomy, Vol. 45, No. 1 | 16 February 2018
- On the complexity of generalized chromatic polynomialsAdvances in Applied Mathematics, Vol. 94 | 1 Mar 2018
- The stochastic stability of decentralized matching on a graphGames and Economic Behavior, Vol. 108 | 1 Mar 2018
- Notes on Computational Uncertainties in Probabilistic Risk/Safety AssessmentEntropy, Vol. 20, No. 3 | 4 March 2018
- Uncertain Data LineageEncyclopedia of Database Systems | 7 December 2018
- Cycle-Centrality in Economic and Biological NetworksComplex Networks & Their Applications VI | 27 November 2017
- Scalable Approximation of Quantitative Information Flow in ProgramsVerification, Model Checking, and Abstract Interpretation | 29 December 2017
- Finding Influential Nodes by a Fast Marginal Ranking MethodDatabases Theory and Applications | 18 May 2018
- A New Probabilistic Algorithm for Approximate Model CountingAutomated Reasoning | 30 June 2018
- Computational Complexity of Decision Problems on Self-verifying Finite AutomataDevelopments in Language Theory | 5 August 2018
- On the Exact Reliability Enhancements of Small Hammock NetworksIEEE Access, Vol. 6 | 1 Jan 2018
- AVB-Aware Routing and Scheduling of Time-Triggered Traffic for TSNIEEE Access, Vol. 6 | 1 Jan 2018
- Checkpointing Workflows for Fail-Stop ErrorsIEEE Transactions on Computers, Vol. 69 | 1 Jan 2018
- Fixed-Parameter Tractable Algorithms for Tracking Set ProblemsAlgorithms and Discrete Applied Mathematics | 16 January 2018
- Exploiting Treewidth for Projected Model Counting and Its LimitsTheory and Applications of Satisfiability Testing – SAT 2018 | 26 June 2018
- Community-Based Acceptance Probability Maximization for Target Users on Social NetworksAlgorithmic Aspects in Information and Management | 17 November 2018
- Exact Computation of Strongly Connected Reliability by Binary Decision DiagramsCombinatorial Optimization and Applications | 16 November 2018
- Targeted Misinformation Blocking on Online Social NetworksIntelligent Information and Database Systems | 14 February 2018
- Partial Sublinear Time Approximation and Inapproximation for Maximum CoverageComputing and Combinatorics | 29 June 2018
- Obtaining and Using Cumulative Bounds of Network ReliabilitySystem Reliability | 20 December 2017
- Toward query-friendly compression of rapid graph streamsSocial Network Analysis and Mining, Vol. 7, No. 1 | 23 May 2017
- Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphsTheoretical Computer Science, Vol. 703 | 1 Dec 2017
- Computation and analysis of temporal betweenness in a knowledge mobilization networkComputational Social Networks, Vol. 4, No. 1 | 10 July 2017
- Clustering uncertain graphsProceedings of the VLDB Endowment, Vol. 11, No. 4 | 1 December 2017
- Building a Dossier on the CheapProceedings of the 2017 ACM on Conference on Information and Knowledge Management | 6 November 2017
- The computational complexity of QoS measures for orchestrationsJournal of Combinatorial Optimization, Vol. 34, No. 4 | 24 June 2017
- Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2017
- Understanding the complexity of axiom pinpointing in lightweight description logicsArtificial Intelligence, Vol. 250 | 1 Sep 2017
- Temperature Scaling Law for Quantum Annealing OptimizersPhysical Review Letters, Vol. 119, No. 11 | 14 September 2017
- Checkpointing Workflows for Fail-Stop Errors2017 IEEE International Conference on Cluster Computing (CLUSTER) | 1 Sep 2017
- Composability Verification of Multi-Service Workflows in a Policy-Driven Cloud Computing EnvironmentIEEE Transactions on Dependable and Secure Computing, Vol. 14, No. 5 | 1 Sep 2017
- Finding all the Lower Boundary Points in a Multistate Two-Terminal NetworkIEEE Transactions on Reliability, Vol. 66, No. 3 | 1 Sep 2017
- The Multilevel Splitting algorithm for graph colouring with application to the Potts modelPhilosophical Magazine, Vol. 97, No. 19 | 13 April 2017
- Human-Powered Data Cleaning for Probabilistic Reachability Queries on Uncertain GraphsIEEE Transactions on Knowledge and Data Engineering, Vol. 29, No. 7 | 1 Jul 2017
- A recursive formula for the two‐edge connected and biconnected reliability of a complete graphNetworks, Vol. 69, No. 4 | 25 April 2017
- Safety Analyzes of Mechatronics Systems: a Case StudyIFAC-PapersOnLine, Vol. 50, No. 1 | 1 Jul 2017
- Holographic algorithm with matchgates is universal for planar #CSP over boolean domainProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 19 June 2017
- On the connection between interval size functions and path countingcomputational complexity, Vol. 26, No. 2 | 2 June 2016
- The effect of combination functions on the complexity of relational Bayesian networksInternational Journal of Approximate Reasoning, Vol. 85 | 1 Jun 2017
- Linear-time algorithms for counting independent sets in bipartite permutation graphsInformation Processing Letters, Vol. 122 | 1 Jun 2017
- Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) | 1 Jun 2017
- Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes2017 IEEE International Symposium on Information Theory (ISIT) | 1 Jun 2017
- Descriptive Complexity for counting complexity classes2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 1 Jun 2017
- Coarsening Massive Influence Networks for Scalable Diffusion AnalysisProceedings of the 2017 ACM International Conference on Management of Data | 9 May 2017
- tactoRingProceedings of the 2017 CHI Conference on Human Factors in Computing Systems | 2 May 2017
- Maximum matchings in scale-free networks with identical degree distributionTheoretical Computer Science, Vol. 675 | 1 May 2017
- Key community analysis in scientific collaboration network2017 International Conference on Computing, Communication and Automation (ICCCA) | 1 May 2017
- Exact Computation of Influence Spread by Binary Decision DiagramsProceedings of the 26th International Conference on World Wide Web | 3 April 2017
- Robust planning with incomplete domain modelsArtificial Intelligence, Vol. 245 | 1 Apr 2017
- On the complexity of propositional and relational credal networksInternational Journal of Approximate Reasoning, Vol. 83 | 1 Apr 2017
- On hammock networks - sixty years after2017 12th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS) | 1 Apr 2017
- Boosting Information Spread: An Algorithmic Approach2017 IEEE 33rd International Conference on Data Engineering (ICDE) | 1 Apr 2017
- Exact Model Counting of Query ExpressionsACM Transactions on Database Systems, Vol. 42, No. 1 | 3 February 2017
- Towards efficient top-k reliability search on uncertain graphsKnowledge and Information Systems, Vol. 50, No. 3 | 24 June 2016
- Stochastic Enumeration Method for Counting TreesMethodology and Computing in Applied Probability, Vol. 19, No. 1 | 16 August 2015
- Computing convex hulls and counting integer points with polymakeMathematical Programming Computation, Vol. 9, No. 1 | 23 May 2016
- The Complexity of Finding EffectorsTheory of Computing Systems, Vol. 60, No. 2 | 17 March 2016
- Counting independent sets in tree convex bipartite graphsDiscrete Applied Mathematics, Vol. 218 | 1 Feb 2017
- The parameterized complexity of k-edge induced subgraphsInformation and Computation, Vol. 252 | 1 Feb 2017
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSPSIAM Journal on Computing, Vol. 46, No. 3 | 11 May 2017
- Uncertain Data LineageEncyclopedia of Database Systems | 19 September 2017
- Mining Uncertain Graphs: An OverviewAlgorithmic Aspects of Cloud Computing | 11 April 2017
- Counting Substrate Cycles in Topologically Restricted Metabolic NetworksUnveiling Dynamics and Complexity | 12 May 2017
- Expected Outcomes and Manipulations in Online Fair DivisionKI 2017: Advances in Artificial Intelligence | 19 September 2017
- Probabilistic Logic Programming in ActionTowards Integrative Machine Learning and Knowledge Extraction | 29 October 2017
- Approximately counting paths and cycles in a graphDiscrete Applied Mathematics, Vol. 217 | 1 Jan 2017
- An Approach to Incorporating Uncertainty in Network Security AnalysisProceedings of the Hot Topics in Science of Security: Symposium and Bootcamp on - HoTSoS | 1 Jan 2017
- System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain ReductionAmerican Journal of Operations Research, Vol. 07, No. 03 | 1 Jan 2017
- Influenced Nodes Discovery in Temporal Contact NetworkWeb Information Systems Engineering – WISE 2017 | 4 October 2017
- Completeness Results for Counting Problems with Easy DecisionAlgorithms and Complexity | 14 April 2017
- Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networksAd Hoc Networks, Vol. 52 | 1 Dec 2016
- Design optimisation of cyber‐physical distributed systems using IEEE time‐sensitive networksIET Cyber-Physical Systems: Theory & Applications, Vol. 1, No. 1 | 1 December 2016
- On the network reliability problem of the heterogeneous key predistribution scheme2016 IEEE 55th Conference on Decision and Control (CDC) | 1 Dec 2016
- Splitting MethodSimulation and the Monte Carlo Method | 30 January 2017
- Routing optimization of AVB streams in TSN networksACM SIGBED Review, Vol. 13, No. 4 | 3 November 2016
- Counting 4×4 matrix partitions of graphsDiscrete Applied Mathematics, Vol. 213 | 1 Nov 2016
- INCIM: A community-based algorithm for influence maximization problem under the linear threshold modelInformation Processing & Management, Vol. 52, No. 6 | 1 Nov 2016
- Splitting sequential Monte Carlo for efficient unreliability estimation of highly reliable networksStructural Safety, Vol. 63 | 1 Nov 2016
- Cumulative estimated values of structural network's reliability indices and their usage2016 Dynamics of Systems, Mechanisms and Machines (Dynamics) | 1 Nov 2016
- Network topologies for achieving maximal all-terminal network availability2016 24th Telecommunications Forum (TELFOR) | 1 Nov 2016
- DistR: A Distributed Method for the Reachability Query over Large Uncertain GraphsIEEE Transactions on Parallel and Distributed Systems, Vol. 27, No. 11 | 1 Nov 2016
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2016
- A Fast and Simple Unbiased Estimator for Network (Un)reliability2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2016
- Energy-Efficient Routing in Wireless Networks in the Presence of JammingIEEE Transactions on Wireless Communications, Vol. 15, No. 10 | 1 Oct 2016
- Probabilistic logic programming on the webSoftware: Practice and Experience, Vol. 46, No. 10 | 18 December 2015
- Fast Domino TileabilityDiscrete & Computational Geometry, Vol. 56, No. 2 | 15 July 2016
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulationsDiscrete Applied Mathematics, Vol. 210 | 1 Sep 2016
- Node isolation of secure wireless sensor networks under a heterogeneous channel model2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) | 1 Sep 2016
- BRIDES: A New Fast Algorithm and Software for Characterizing Evolving Similarity Networks Using Breakthroughs, Roadblocks, Impasses, Detours, Equals and ShortcutsPLOS ONE, Vol. 11, No. 8 | 31 August 2016
- Simulated-quantum-annealing comparison between all-to-all connectivity schemesPhysical Review A, Vol. 94, No. 2 | 22 August 2016
- Computing the Expected Makespan of Task Graphs in the Presence of Silent Errors2016 45th International Conference on Parallel Processing Workshops (ICPPW) | 1 Aug 2016
- Holant Problems for 3-Regular Graphs with Complex Edge FunctionsTheory of Computing Systems, Vol. 59, No. 1 | 23 March 2016
- An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networksAd Hoc Networks, Vol. 44 | 1 Jul 2016
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core ModelsCombinatorics, Probability and Computing, Vol. 25, No. 4 | 2 February 2016
- Tractable Lineages on Treelike InstancesProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 15 June 2016
- Truss Decomposition of Probabilistic GraphsProceedings of the 2016 International Conference on Management of Data | 14 June 2016
- Holistic Influence MaximizationProceedings of the 2016 International Conference on Management of Data | 14 June 2016
- Spheres of Influence for More Effective Viral MarketingProceedings of the 2016 International Conference on Management of Data | 14 June 2016
- Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth InstancesProceedings of the 2016 on SIGMOD'16 PhD Symposium | 14 June 2016
- The complexity of counting locally maximal satisfying assignments of Boolean CSPsTheoretical Computer Science, Vol. 634 | 1 Jun 2016
- Misinformation in Online Social NetworksACM Transactions on Information Systems, Vol. 34, No. 3 | 11 April 2016
- Sequential Monte Carlo for counting vertex covers in general graphsStatistics and Computing, Vol. 26, No. 3 | 3 February 2015
- Throughput equalization in mean-field hard-core models for CSMA-based wireless networks2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) | 1 May 2016
- Dichotomies for Queries with Negation in Probabilistic DatabasesACM Transactions on Database Systems, Vol. 41, No. 1 | 24 February 2016
- System Travel Time Reliability: A Measure of the Quality of Service of NetworksQuality and Reliability Engineering International, Vol. 32, No. 3 | 16 March 2015
- The complexity of estimating min-entropycomputational complexity, Vol. 25, No. 1 | 6 September 2014
- Generating and Enumerating Digitally Convex Sets of TreesGraphs and Combinatorics, Vol. 32, No. 2 | 16 July 2015
- Improved Sampling Plans for Combinatorial Invariants of Coherent SystemsIEEE Transactions on Reliability, Vol. 65, No. 1 | 1 Mar 2016
- Centrality-Aware Link RecommendationsProceedings of the Ninth ACM International Conference on Web Search and Data Mining | 8 February 2016
- An improved algorithm for finding all upper boundary points in a stochastic-flow networkApplied Mathematical Modelling, Vol. 40, No. 4 | 1 Feb 2016
- An efficient algorithm for link prediction in temporal uncertain social networksInformation Sciences, Vol. 331 | 1 Feb 2016
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related ResultsSIAM Journal on Computing, Vol. 45, No. 6 | 15 November 2016
- Complexity Dichotomies for Counting Graph HomomorphismsEncyclopedia of Algorithms | 22 April 2016
- Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-WidthTopics in Theoretical Computer Science | 9 January 2016
- Counting Subgraphs in Relational Event GraphsWALCOM: Algorithms and Computation | 1 Jan 2016
- Solution-Graphs of Boolean Formulas and IsomorphismTheory and Applications of Satisfiability Testing – SAT 2016 | 11 June 2016
- Approximately Counting Approximately-Shortest Paths in Directed Acyclic GraphsTheory of Computing Systems, Vol. 58, No. 1 | 18 September 2014
- On computing minimal independent support and its applications to sampling and countingConstraints, Vol. 21, No. 1 | 15 August 2015
- The challenges of unbounded treewidth in parameterised subgraph counting problemsDiscrete Applied Mathematics, Vol. 198 | 1 Jan 2016
- Probabilistic Analysis of the Network Reliability Problem on Random Graph EnsemblesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E99.A, No. 12 | 1 Jan 2016
- Computing Terminal Reliability of Multi-Tolerance GraphsIEICE Transactions on Information and Systems, Vol. E99.D, No. 7 | 1 Jan 2016
- Computing K-Terminal Reliability of Circular-Arc GraphsIEICE Transactions on Information and Systems, Vol. E99.D, No. 12 | 1 Jan 2016
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based SignaturesAdvances in Cryptology – ASIACRYPT 2016 | 9 November 2016
- Algebraic fingerprints for faster algorithmsCommunications of the ACM, Vol. 59, No. 1 | 21 December 2015
- Counting K4 -subdivisionsDiscrete Mathematics, Vol. 338, No. 12 | 1 Dec 2015
- Cascade source inference in networks: a Markov chain Monte Carlo approachComputational Social Networks, Vol. 2, No. 1 | 19 October 2015
- Random partition models and complementary clustering of Anglo-Saxon place-namesThe Annals of Applied Statistics, Vol. 9, No. 4 | 1 Dec 2015
- Availability‐based path selection and network vulnerability assessmentNetworks, Vol. 66, No. 4 | 29 September 2015
- Alternative routingProceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems | 3 November 2015
- Reliability Evaluation of Imperfect K-Terminal Stochastic Networks using Polygon-to Chain and Series-parallel ReductionsProceedings of the 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks | 2 November 2015
- Top-k Reliability Search on Uncertain Graphs2015 IEEE International Conference on Data Mining | 1 Nov 2015
- Uncertain Graph Processing through Representative InstancesACM Transactions on Database Systems, Vol. 40, No. 3 | 23 October 2015
- Triadic Formal Concept Analysis and triclustering: searching for optimal patternsMachine Learning, Vol. 101, No. 1-3 | 1 April 2015
- Computing the K-terminal reliability of directed path graphsInformation Processing Letters, Vol. 115, No. 10 | 1 Oct 2015
- Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k2015 IEEE 56th Annual Symposium on Foundations of Computer Science | 1 Oct 2015
- Recursive Variance Reduction method in stochastic monotone binary systems2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) | 1 Oct 2015
- Tensor Network Contractions for #SATJournal of Statistical Physics, Vol. 160, No. 5 | 13 June 2015
- Which Phylogenetic Networks are Merely Trees with Additional Arcs?Systematic Biology, Vol. 64, No. 5 | 11 June 2015
- Wotan: A tool for rapid evaluation of FPGA architecture routability without benchmarks2015 25th International Conference on Field Programmable Logic and Applications (FPL) | 1 Sep 2015
- Hardness of Decoding Quantum Stabilizer CodesIEEE Transactions on Information Theory, Vol. 61, No. 9 | 1 Sep 2015
- Full complexity analysis of the diameter‐constrained reliabilityInternational Transactions in Operational Research, Vol. 22, No. 5 | 27 March 2015
- Intensional data on the webACM SIGWEB Newsletter, Vol. 2015, No. Summer | 17 August 2015
- Probabilistic Description Logics under the distribution semanticsSemantic Web, Vol. 6, No. 5 | 7 Aug 2015
- On a Random Walk Survivability problem with arc failures and memoryNetworks, Vol. 66, No. 1 | 7 April 2015
- Probabilistic (logic) programming conceptsMachine Learning, Vol. 100, No. 1 | 8 May 2015
- Automated generation of partial Markov chain from high level descriptionsReliability Engineering & System Safety, Vol. 139 | 1 Jul 2015
- The complexity of handling minimal solutions in logic-based abductionJournal of Logic and Computation, Vol. 25, No. 3 | 1 October 2014
- Monitor placement to timely detect misinformation in Online Social Networks2015 IEEE International Conference on Communications (ICC) | 1 Jun 2015
- The Reachability Query over Distributed Uncertain Graphs2015 IEEE 35th International Conference on Distributed Computing Systems | 1 Jun 2015
- Symmetric Weighted First-Order Model CountingProceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 20 May 2015
- A new cut-based algorithm for the multi-state flow network reliability problemReliability Engineering & System Safety, Vol. 136 | 1 Apr 2015
- Model Counting of Monotone Conjunctive Normal Form Formulas with SpectraINFORMS Journal on Computing, Vol. 27, No. 2 | 1 Apr 2015
- Regular expression order-sorted unification and matchingJournal of Symbolic Computation, Vol. 67 | 1 Mar 2015
- Pfaffian orientations and perfect matchings of scale-free networksTheoretical Computer Science, Vol. 570 | 1 Mar 2015
- Dichotomy results for fixed point counting in boolean dynamical systemsTheoretical Computer Science, Vol. 573 | 1 Mar 2015
- A probabilistic logic programming event calculusTheory and Practice of Logic Programming, Vol. 15, No. 2 | 22 May 2014
- A fast algorithm for finding most influential people based on the linear threshold modelExpert Systems with Applications, Vol. 42, No. 3 | 1 Feb 2015
- A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphsInformation Processing Letters, Vol. 115, No. 2 | 1 Feb 2015
- Complexity Dichotomies for Counting Graph HomomorphismsEncyclopedia of Algorithms | 2 June 2015
- Mapping Kernels Between Rooted Labeled Trees Beyond Ordered TreesNew Frontiers in Artificial Intelligence | 25 August 2015
- Counting Keys in Parallel After a Side Channel AttackAdvances in Cryptology – ASIACRYPT 2015 | 30 December 2015
- Counting independent sets in a tolerance graphDiscrete Applied Mathematics, Vol. 181 | 1 Jan 2015
- Counting problems and ranks of matricesLinear Algebra and its Applications, Vol. 465 | 1 Jan 2015
- On the Complexity of Some State-Counting Problems for Bounded Petri NetsIEEE Transactions on Automatic Control, Vol. 60, No. 1 | 1 Jan 2015
- Optimal testing for planted satisfiability problemsElectronic Journal of Statistics, Vol. 9, No. 1 | 1 Jan 2015
- A Model for Path DataSSRN Electronic Journal, Vol. 35 | 1 Jan 2015
- On Sampling Simple Paths in Planar Graphs According to Their LengthsMathematical Foundations of Computer Science 2015 | 11 August 2015
- The Complexity of Plate Probabilistic ModelsScalable Uncertainty Management | 16 September 2015
- On the Impact of Junction-Tree Topology on Weighted Model CountingScalable Uncertainty Management | 16 September 2015
- The Complexity of Mining Maximal Frequent SubgraphsACM Transactions on Database Systems, Vol. 39, No. 4 | 30 December 2014
- Efficient and robust allocation algorithms in clouds under memory constraints2014 21st International Conference on High Performance Computing (HiPC) | 1 Dec 2014
- Some capabilities of enumeration control in the DSM method. Part twoScientific and Technical Information Processing, Vol. 41, No. 6 | 5 February 2015
- Efficient Probabilistic Supergraph Search Over Large Uncertain GraphsProceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management | 3 November 2014
- Practical algorithms for MSO model-checking on tree-decomposable graphsComputer Science Review, Vol. 13-14 | 1 Nov 2014
- Model-Based Safety Assessment: Rational and trends2014 10th France-Japan/ 8th Europe-Asia Congress on Mecatronics (MECATRONICS2014- Tokyo) | 1 Nov 2014
- Diameter constrained reliability: Complexity and distinguished topologies2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) | 1 Nov 2014
- Counting maximal independent sets in directed path graphsInformation Processing Letters, Vol. 114, No. 10 | 1 Oct 2014
- Learning a proximity measure to complete a community2014 International Conference on Data Science and Advanced Analytics (DSAA) | 1 Oct 2014
- Influence maximization in a social network in the presence of multiple influences and acceptances2014 International Conference on Data Science and Advanced Analytics (DSAA) | 1 Oct 2014
- Finding patterns in a knowledge base using keywords to compose table answersProceedings of the VLDB Endowment, Vol. 7, No. 14 | 1 October 2014
- On the concentration of the number of solutions of random satisfiability formulasRandom Structures & Algorithms, Vol. 45, No. 3 | 12 April 2013
- Core decomposition of uncertain graphsProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining | 24 August 2014
- Minimizing seed set selection with probabilistic coverage guarantee in a social networkProceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining | 24 August 2014
- Recent Advances in Information Diffusion and Influence Maximization of Complex Social NetworksOpportunistic Mobile Social Networks | 17 July 2014
- Lee–Yang Theorems and the Complexity of Computing AveragesCommunications in Mathematical Physics, Vol. 329, No. 3 | 13 May 2014
- Monte Carlo methods in diameter-constrained reliabilityOptical Switching and Networking, Vol. 14 | 1 Aug 2014
- Improved inapproximability results for counting independent sets in the hard‐core modelRandom Structures & Algorithms, Vol. 45, No. 1 | 27 December 2012
- The pursuit of a good possible worldProceedings of the 2014 ACM SIGMOD International Conference on Management of Data | 18 June 2014
- ReferencesTheory of Computational Complexity | 13 June 2014
- A Novel Variable Ordering Heuristic for BDD-based K-Terminal Reliability2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks | 1 Jun 2014
- Entropy, optimization and countingProceedings of the forty-sixth annual ACM symposium on Theory of computing | 31 May 2014
- Scalable Fast Scheduling for Optical Flow Switching Using Sampled Entropy and Mutual Information BroadcastJournal of Optical Communications and Networking, Vol. 6, No. 5 | 15 April 2014
- Generalized loop‐erased random walks and approximate reachabilityRandom Structures & Algorithms, Vol. 44, No. 2 | 6 December 2012
- Closest pair and the post office problem for stochastic pointsComputational Geometry, Vol. 47, No. 2 | 1 Feb 2014
- The complexity of complex weighted Boolean #CSPJournal of Computer and System Sciences, Vol. 80, No. 1 | 1 Feb 2014
- Monomer-dimer problem on random planar honeycomb latticeJournal of Mathematical Physics, Vol. 55, No. 2 | 28 February 2014
- Efficient Sampling Methods for Shortest Path Query over Uncertain GraphsDatabase Systems for Advanced Applications | 1 Jan 2014
- Counting Approximately-Shortest Paths in Directed Acyclic GraphsApproximation and Online Algorithms | 1 Jan 2014
- Approximate Counting of Matchings in (3,3)-HypergraphsAlgorithm Theory – SWAT 2014 | 1 Jan 2014
- L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing ChainsComputing and Combinatorics | 1 Jan 2014
- Agreement Subtree Mapping Kernel for Phylogenetic TreesNew Frontiers in Artificial Intelligence | 6 November 2014
- Classifying Problems into Complexity ClassesAdvances in Computers | 1 Jan 2014
- Approximation in two-stage stochastic integer programmingSurveys in Operations Research and Management Science, Vol. 19, No. 1 | 1 Jan 2014
- Evolution and Controllability of Cancer Networks: A Boolean PerspectiveIEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 11, No. 1 | 1 Jan 2014
- Diameter-Constrained ReliabilityProceedings of the Latin America Networking Conference on LANC 2014 - LANC '14 | 1 Jan 2014
- Number of Spanning Trees of Different Products of Complete and Complete Bipartite GraphsMathematical Problems in Engineering, Vol. 2014 | 1 Jan 2014
- Turing’s algorithmic lens: From computability to complexity theoryArbor, Vol. 189, No. 764 | 30 January 2014
- Factors and FactorizationHandbook of Graph Theory, Second Edition | 26 November 2013
- The computational complexity of random serial dictatorshipEconomics Letters, Vol. 121, No. 3 | 1 Dec 2013
- BibliographyFast Sequential Monte Carlo Methods for Counting and Optimization | 13 December 2013
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORSInternational Journal of Foundations of Computer Science, Vol. 24, No. 07 | 26 February 2014
- The complexity of regular expressions and property paths in SPARQLACM Transactions on Database Systems, Vol. 38, No. 4 | 4 December 2013
- Information and Influence Propagation in Social NetworksSynthesis Lectures on Data Management, Vol. 5, No. 4 | 27 Oct 2013
- On random generation of fuzzy measuresFuzzy Sets and Systems, Vol. 228 | 1 Oct 2013
- A link based network route choice model with unrestricted choice setTransportation Research Part B: Methodological, Vol. 56 | 1 Oct 2013
- The complexity of the counting constraint satisfaction problemJournal of the ACM, Vol. 60, No. 5 | 28 October 2013
- Tractable counting of the answers to conjunctive queriesJournal of Computer and System Sciences, Vol. 79, No. 6 | 1 Sep 2013
- Tiling simply connected regions with rectanglesJournal of Combinatorial Theory, Series A, Vol. 120, No. 7 | 1 Sep 2013
- Partition functions on k -regular graphs with {0,1} -vertex assignments and real edge functionsTheoretical Computer Science, Vol. 494 | 1 Jul 2013
- Improved mixing condition on the grid for counting and sampling independent setsProbability Theory and Related Fields, Vol. 156, No. 1-2 | 25 March 2012
- Quantitative Monadic Second-Order Logic2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 1 Jun 2013
- Fault tree linking versus event tree linking approaches: a reasoned comparisonProceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, Vol. 227, No. 3 | 16 June 2013
- Exploiting independent subformulas: A faster approximation scheme for #k-SATInformation Processing Letters, Vol. 113, No. 9 | 1 May 2013
- Reliable Service Allocation in Clouds2013 IEEE 27th International Symposium on Parallel and Distributed Processing | 1 May 2013
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor GraphsNeural Computation, Vol. 25, No. 5 | 1 May 2013
- Meme ranking to maximize posts virality in microblogging platformsJournal of Intelligent Information Systems, Vol. 40, No. 2 | 18 October 2011
- Rényi entropies as a measure of the complexity of counting problemsJournal of Statistical Mechanics: Theory and Experiment, Vol. 2013, No. 04 | 2 April 2013
- Optimizing approximations of DNF query lineage in probabilistic XML2013 IEEE 29th International Conference on Data Engineering (ICDE) | 1 Apr 2013
- Interactive proofs, circuit lower bounds, and moreQuantum Computing since Democritus | 14 Mar 2013
- Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory NetworksElectronic Notes in Theoretical Computer Science, Vol. 292 | 1 Mar 2013
- Complexity and algorithms for Euler characteristic of simplicial complexesJournal of Symbolic Computation, Vol. 50 | 1 Mar 2013
- Well–definedness and efficient inference for probabilistic logic programming under the distribution semanticsTheory and Practice of Logic Programming, Vol. 13, No. 2 | 25 January 2012
- Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable NetworksIEEE Transactions on Reliability, Vol. 62, No. 1 | 1 Mar 2013
- Parameterized Random ComplexityTheory of Computing Systems, Vol. 52, No. 2 | 22 December 2011
- Clustering Large Probabilistic GraphsIEEE Transactions on Knowledge and Data Engineering, Vol. 25, No. 2 | 1 Feb 2013
- An Effective Dichotomy for the Counting Constraint Satisfaction ProblemSIAM Journal on Computing, Vol. 42, No. 3 | 25 June 2013
- Advances on Matroid Secretary Problems: Free Order Model and Laminar CaseInteger Programming and Combinatorial Optimization | 1 Jan 2013
- MCMC Estimation of Conditional Probabilities in Probabilistic Programming LanguagesSymbolic and Quantitative Approaches to Reasoning with Uncertainty | 1 Jan 2013
- Counting Matchings of Size k Is $\sharp$ W[1]-HardAutomata, Languages, and Programming | 1 Jan 2013
- A Scalable Approximate Model CounterPrinciples and Practice of Constraint Programming | 1 Jan 2013
- Holographic algorithms by Fibonacci gatesLinear Algebra and its Applications, Vol. 438, No. 2 | 1 Jan 2013
- Sequential Monte Carlo for Counting Vertex Covers in General GraphsSSRN Electronic Journal, Vol. 6 | 1 Jan 2013
- BUNDLE: A Reasoner for Probabilistic OntologiesWeb Reasoning and Rule Systems | 1 Jan 2013
- Optimization Problems in Online Social NetworksHandbook of Combinatorial Optimization | 26 July 2013
- Holographic reduction, interpolation and hardnesscomputational complexity, Vol. 21, No. 4 | 9 May 2012
- Mining frequent subgraphs over uncertain graph databases under probabilistic semanticsThe VLDB Journal, Vol. 21, No. 6 | 28 February 2012
- A simple recursive importance and stratified sampling scheme for stochastic network reliability estimationSimulation Modelling Practice and Theory, Vol. 29 | 1 Dec 2012
- The dichotomy of probabilistic inference for unions of conjunctive queriesJournal of the ACM, Vol. 59, No. 6 | 9 January 2013
- Scalable influence maximization for independent cascade model in large-scale social networksData Mining and Knowledge Discovery, Vol. 25, No. 3 | 1 April 2012
- The complexity of approximating bounded-degree Boolean #CSPInformation and Computation, Vol. 220-221 | 1 Nov 2012
- Approximation complexity of complex-weighted degree-two counting constraint satisfaction problemsTheoretical Computer Science, Vol. 461 | 1 Nov 2012
- Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithmsJournal of Scheduling, Vol. 15, No. 5 | 20 May 2011
- Satisfiability with Index DependencyJournal of Computer Science and Technology, Vol. 27, No. 4 | 12 July 2012
- Towards fixed-parameter tractable algorithms for abstract argumentationArtificial Intelligence, Vol. 186 | 1 Jul 2012
- Maintenance Models with General Degree of RepairReliability and Maintenance | 22 May 2012
- Fundamentals of Systems ReliabilityImportance Measures in Reliability, Risk, and Optimization | 26 April 2012
- BibliographyImportance Measures in Reliability, Risk, and Optimization | 26 April 2012
- Discovering Threshold-based Frequent Closed Itemsets over Probabilistic Data2012 IEEE 28th International Conference on Data Engineering | 1 Apr 2012
- The Complexity of Reasoning for Fragments of Autoepistemic LogicACM Transactions on Computational Logic, Vol. 13, No. 2 | 1 Apr 2012
- Probabilistic query answering over inconsistent databasesAnnals of Mathematics and Artificial Intelligence, Vol. 64, No. 2-3 | 22 March 2012
- The complexity of weighted and unweighted #CSPJournal of Computer and System Sciences, Vol. 78, No. 2 | 1 Mar 2012
- Algorithmic study on the routing reliability problemThirteenth International Symposium on Quality Electronic Design (ISQED) | 1 Mar 2012
- On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization ProblemsOperations Research, Vol. 60, No. 1 | 1 Feb 2012
- Hardness of MastermindFun with Algorithms | 1 Jan 2012
- An Efficient Algorithm for Enumerating Minimal PathSets in Communication NetworksNetworked Digital Technologies | 1 Jan 2012
- A Practical Method for Evaluating the Reliability of Telecommunication NetworkNetworked Digital Technologies | 1 Jan 2012
- Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete DataExperimental Algorithms | 1 Jan 2012
- The Parameterized Complexity of k-Edge Induced SubgraphsAutomata, Languages, and Programming | 1 Jan 2012
- From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with ErrorsDevelopments in Language Theory | 1 Jan 2012
- Finding Representative Nodes in Probabilistic GraphsBisociative Knowledge Discovery | 1 Jan 2012
- Link and Node Prediction in Metabolic Networks with Probabilistic LogicBisociative Knowledge Discovery | 1 Jan 2012
- Max-Sur-CSP on Two ElementsPrinciples and Practice of Constraint Programming | 1 Jan 2012
- A Survey on Proximity Measures for Social NetworksSearch Computing | 1 Jan 2012
- Ontology-Based Access to Probabilistic Data with OWL QLThe Semantic Web – ISWC 2012 | 1 Jan 2012
- Sparse reliable graph backbonesInformation and Computation, Vol. 210 | 1 Jan 2012
- Guest columnACM SIGACT News, Vol. 42, No. 4 | 13 December 2011
- What Is Enumerative Combinatorics?Enumerative Combinatorics | 12 Dec 2011
- SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model2011 IEEE 11th International Conference on Data Mining | 1 Dec 2011
- Reliability in Layered Networks With Random Link FailuresIEEE/ACM Transactions on Networking, Vol. 19, No. 6 | 1 Dec 2011
- Performance of wireless sensor networks under random node failures2011 - MILCOM 2011 Military Communications Conference | 1 Nov 2011
- Spanning trees of 3-uniform hypergraphsAdvances in Applied Mathematics, Vol. 47, No. 4 | 1 Oct 2011
- Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- Holographic reduction for some counting problemsInformation Processing Letters, Vol. 111, No. 15 | 1 Aug 2011
- Considering Dependent Components in the Terminal Pair Reliability Problem2011 Sixth International Conference on Availability, Reliability and Security | 1 Aug 2011
- High-confidence estimation of small s - t reliabilities in directed acyclic networksNetworks, Vol. 57, No. 4 | 1 October 2010
- BibliographyAn Elementary Introduction to Statistical Learning Theory | 27 April 2011
- SimplicityAn Elementary Introduction to Statistical Learning Theory | 27 April 2011
- Distance-constraint reachability computation in uncertain graphsProceedings of the VLDB Endowment, Vol. 4, No. 9 | 1 June 2011
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive RepresentationOperations Research, Vol. 59, No. 3 | 1 Jun 2011
- Queries and materialized views on probabilistic databasesJournal of Computer and System Sciences, Vol. 77, No. 3 | 1 May 2011
- Model checking in the modal μ -calculus and generic solutionsJournal of Symbolic Computation, Vol. 46, No. 5 | 1 May 2011
- On the parameterized complexity of approximate countingRAIRO - Theoretical Informatics and Applications, Vol. 45, No. 2 | 18 April 2011
- Providing support for full relational algebra in probabilistic databases2011 IEEE 27th International Conference on Data Engineering | 1 Apr 2011
- On the implementation of the probabilistic logic programming language ProbLogTheory and Practice of Logic Programming, Vol. 11, No. 2-3 | 27 January 2011
- Query-preserving watermarking of relational databases and Xml documentsACM Transactions on Database Systems, Vol. 36, No. 1 | 18 March 2011
- Computational Complexity of Holant ProblemsSIAM Journal on Computing, Vol. 40, No. 4 | 19 July 2011
- On the Approximation Complexity HierarchyApproximation and Online Algorithms | 1 Jan 2011
- BMC: An Efficient Method to Evaluate Probabilistic Reachability QueriesDatabase Systems for Advanced Applications | 1 Jan 2011
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique WidthTheory and Applications of Models of Computation | 1 Jan 2011
- Geometric Computations on Indecisive PointsAlgorithms and Data Structures | 1 Jan 2011
- Closest Pair and the Post Office Problem for Stochastic PointsAlgorithms and Data Structures | 1 Jan 2011
- Improved Inapproximability Results for Counting Independent Sets in the Hard-Core ModelApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2011
- Trust Metrics for the SPKI/SDSI Authorisation FrameworkAutomated Technology for Verification and Analysis | 1 Jan 2011
- Concepts of Network ReliabilityWiley Encyclopedia of Operations Research and Management Science | 14 January 2011
- Scalable Influence Maximization in Social Networks under the Linear Threshold Model2010 IEEE International Conference on Data Mining | 1 Dec 2010
- The Meme Ranking Problem: Maximizing Microblogging Virality2010 IEEE International Conference on Data Mining Workshops | 1 Dec 2010
- Predicting direct protein interactions from affinity purification mass spectrometry dataAlgorithms for Molecular Biology, Vol. 5, No. 1 | 29 October 2010
- Counting complexity of propositional abductionJournal of Computer and System Sciences, Vol. 76, No. 7 | 1 Nov 2010
- Ranking distributed uncertain database systems: Discussion and analysisThe 2010 International Conference on Computer Engineering & Systems | 1 Nov 2010
- Computing event probability in probabilistic databases2010 IEEE International Conference on Intelligent Computing and Intelligent Systems | 1 Oct 2010
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome ReconstructionJournal of Computational Biology, Vol. 17, No. 9 | 1 Sep 2010
- Processing top-k join queriesProceedings of the VLDB Endowment, Vol. 3, No. 1-2 | 1 September 2010
- k-nearest neighbors in uncertain graphsProceedings of the VLDB Endowment, Vol. 3, No. 1-2 | 1 September 2010
- Towards certain fixes with editing rules and master dataProceedings of the VLDB Endowment, Vol. 3, No. 1-2 | 1 September 2010
- The Complexity of Problems for Quantified ConstraintsTheory of Computing Systems, Vol. 47, No. 2 | 25 February 2009
- Fast Discovery of Reliable Subnetworks2010 International Conference on Advances in Social Networks Analysis and Mining | 1 Aug 2010
- GRN model of probabilistic databasesProceedings of the 2010 ACM SIGMOD International Conference on Management of data | 6 June 2010
- On listing, sampling, and counting the chordal graphs with edge constraintsTheoretical Computer Science, Vol. 411, No. 26-28 | 1 Jun 2010
- All-Terminal Network Reliability Optimization in Fading Environment via Cross Entropy Method2010 IEEE International Conference on Communications | 1 May 2010
- Reliability in Layered Networks with Random Link Failures2010 Proceedings IEEE INFOCOM | 1 Mar 2010
- Opportunity-Based Topology Control in Wireless Sensor NetworksIEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 3 | 1 Mar 2010
- An information-theoretic analysis of worst-case redundancy in database designACM Transactions on Database Systems, Vol. 35, No. 1 | 15 February 2008
- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph ClassesGraph-Theoretic Concepts in Computer Science | 1 Jan 2010
- About the Enumeration Algorithms of Closed SetsFormal Concept Analysis | 1 Jan 2010
- Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain GraphsDatabase Systems for Advanced Applications | 1 Jan 2010
- Some Observations on Holographic AlgorithmsLATIN 2010: Theoretical Informatics | 1 Jan 2010
- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge FunctionsTheory and Applications of Models of Computation | 1 Jan 2010
- Fast Discovery of Reliable k-terminal SubgraphsAdvances in Knowledge Discovery and Data Mining | 1 Jan 2010
- Sparse Reliable Graph BackbonesAutomata, Languages and Programming | 1 Jan 2010
- Holographic Reduction: A Domain Changed Application and Its Partial Converse TheoremsAutomata, Languages and Programming | 1 Jan 2010
- On Tractable Exponential SumsFrontiers in Algorithmics | 1 Jan 2010
- Preprocessing Boolean Formulae for BDDs in a Probabilistic ContextLogics in Artificial Intelligence | 1 Jan 2010
- A Novel Method for Counting Models on Grid Boolean FormulasAdvances in Pattern Recognition | 1 Jan 2010
- Variable Compression in ProbLogLogic for Programming, Artificial Intelligence, and Reasoning | 1 Jan 2010
- Exponential Time Complexity of Weighted Counting of Independent SetsParameterized and Exact Computation | 1 Jan 2010
- The Exponential Time Complexity of Computing the Probability That a Graph Is ConnectedParameterized and Exact Computation | 1 Jan 2010
- From Holant to #CSP and Back: Dichotomy for Holant c ProblemsAlgorithms and Computation | 1 Jan 2010
- Satisfiability with Index DependencyAlgorithms and Computation | 1 Jan 2010
- Approximate confidence computation in probabilistic databases2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) | 1 Jan 2010
- Probabilistic Inductive Querying Using ProbLogInductive Databases and Constraint-Based Data Mining | 18 November 2010
- Monomial bases for broken circuit complexesEuropean Journal of Combinatorics, Vol. 30, No. 8 | 1 Nov 2009
- A rigorous methodology for specification and verification of business processesFormal Aspects of Computing, Vol. 21, No. 5 | 1 Oct 2009
- The trichotomy of HAVING queries on a probabilistic databaseThe VLDB Journal, Vol. 18, No. 5 | 15 July 2009
- Flows with unit path capacities and related packing and covering problemsJournal of Combinatorial Optimization, Vol. 18, No. 3 | 21 May 2009
- Counting the number of vertex covers in a trapezoid graphInformation Processing Letters, Vol. 109, No. 21-22 | 1 Oct 2009
- Availability-constrained Dedicated Segment Protection in circuit switched mesh networks2009 International Conference on Ultra Modern Telecommunications & Workshops | 1 Oct 2009
- OppCast: Opportunistic broadcast ofwarning messages in VANETs with unreliable links2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems | 1 Oct 2009
- Decomposition representations of logical equations in problems of inversion of discrete functionsJournal of Computer and Systems Sciences International, Vol. 48, No. 5 | 22 October 2009
- Computational complexity of impact size estimation for spreading processes on networksThe European Physical Journal B, Vol. 71, No. 4 | 17 October 2009
- The counting complexity of a simple scheduling problemOperations Research Letters, Vol. 37, No. 5 | 1 Sep 2009
- Complexity of counting the optimal solutionsTheoretical Computer Science, Vol. 410, No. 38-40 | 1 Sep 2009
- The complexity of weighted Boolean #CSP with mixed signsTheoretical Computer Science, Vol. 410, No. 38-40 | 1 Sep 2009
- A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing | 1 Sep 2009
- A survey of some network reliability analysis and synthesis resultsNetworks, Vol. 54, No. 2 | 1 Sep 2009
- On Counting 3-D Matchings of Size kAlgorithmica, Vol. 54, No. 4 | 3 July 2008
- A Note on Observables for Counting Trails and Paths in GraphsJournal of Mathematical Modelling and Algorithms, Vol. 8, No. 3 | 5 May 2009
- Robust web extractionProceedings of the 2009 ACM SIGMOD International Conference on Management of data | 29 June 2009
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P -completeDiscrete Applied Mathematics, Vol. 157, No. 11 | 1 Jun 2009
- All-Terminal Network Reliability Using Recursive Truncation AlgorithmIEEE Transactions on Reliability, Vol. 58, No. 2 | 1 Jun 2009
- MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKSDiscrete Mathematics, Algorithms and Applications, Vol. 01, No. 02 | 5 April 2012
- Enumeration aspects of maximal cliques and bicliquesDiscrete Applied Mathematics, Vol. 157, No. 7 | 1 Apr 2009
- Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein NetworksAdvances in Bioinformatics, Vol. 2009 | 23 Feb 2009
- Optimal inter-object correlation when replicating for availabilityDistributed Computing, Vol. 21, No. 5 | 11 November 2008
- Power in threshold network flow gamesAutonomous Agents and Multi-Agent Systems, Vol. 18, No. 1 | 19 July 2008
- Phase transition of multivariate polynomial systemsMathematical Structures in Computer Science, Vol. 19, No. 1 | 1 February 2009
- The Complexity of Weighted Boolean #CSPSIAM Journal on Computing, Vol. 38, No. 5 | 14 January 2009
- Some Computational Problems Related to Pseudo-intentsFormal Concept Analysis | 1 Jan 2009
- On the Connection between Interval Size Functions and Path CountingTheory and Applications of Models of Computation | 1 Jan 2009
- Power Indices in Spanning Connectivity GamesAlgorithmic Aspects in Information and Management | 1 Jan 2009
- A Dichotomy Theorem for Polynomial EvaluationMathematical Foundations of Computer Science 2009 | 1 Jan 2009
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome ReconstructionComparative Genomics | 1 Jan 2009
- Listing minimal edge-covers of intersecting families with applications to connectivity problemsDiscrete Applied Mathematics, Vol. 157, No. 1 | 1 Jan 2009
- Counting Problems and Clones of Functions2009 39th International Symposium on Multiple-Valued Logic | 1 Jan 2009
- Rigorous Probabilistic Trust-Inference with Applications to Clustering2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology | 1 Jan 2009
- Combinatorial Aspects of Move-Up Crews for Spreading Processes on NetworksOperations Research Proceedings 2008 | 2 April 2009
- From a Zoo to a Zoology: Towards a General Theory of Graph PolynomialsTheory of Computing Systems, Vol. 43, No. 3-4 | 6 July 2007
- Generating efficient safe query plans for probabilistic databasesData & Knowledge Engineering, Vol. 67, No. 3 | 1 Dec 2008
- Generating 3-vertex connected spanning subgraphsDiscrete Mathematics, Vol. 308, No. 24 | 1 Dec 2008
- The parameterized complexity of probability amplificationInformation Processing Letters, Vol. 109, No. 1 | 1 Dec 2008
- Kernels for Generalized Multiple-Instance LearningIEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 30, No. 12 | 1 Dec 2008
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph propertiesJournal of Computer and System Sciences, Vol. 74, No. 7 | 1 Nov 2008
- Random sampling of colourings of sparse random graphs with a constant number of coloursTheoretical Computer Science, Vol. 407, No. 1-3 | 1 Nov 2008
- Achieving compositionality of the stable model semantics for smodels programsTheory and Practice of Logic Programming, Vol. 8, No. 5-6 | 1 November 2008
- Universal relations and #P-completenessTheoretical Computer Science, Vol. 407, No. 1-3 | 1 Nov 2008
- Computing the Tutte Polynomial in Vertex-Exponential Time2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graphInformation Processing Letters, Vol. 107, No. 6 | 1 Aug 2008
- Probabilistic top- k and ranking-aggregate queriesACM Transactions on Database Systems, Vol. 33, No. 3 | 3 September 2008
- Multi-objective routing and topology optimization in networked embedded systems2008 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation | 1 Jul 2008
- Loss-aware network coding for unicast wireless sessionsACM SIGMETRICS Performance Evaluation Review, Vol. 36, No. 1 | 2 June 2008
- Some decision and counting problems of the Duquenne–Guigues basis of implicationsDiscrete Applied Mathematics, Vol. 156, No. 11 | 1 Jun 2008
- Computational aspects of monotone dualization: A brief surveyDiscrete Applied Mathematics, Vol. 156, No. 11 | 1 Jun 2008
- Complexity of DNF minimization and isomorphism testing for monotone formulasInformation and Computation, Vol. 206, No. 6 | 1 Jun 2008
- Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphsJournal of Discrete Algorithms, Vol. 6, No. 2 | 1 Jun 2008
- Hotness-Aware Sensor Networks2008 The 28th International Conference on Distributed Computing Systems | 1 Jun 2008
- Opportunity-Based Topology Control in Wireless Sensor Networks2008 The 28th International Conference on Distributed Computing Systems | 1 Jun 2008
- Probabilistic databasesACM SIGACT News, Vol. 39, No. 2 | 1 June 2008
- Pricing combinatorial markets for tournamentsProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2Proceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- On the counting complexity of propositional circumscriptionInformation Processing Letters, Vol. 106, No. 4 | 1 May 2008
- The consequences of eliminating NP solutionsComputer Science Review, Vol. 2, No. 1 | 1 Apr 2008
- Generating All Vertices of a Polyhedron Is HardDiscrete & Computational Geometry, Vol. 39, No. 1-3 | 5 March 2008
- Compressing probabilistic Prolog programsMachine Learning, Vol. 70, No. 2-3 | 8 November 2007
- Counting truth assignments of formulas of bounded tree-width or clique-widthDiscrete Applied Mathematics, Vol. 156, No. 4 | 1 Feb 2008
- On the number of Go positions on lattice graphsInformation Processing Letters, Vol. 105, No. 4 | 1 Feb 2008
- Holographic AlgorithmsSIAM Journal on Computing, Vol. 37, No. 5 | 8 February 2008
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?Complexity of Constraints | 1 Jan 2008
- New upper bound for the #3-SAT problemInformation Processing Letters, Vol. 105, No. 1 | 1 Dec 2007
- The complexity of two problems on arithmetic circuitsTheoretical Computer Science, Vol. 389, No. 1-2 | 1 Dec 2007
- On counting homomorphisms to directed acyclic graphsJournal of the ACM, Vol. 54, No. 6 | 1 December 2007
- On variable-weighted exact satisfiability problemsAnnals of Mathematics and Artificial Intelligence, Vol. 51, No. 1 | 10 October 2007
- End-to-end availability-dependent pricing of network servicesAnnals of Operations Research, Vol. 157, No. 1 | 13 September 2007
- Predecessor existence problems for finite discrete dynamical systemsTheoretical Computer Science, Vol. 386, No. 1-2 | 1 Oct 2007
- Location of a reliable center on a tree networkOperational Research, Vol. 7, No. 3 | 1 Sep 2007
- Counting and enumeration complexity with application to multicriteria schedulingAnnals of Operations Research, Vol. 153, No. 1 | 21 April 2007
- Computational complexity of counting problems on 3-regular planar graphsTheoretical Computer Science, Vol. 384, No. 1 | 1 Sep 2007
- Approximate Satisfiability CountingNinth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) | 1 Sep 2007
- Path-Constrained Relaxed Schedulability AnalysisNinth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007) | 1 Sep 2007
- Efficient query evaluation on probabilistic databasesThe VLDB Journal, Vol. 16, No. 4 | 10 June 2006
- On stability of a formal conceptAnnals of Mathematics and Artificial Intelligence, Vol. 49, No. 1-4 | 6 June 2007
- Phase transitions of PP-complete satisfiability problemsDiscrete Applied Mathematics, Vol. 155, No. 12 | 1 Jun 2007
- Polynomial time algorithm for an optimal stable assignment with multiple partnersTheoretical Computer Science, Vol. 379, No. 3 | 1 Jun 2007
- Towards a dichotomy theorem for the counting constraint satisfaction problemInformation and Computation, Vol. 205, No. 5 | 1 May 2007
- Fast and simple algorithms to count the number of vertex covers in an interval graphInformation Processing Letters, Vol. 102, No. 4 | 1 May 2007
- Graph factors and factorization: 1985–2003: A surveyDiscrete Mathematics, Vol. 307, No. 7-8 | 1 Apr 2007
- Efficient Top-k Query Evaluation on Probabilistic Data2007 IEEE 23rd International Conference on Data Engineering | 1 Apr 2007
- A Practical Scheme for Wireless Network OperationIEEE Transactions on Communications, Vol. 55, No. 3 | 1 Mar 2007
- Counting solutions to binomial complete intersectionsJournal of Complexity, Vol. 23, No. 1 | 1 Feb 2007
- The Complexity of Computing the Size of an IntervalSIAM Journal on Computing, Vol. 36, No. 5 | 21 December 2006
- On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected NetworksIEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications | 1 Jan 2007
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan)Journal of the Operations Research Society of Japan, Vol. 50, No. 4 | 1 Jan 2007
- An overview of computational complexityACM Turing award lectures | 1 January 2007
- Computational aspects of mining maximal frequent patternsTheoretical Computer Science, Vol. 362, No. 1-3 | 1 Oct 2006
- Accidental Algorthims2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) | 1 Oct 2006
- ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHSInternational Journal of Foundations of Computer Science, Vol. 17, No. 05 | 25 January 2012
- Covering minimum spanning trees of random subgraphsRandom Structures & Algorithms, Vol. 29, No. 3 | 27 December 2005
- Incremental Deterministic Planning2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing | 1 Sep 2006
- State-space partition techniques for multiterminal flows in stochastic networksNetworks, Vol. 48, No. 2 | 1 January 2006
- Computational complexity of stochastic programming problemsMathematical Programming, Vol. 106, No. 3 | 2 December 2005
- Counting complexity classes for numeric computations II: Algebraic and semialgebraic setsJournal of Complexity, Vol. 22, No. 2 | 1 Apr 2006
- Learning expressions and programs over monoidsInformation and Computation, Vol. 204, No. 2 | 1 Feb 2006
- The ultra-weak Ash conjecture and some particular casesMLQ, Vol. 52, No. 1 | 1 Jan 2006
- Counting Pseudo-intents and #P-completenessFormal Concept Analysis | 1 Jan 2006
- #3-Regular Bipartite Planar Vertex Cover is #P-CompleteTheory and Applications of Models of Computation | 1 Jan 2006
- Universal Relations and #P-CompletenessAlgorithms and Complexity | 1 Jan 2006
- Counting All Solutions of Minimum Weight Exact SatisfiabilityAlgorithms and Complexity | 1 Jan 2006
- From a Zoo to a Zoology: Descriptive Complexity for Graph PolynomialsLogical Approaches to Computational Barriers | 1 Jan 2006
- Link Discovery in Graphs Derived from Biological DatabasesData Integration in the Life Sciences | 1 Jan 2006
- The Complexity of Counting Functions with Easy Decision VersionMathematical Foundations of Computer Science 2006 | 1 Jan 2006
- Enumerating Spanning and Connected Subsets in Graphs and MatroidsAlgorithms – ESA 2006 | 1 Jan 2006
- The Parameterized Complexity of Enumerating Frequent ItemsetsParameterized and Exact Computation | 1 Jan 2006
- Randomized Approximations of Parameterized Counting ProblemsParameterized and Exact Computation | 1 Jan 2006
- Computing Graph Polynomials on Graphs of Bounded Clique-WidthGraph-Theoretic Concepts in Computer Science | 1 Jan 2006
- Working Models for Uncertain Data22nd International Conference on Data Engineering (ICDE'06) | 1 Jan 2006
- Design and Analysis of Convolution Kernels for Tree-Structured DataTransactions of the Japanese Society for Artificial Intelligence, Vol. 21 | 1 Jan 2006
- Landscape of Solutions in Constraint Satisfaction ProblemsPhysical Review Letters, Vol. 95, No. 20 | 10 November 2005
- Subtractive reductions and complete problems for counting complexity classesTheoretical Computer Science, Vol. 340, No. 3 | 1 Aug 2005
- Counting the different efficient paths for transportation networks and its applicationsJournal of Advanced Transportation, Vol. 39, No. 2 | 16 April 2010
- Counting models for 2SAT and 3SAT formulaeTheoretical Computer Science, Vol. 332, No. 1-3 | 1 Feb 2005
- The Computational Complexity of Tutte Invariants for Planar GraphsSIAM Journal on Computing, Vol. 35, No. 3 | 27 July 2006
- Logic, Randomness and CognitionLogic, Thought and Action | 1 Jan 2005
- Cyclic Pattern Kernels RevisitedAdvances in Knowledge Discovery and Data Mining | 1 Jan 2005
- A New Approach to Model CountingTheory and Applications of Satisfiability Testing | 1 Jan 2005
- Optimum Follow the Leader AlgorithmLearning Theory | 1 Jan 2005
- An Algebraic Approach to the Complexity of Generalized Conjunctive QueriesTheory and Applications of Satisfiability Testing | 1 Jan 2005
- Complexity of DNF and Isomorphism of Monotone FormulasMathematical Foundations of Computer Science 2005 | 1 Jan 2005
- On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph AutomataUnconventional Computation | 1 Jan 2005
- On the generation of circuits and minimal forbidden setsMathematical Programming, Vol. 102, No. 1 | 28 April 2004
- A Novel algorithm on network reliability estimationMathematical and Computer Modelling, Vol. 41, No. 2-3 | 1 Jan 2005
- Sensitivity analysis for robust parameter design experimentsProceedings of the Winter Simulation Conference, 2005. | 1 Jan 2005
- Counting for Satisfiability by Inverting ResolutionArtificial Intelligence Review, Vol. 22, No. 4 | 1 Dec 2004
- Difficult Problems in Threshold GraphsElectronic Notes in Discrete Mathematics, Vol. 18 | 1 Dec 2004
- Weak minimization of DFA—an algorithm and applicationsTheoretical Computer Science, Vol. 328, No. 1-2 | 1 Nov 2004
- High-Reliability Topological Architectures for Networks Under StressIEEE Journal on Selected Areas in Communications, Vol. 22, No. 9 | 1 Nov 2004
- Lower bounds and the hardness of counting propertiesTheoretical Computer Science, Vol. 326, No. 1-3 | 1 Oct 2004
- Counting consistent phylogenetic trees is #P-completeAdvances in Applied Mathematics, Vol. 33, No. 2 | 1 Aug 2004
- Complexity of learning in concept lattices from positive and negative examplesDiscrete Applied Mathematics, Vol. 142, No. 1-3 | 1 Aug 2004
- Expected Shortest Paths for Landmark-Based Robot NavigationThe International Journal of Robotics Research, Vol. 23, No. 7-8 | 1 August 2004
- Version spaces and the consistency problemArtificial Intelligence, Vol. 156, No. 2 | 1 Jul 2004
- Algorithms for four variants of the exact satisfiability problemTheoretical Computer Science, Vol. 320, No. 2-3 | 1 Jun 2004
- Predicting Protein Complex Membership Using Probabilistic Network ReliabilityGenome Research, Vol. 14, No. 6 | 12 May 2004
- Bounds on the Reliability of Distributed Systems With Unreliable Nodes & LinksIEEE Transactions on Reliability, Vol. 53, No. 2 | 1 Jun 2004
- Tight lower bounds on the ambiguity of strong, total, associative, one-way functionsJournal of Computer and System Sciences, Vol. 68, No. 3 | 1 May 2004
- Algorithmic uses of the Feferman–Vaught TheoremAnnals of Pure and Applied Logic, Vol. 126, No. 1-3 | 1 Apr 2004
- Arithmetic Circuits and Polynomial Replacement SystemsSIAM Journal on Computing, Vol. 33, No. 6 | 17 February 2012
- Deterministic Hypergraph Coloring and Its ApplicationsSIAM Journal on Discrete Mathematics, Vol. 18, No. 2 | 1 August 2006
- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant GraphsAlgorithms and Computation | 1 Jan 2004
- Efficient Query evaluation on Probabilistic DatabasesProceedings 2004 VLDB Conference | 1 Jan 2004
- Residual reliability of P-threshold graphsDiscrete Applied Mathematics, Vol. 135, No. 1-3 | 1 Jan 2004
- The Go polynomials of a graphTheoretical Computer Science, Vol. 306, No. 1-3 | 1 Sep 2003
- Linear-time algorithms for computing the reliability of bipartite and (#⩽2) star distributed computing systemsComputers & Operations Research, Vol. 30, No. 11 | 1 Sep 2003
- SIGACT News complexity theory column 41ACM SIGACT News, Vol. 34, No. 3 | 1 September 2003
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubesTheoretical Computer Science, Vol. 304, No. 1-3 | 1 Jul 2003
- The Hamiltonian circuit problem and automaton theoryACM SIGACT News, Vol. 34, No. 2 | 1 June 2003
- Discovering all most specific sentencesACM Transactions on Database Systems, Vol. 28, No. 2 | 1 June 2003
- Computational properties of metaquerying problemsACM Transactions on Computational Logic, Vol. 4, No. 2 | 1 Apr 2003
- The complexity of the characteristic and the minimal polynomialTheoretical Computer Science, Vol. 295, No. 1-3 | 1 Feb 2003
- Counting Complexity Classes for Numeric Computations I: Semilinear SetsSIAM Journal on Computing, Vol. 33, No. 1 | 17 February 2012
- Stable Marriages with Multiple Partners: Efficient Search for an Optimal SolutionAutomata, Languages and Programming | 18 June 2003
- Weak Minimization of DFA — An Algorithm and ApplicationsImplementation and Application of Automata | 24 June 2003
- Counting Complexity Classes over the Reals I: The Additive CaseAlgorithms and Computation | 1 Jan 2003
- Improved Algorithms for Counting Solutions in Constraint Satisfaction ProblemsPrinciples and Practice of Constraint Programming – CP 2003 | 1 Jan 2003
- Some Algorithmic Problems in Polytope TheoryAlgebra, Geometry and Software Systems | 1 Jan 2003
- A practical comparison of methods to assess sum-of-productsReliability Engineering & System Safety, Vol. 79, No. 1 | 1 Jan 2003
- Search for all MCs in networks with unreliable nodes and arcsReliability Engineering & System Safety, Vol. 79, No. 1 | 1 Jan 2003
- Combinatorial Reliability OptimizationHandbook of Reliability Engineering | 1 Jan 2003
- Multiobjective Combinatorial Optimization — Theory, Methodology, and ApplicationsMultiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys | 1 Jan 2003
- Search for all d-Mincuts of a limited-flow networkComputers & Operations Research, Vol. 29, No. 13 | 1 Nov 2002
- Recognition and dualization of disguised bidual Horn functionsInformation Processing Letters, Vol. 82, No. 6 | 1 Jun 2002
- Nonerasing, Counting, and Majority over the Linear Time HierarchyInformation and Computation, Vol. 174, No. 2 | 1 May 2002
- Exploiting structure in quantified formulasJournal of Algorithms, Vol. 43, No. 2 | 1 May 2002
- Search for minimal paths in modified networksReliability Engineering & System Safety, Vol. 75, No. 3 | 1 Mar 2002
- A linear-time algorithm for computing K-terminal reliability on proper interval graphsIEEE Transactions on Reliability, Vol. 51, No. 1 | 1 Mar 2002
- The Complexity of the InertiaFST TCS 2002: Foundations of Software Technology and Theoretical Computer Science | 16 December 2002
- Towards a Predictive Computational Complexity TheoryAutomata, Languages and Programming | 25 June 2002
- Counting Satisfying Assignments in 2-SAT and 3-SATComputing and Combinatorics | 29 August 2002
- Determining the Number of Solutions to Binary CSP InstancesPrinciples and Practice of Constraint Programming - CP 2002 | 2 September 2002
- Lower Bounds and the Hardness of Counting PropertiesFoundations of Information Technology in the Era of Network and Mobile Computing | 1 Jan 2002
- Decision lists and related Boolean functionsTheoretical Computer Science, Vol. 270, No. 1-2 | 1 Jan 2002
- Counting over non-planar graphsPhysica A: Statistical Mechanics and its Applications, Vol. 302, No. 1-4 | 1 Dec 2001
- Mathematical foundations of minimal cutsetsIEEE Transactions on Reliability, Vol. 50, No. 4 | 1 Dec 2001
- SIGACT news complexity theory column 34ACM SIGACT News, Vol. 32, No. 4 | 1 December 2001
- Quorum Systems Constructed from Combinatorial DesignsInformation and Computation, Vol. 169, No. 2 | 1 Sep 2001
- A simple algorithm to search for all d-MPs with unreliable nodesReliability Engineering & System Safety, Vol. 73, No. 1 | 1 Jul 2001
- The distributed program reliability analysis on ring-type topologiesComputers & Operations Research, Vol. 28, No. 7 | 1 Jun 2001
- Learning to Select Branching Rules in the DPLL Procedure for SatisfiabilityElectronic Notes in Discrete Mathematics, Vol. 9 | 1 Jun 2001
- Counting and Gröbner BasesJournal of Symbolic Computation, Vol. 31, No. 3 | 1 Mar 2001
- Model calculations to estimate the probability of secret reconstruction in computer environmentsInformation Management & Computer Security, Vol. 9, No. 1 | 1 Mar 2001
- Efficient reasoningACM Computing Surveys, Vol. 33, No. 1 | 1 March 2001
- Search for MC in modified networksComputers & Operations Research, Vol. 28, No. 2 | 1 Feb 2001
- The complexity of counting problemsAspects of Complexity | 31 Jan 2001
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability ProblemSIAM Review, Vol. 43, No. 3 | 4 August 2006
- The Complexity of Counting in Sparse, Regular, and Planar GraphsSIAM Journal on Computing, Vol. 31, No. 2 | 27 July 2006
- Efficiently Approximating Weighted Sums with Exponentially Many TermsComputational Learning Theory | 13 September 2001
- The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube GraphsMathematical Foundations of Computer Science 2001 | 5 September 2001
- The Complexity of Some Basic Problems for Dynamic Process GraphsAlgorithms and Computation | 4 December 2001
- A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle GraphsComputational Science - ICCS 2001 | 17 July 2001
- The Complexity of Computing the Size of an IntervalAutomata, Languages and Programming | 4 July 2001
- A simple approach to search for all d-MCs of a limited-flow networkReliability Engineering & System Safety, Vol. 71, No. 1 | 1 Jan 2001
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONSInternational Journal of Foundations of Computer Science, Vol. 11, No. 04 | 20 November 2011
- The complexity of counting graph homomorphismsRandom Structures and Algorithms, Vol. 17, No. 3-4 | 1 January 2000
- Unification Algorithms Cannot Be Combined in Polynomial TimeInformation and Computation, Vol. 162, No. 1-2 | 1 Oct 2000
- A second step towards complexity-theoretic analogs of Rice's TheoremTheoretical Computer Science, Vol. 244, No. 1-2 | 1 Aug 2000
- THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHYInternational Journal of Foundations of Computer Science, Vol. 11, No. 02 | 20 November 2011
- STATIC AND DYNAMIC EVALUATION OF QoS PROPERTIESJournal of Interconnection Networks, Vol. 01, No. 02 | 25 January 2012
- Tally NP Sets and Easy Census FunctionsInformation and Computation, Vol. 158, No. 1 | 1 Apr 2000
- Cook's versus Valiant's hypothesisTheoretical Computer Science, Vol. 235, No. 1 | 1 Mar 2000
- Combinatorial and topological approach to the 3D Ising modelJournal of Physics A: Mathematical and General, Vol. 33, No. 4 | 24 January 2000
- Domination of cyclic monotone (s, t)-graphsMathematical Notes, Vol. 67, No. 2 | 1 Feb 2000
- BibliographyTheory of Computational Complexity | 6 December 2013
- Arithmetic Circuits and Polynomial Replacement SystemsFST TCS 2000: Foundations of Software Technology and Theoretical Computer Science | 24 November 2000
- Subtractive Reductions and Complete Problems for Counting Complexity ClassesMathematical Foundations of Computer Science 2000 | 1 June 2001
- Computational Politics: Electoral SystemsMathematical Foundations of Computer Science 2000 | 1 June 2001
- Machine Partitioning and Scheduling under Fault-Tolerance ConstraintsApproximation and Complexity in Numerical Optimization | 1 Jan 2000
- Hard to Say It’s Easy — Four Reasons Why Combinatorial Multiobjective Programmes Are HardResearch and Practice in Multiple Criteria Decision Making | 1 Jan 2000
- New Results in Cutting Seriation for Approximate #SATData Analysis | 1 Jan 2000
- Counting Unlabelled Subtrees of a Tree is #P-completeLMS Journal of Computation and Mathematics, Vol. 3 | 1 February 2010
- Доминирование циклических монотонных $(s,t)$-графовМатематические заметки, Vol. 67, No. 2 | 1 Jan 2000
- An optimized procedure to generate sums of disjoint productsReliability Engineering & System Safety, Vol. 65, No. 3 | 1 Sep 1999
- SELF-SPECIFYING MACHINESInternational Journal of Foundations of Computer Science, Vol. 10, No. 03 | 30 April 2012
- Distributed-program reliability analysis: complexity and efficient algorithmsIEEE Transactions on Reliability, Vol. 48, No. 1 | 1 Mar 1999
- A semantic tree algorithm for the generation of sextet polynomials of hexagonal systemsComputers & Mathematics with Applications, Vol. 37, No. 3 | 1 Feb 1999
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability ProblemSIAM Journal on Computing, Vol. 29, No. 2 | 27 July 2006
- On the Complexity of Counting the Hilbert Basis of a Linear Diophantine SystemLogic for Programming and Automated Reasoning | 1 Jan 1999
- The Maximum Clique ProblemHandbook of Combinatorial Optimization | 1 Jan 1999
- Efficient Redundant Assignments under Fault-Tolerance ConstraintsRandomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 1999
- A probability model for reconstructing secret sharing under the internet environmentInformation Sciences, Vol. 116, No. 2-4 | 1 Jan 1999
- Propagating Distributions Up Directed Acyclic GraphsNeural Computation, Vol. 11, No. 1 | 1 Jan 1999
- A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic networkIEEE Transactions on Reliability, Vol. 47, No. 4 | 1 Dec 1998
- Bicycle Dimension and Special Points of the Tutte PolynomialJournal of Combinatorial Theory, Series B, Vol. 74, No. 2 | 1 Nov 1998
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automataMathematical and Computer Modelling, Vol. 28, No. 10 | 1 Nov 1998
- The vertex set of a 01-polytope is strongly P-enumerableComputational Geometry, Vol. 11, No. 2 | 1 Oct 1998
- Power balance and apportionment algorithms for the United States CongressACM Journal of Experimental Algorithmics, Vol. 3 | 1 September 1998
- An Efficient Parallel Strategy for ComputingK-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-TreesJournal of Parallel and Distributed Computing, Vol. 51, No. 2 | 1 Jun 1998
- A catalog of minimally nonideal matricesMathematical Methods of Operations Research, Vol. 47, No. 2 | 1 Jun 1998
- Two-path subsets: Efficient counting and applications to performability analysisDiscrete Applied Mathematics, Vol. 85, No. 1 | 1 Jun 1998
- The Complexity of Planar Counting ProblemsSIAM Journal on Computing, Vol. 27, No. 4 | 28 July 2006
- Approximately Counting Hamilton Paths and Cycles in Dense GraphsSIAM Journal on Computing, Vol. 27, No. 5 | 28 July 2006
- On The Complexity of Computing Mixed VolumesSIAM Journal on Computing, Vol. 27, No. 2 | 28 July 2006
- Metafinite Model TheoryInformation and Computation, Vol. 140, No. 1 | 1 Jan 1998
- Deterministic Hypergraph Coloring and Its ApplicationsRandomization and Approximation Techniques in Computer Science | 11 June 1999
- Uniformly defining complexity classes of functionsSTACS 98 | 20 June 2005
- A second step towards circuit complexity-theoretic analogs of Rice's theoremMathematical Foundations of Computer Science 1998 | 28 May 2006
- Tally NP sets and easy census functionsMathematical Foundations of Computer Science 1998 | 28 May 2006
- A Bayesian approach to relevance in game playingArtificial Intelligence, Vol. 97, No. 1-2 | 1 Dec 1997
- The computational complexity of the reliability problem on distributed systemsInformation Processing Letters, Vol. 64, No. 3 | 1 Nov 1997
- Counting Problems Associated With Steiner Trees In GraphsSIAM Journal on Discrete Mathematics, Vol. 10, No. 3 | 1 August 2006
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedronComputational Geometry, Vol. 8, No. 1 | 1 Jun 1997
- Computing optimal assignments for residual network reliabilityDiscrete Applied Mathematics, Vol. 75, No. 3 | 1 Jun 1997
- Random Debaters and the Hardness of Approximating Stochastic FunctionsSIAM Journal on Computing, Vol. 26, No. 2 | 28 July 2006
- Note on complexity of computing the domination of binary systemsDiscrete Applied Mathematics, Vol. 73, No. 3 | 1 Mar 1997
- Discovering all most specific sentences by randomized algorithms extended abstractDatabase Theory — ICDT '97 | 3 June 2005
- Counting ComplexityComplexity Theory Retrospective II | 1 Jan 1997
- Measure One Results in Computational Complexity TheoryAdvances in Algorithms, Languages, and Complexity | 1 Jan 1997
- On the complexity of unification and disunification in commutative idempotent semigroupsPrinciples and Practice of Constraint Programming-CP97 | 10 June 2005
- The operators min and max on the polynomial hierarchySTACS 97 | 10 June 2005
- On generating all solutions of generalized satisfiability problemsRAIRO - Theoretical Informatics and Applications, Vol. 31, No. 6 | 8 January 2011
- Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approachTelecommunication Systems, Vol. 6, No. 1 | 1 Dec 1996
- Introduction to special issue on randomized and derandomized algorithmsAlgorithmica, Vol. 16, No. 4-5 | 1 Oct 1996
- Series-parallel posets and the Tutte polynomialDiscrete Mathematics, Vol. 158, No. 1-3 | 1 Oct 1996
- Mathematical aspects of concept analysisJournal of Mathematical Sciences, Vol. 80, No. 2 | 1 Jun 1996
- Querying disjunctive databases through nonmonotonic logicsTheoretical Computer Science, Vol. 160, No. 1-2 | 1 Jun 1996
- On the complexity of partially observed Markov decision processesTheoretical Computer Science, Vol. 157, No. 2 | 1 May 1996
- An Algebraic Model for Combinatorial ProblemsSIAM Journal on Computing, Vol. 25, No. 2 | 13 July 2006
- On the hardness of approximate reasoningArtificial Intelligence, Vol. 82, No. 1-2 | 1 Apr 1996
- Fixed Point Approximations for Retrial NetworksProbability in the Engineering and Informational Sciences, Vol. 10, No. 2 | 27 July 2009
- Heuristic enhancements of the search for the generation of all perfect matchingsApplied Mathematics Letters, Vol. 9, No. 2 | 1 Mar 1996
- Asymptotic Conditional Probabilities: The Unary CaseSIAM Journal on Computing, Vol. 25, No. 1 | 31 July 2006
- On the complexity of computational problems associated with simple stochastic gamesComputing and Combinatorics | 4 June 2005
- Unification algorithms cannot be combined in polynomial timeAutomated Deduction — Cade-13 | 4 June 2005
- A short certificate of the number of universal optimal strategies for stopping simple stochastic gamesInformation Processing Letters, Vol. 57, No. 1 | 1 Jan 1996
- Rational transductions and complexity of counting problemsMathematical Systems Theory, Vol. 28, No. 5 | 1 Sep 1995
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, Vol. 24, No. 3 | 13 July 2006
- Optimal coteries for rings and related networksDistributed Computing, Vol. 8, No. 4 | 1 Jun 1995
- On edge transitivity of directed graphsDiscrete Mathematics, Vol. 141, No. 1-3 | 1 Jun 1995
- An optimal algorithm for finding the most vital edge with respect to SKT reliability in BSP digraphsJournal of the Chinese Institute of Engineers, Vol. 18, No. 4 | 1 Jun 1995
- Threshold reliability of networks with small failure setsNetworks, Vol. 25, No. 3 | 11 October 2006
- Monte Carlo and Markov Chain techniques for network reliability and samplingNetworks, Vol. 25, No. 3 | 11 October 2006
- A forbidden minor characterization and reliability of a class of partial 4‐treesNetworks, Vol. 25, No. 3 | 11 October 2006
- The complexity of computing the tutte polynomial on transversal matroidsCombinatorica, Vol. 15, No. 1 | 1 Mar 1995
- The complexities of the coefficients of the Tutte polynomialDiscrete Applied Mathematics, Vol. 57, No. 2-3 | 1 Feb 1995
- Comparing counting classes for logspace, one-way logspace, and first-orderMathematical Foundations of Computer Science 1995 | 2 June 2005
- Witness-isomorphic reductions and the local search problem (extended abstract)Mathematical Foundations of Computer Science 1995 | 2 June 2005
- The Computational Complexity of CountingProceedings of the International Congress of Mathematicians | 1 Jan 1995
- Chapter 11 Network reliabilityNetwork Models | 1 Jan 1995
- Problem of computing the expected maximum number of vertex‐disjoint s‐t paths on probabilistic digraphsElectronics and Communications in Japan (Part III: Fundamental Electronic Science), Vol. 78, No. 1 | 23 February 2007
- Heuristic sampling on DAGsAlgorithmica, Vol. 12, No. 6 | 1 Dec 1994
- Algorithms to count paths and cyclesInformation Processing Letters, Vol. 52, No. 5 | 1 Dec 1994
- Reliability analysis of the double counter-rotating ring with concentrator attachmentsIEEE/ACM Transactions on Networking, Vol. 2, No. 5 | 1 Oct 1994
- On closure properties of GapPComputational Complexity, Vol. 4, No. 3 | 1 Sep 1994
- A New Approach to Stable Matching ProblemsSIAM Journal on Computing, Vol. 23, No. 4 | 13 July 2006
- On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graphInformation Processing Letters, Vol. 51, No. 4 | 1 Aug 1994
- Counting trees in a graph is #P-completeInformation Processing Letters, Vol. 51, No. 3 | 1 Aug 1994
- Simple characterizations of P(#P) and complete problemsJournal of Computer and System Sciences, Vol. 49, No. 1 | 1 Aug 1994
- Complexity of Network Reliability and Optimal Resource Placement ProblemsSIAM Journal on Computing, Vol. 23, No. 3 | 31 July 2006
- Bounding algorithms for two-terminal network reliabilityMicroelectronics Reliability, Vol. 34, No. 6 | 1 Jun 1994
- Complexity theory column 5ACM SIGACT News, Vol. 25, No. 2 | 1 June 1994
- The maximum clique problemJournal of Global Optimization, Vol. 4, No. 3 | 1 Apr 1994
- Computational complexity of loss networksTheoretical Computer Science, Vol. 125, No. 1 | 1 Mar 1994
- Network s-t reliability bounds using a 2-dimensional reliability polynomialIEEE Transactions on Reliability, Vol. 43, No. 1 | 1 Mar 1994
- Extending matchings in claw-free graphsDiscrete Mathematics, Vol. 125, No. 1-3 | 1 Feb 1994
- The complexity of counting problems in equational matchingAutomated Deduction — CADE-12 | 30 May 2005
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computingAutomata, Languages and Programming | 29 May 2005
- On the interactive complexity of graph reliabilityFoundation of Software Technology and Theoretical Computer Science | 1 June 2005
- My favorite ten complexity theorems of the past decadeFoundation of Software Technology and Theoretical Computer Science | 1 June 2005
- The computational complexity of knot and matroid polynomialsDiscrete Mathematics, Vol. 124, No. 1-3 | 1 Jan 1994
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, Vol. 7, No. 1 | 1 Jan 1994
- The complexity of computing maximal word functionsComputational Complexity, Vol. 3, No. 4 | 1 Dec 1993
- Evaluating performability: Most probable states and boundsTelecommunication Systems, Vol. 2, No. 1 | 1 Dec 1993
- Connectability: a performance metric for reconfigurable transport networksIEEE Journal on Selected Areas in Communications, Vol. 11, No. 9 | 1 Dec 1993
- Finding the most vital edge with respect to K-terminal reliability in series-parallel networksComputers & Industrial Engineering, Vol. 25, No. 1-4 | 1 Sep 1993
- Computing residual connectedness reliability for restricted networksDiscrete Applied Mathematics, Vol. 44, No. 1-3 | 1 Jul 1993
- A complexity theory for feasible closure propertiesJournal of Computer and System Sciences, Vol. 46, No. 3 | 1 Jun 1993
- On the Structure of the Strong Orientations of a GraphSIAM Journal on Discrete Mathematics, Vol. 6, No. 1 | 17 February 2012
- A very hard log-space counting classTheoretical Computer Science, Vol. 107, No. 1 | 1 Jan 1993
- Part-II: Probabilistic Graph-Reduction TechniquesNew Trends in System Reliability Evaluation | 1 Jan 1993
- Lattice PointsHandbook of Convex Geometry | 1 Jan 1993
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functionsRAIRO - Theoretical Informatics and Applications, Vol. 27, No. 2 | 8 January 2011
- Algorithms for K‐terminal reliability problems with node failuresNetworks, Vol. 22, No. 4 | 11 October 2006
- A note on boundingk-terminal reliabilityAlgorithmica, Vol. 7, No. 1-6 | 1 Jun 1992
- Polynomial-time 1-Turing reductions from #PH to #PTheoretical Computer Science, Vol. 100, No. 1 | 1 Jun 1992
- The Computational Complexity of the Tutte Plane: the Bipartite CaseCombinatorics, Probability and Computing, Vol. 1, No. 2 | 12 September 2008
- An analogue of Hoffman's circulation conditions for max-balanced flowsMathematical Programming, Vol. 57, No. 1-3 | 1 May 1992
- On integer points in polyhedraCombinatorica, Vol. 12, No. 1 | 1 Mar 1992
- Polynomial-time compressionComputational Complexity, Vol. 2, No. 1 | 1 Mar 1992
- Restricted relativizations of probabilistic polynomial timeTheoretical Computer Science, Vol. 93, No. 2 | 1 Feb 1992
- Rational transductions and complexity of counting problemsMathematical Foundations of Computer Science 1992 | 30 July 2005
- On the expansion of combinatorial polytopesMathematical Foundations of Computer Science 1992 | 30 July 2005
- Chapter 6 GeneralizationsThe Steiner Tree Problem | 1 Jan 1992
- Minimum-expected-delay alternate routing[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications | 1 Jan 1992
- Characterizing stochastic flow networks using the monte carlo methodNetworks, Vol. 21, No. 7 | 11 October 2006
- PP is as Hard as the Polynomial-Time HierarchySIAM Journal on Computing, Vol. 20, No. 5 | 13 July 2006
- The complexity of computing the number of strings of given length in context-free languagesTheoretical Computer Science, Vol. 86, No. 2 | 1 Sep 1991
- On Counting Lattice Points in PolyhedraSIAM Journal on Computing, Vol. 20, No. 4 | 13 July 2006
- Near-Testable SetsSIAM Journal on Computing, Vol. 20, No. 3 | 13 July 2006
- The computational complexity of abductionArtificial Intelligence, Vol. 49, No. 1-3 | 1 May 1991
- A note on enumerative countingInformation Processing Letters, Vol. 38, No. 4 | 1 May 1991
- Reliability covering problemsNetworks, Vol. 21, No. 3 | 11 October 2006
- A linear-time approximation method for computing the reliability of a networkComputer Networks and ISDN Systems, Vol. 21, No. 2 | 1 Apr 1991
- A general-purpose, high performance algorithm for distributed systems reliability evaluationComputer Networks and ISDN Systems, Vol. 21, No. 2 | 1 Apr 1991
- Counting the number of solutions for instances of satisfiabilityTheoretical Computer Science, Vol. 81, No. 1 | 1 Apr 1991
- Sensitivity Analysis for the System Reliability FunctionProbability in the Engineering and Informational Sciences, Vol. 5, No. 2 | 27 July 2009
- The complexity of controlled selectionInformation and Computation, Vol. 91, No. 1 | 1 Mar 1991
- Fast algorithm for computing the reliability of a communication networkInternational Journal of Electronics, Vol. 70, No. 3 | 1 Mar 1991
- The Complexity of the Residual Node Connectedness Reliability ProblemSIAM Journal on Computing, Vol. 20, No. 1 | 13 July 2006
- The complexity of computing maximal word functionsFundamentals of Computation Theory | 9 June 2005
- On the structure and complexity of infinite sets with minimal perfect hash functionsFoundations of Software Technology and Theoretical Computer Science | 31 May 2005
- Complete problems involving boolean labelled structures and projection translationsFoundations of Software Technology and Theoretical Computer Science | 31 May 2005
- Counting linear extensionsOrder, Vol. 8, No. 3 | 1 Jan 1991
- On the power of parity polynomial timeMathematical Systems Theory, Vol. 23, No. 1 | 1 Dec 1990
- Efficient algorithms for computing the reliability of permutation and interval graphsNetworks, Vol. 20, No. 7 | 11 October 2006
- On the complexity of rankingJournal of Computer and System Sciences, Vol. 41, No. 2 | 1 Oct 1990
- Polynomial-time inference of all valid implications for Horn and related formulaeAnnals of Mathematics and Artificial Intelligence, Vol. 1, No. 1-4 | 1 September 1990
- A logic-based analysis of Dempster-Shafer theoryInternational Journal of Approximate Reasoning, Vol. 4, No. 5-6 | 1 Sep 1990
- Dempster's rule of combination is #P-completeArtificial Intelligence, Vol. 44, No. 1-2 | 1 Jul 1990
- On the computational complexity of the Jones and Tutte polynomialsMathematical Proceedings of the Cambridge Philosophical Society, Vol. 108, No. 1 | 24 October 2008
- Counting problems and algebraic formal power series in noncommuting variablesInformation Processing Letters, Vol. 34, No. 3 | 1 Apr 1990
- Algorithms from complexity theory: Polynomial-time operations for complex setsAlgorithms | 4 June 2005
- The Power of CountingComplexity Theory Retrospective | 1 Jan 1990
- Generating Graphs Uniformly at RandomComputational Graph Theory | 1 Jan 1990
- A Catalog of Complexity ClassesAlgorithms and Complexity | 1 Jan 1990
- Algebraic Complexity TheoryAlgorithms and Complexity | 1 Jan 1990
- Synthesis of neural networks with linear programs1990 IJCNN International Joint Conference on Neural Networks | 1 Jan 1990
- A fast, general-purpose algorithm for reliability evaluation of distributed systemsNinth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings | 1 Jan 1990
- An algorithm for the computation of computer network reliability in linear-timeNinth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings | 1 Jan 1990
- Polynomial Space Counting ProblemsSIAM Journal on Computing, Vol. 18, No. 6 | 13 July 2006
- Approximating the PermanentSIAM Journal on Computing, Vol. 18, No. 6 | 13 July 2006
- Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levelsNaval Research Logistics, Vol. 36, No. 6 | 1 Dec 1989
- Graphs associated with triangulations of lattice polygonsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, Vol. 47, No. 3 | 9 April 2009
- Computing 2-terminal reliability for radio-broadcast networksIEEE Transactions on Reliability, Vol. 38, No. 5 | 1 Dec 1989
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, Vol. 10, No. 3 | 1 Sep 1989
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, Vol. 82, No. 1 | 1 Jul 1989
- Enumerative counting is hardInformation and Computation, Vol. 82, No. 1 | 1 Jul 1989
- The architecture of complexity: A new blueprintSynthese, Vol. 79, No. 3 | 1 Jun 1989
- Triconnected decomposition for computing K ‐terminal network reliabilityNetworks, Vol. 19, No. 2 | 11 October 2006
- On counting and approximationActa Informatica, Vol. 26, No. 4 | 1 Feb 1989
- On the complexity of satisfiability problems for algebraic structures (preliminary report)Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 1 June 2005
- Edge-packing of graphs and network reliabilityDiscrete Mathematics, Vol. 72, No. 1-3 | 1 Dec 1988
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, Vol. 17, No. 5 | 31 July 2006
- Lower bounds on two-terminal network reliabilityDiscrete Applied Mathematics, Vol. 21, No. 3 | 1 Oct 1988
- Parallel computation with threshold functionsJournal of Computer and System Sciences, Vol. 36, No. 3 | 1 Jun 1988
- Computational complexity of PERT problemsNetworks, Vol. 18, No. 2 | 11 October 2006
- Water Distribution Reliability: Analytical MethodsJournal of Water Resources Planning and Management, Vol. 114, No. 3 | 1 May 1988
- Enumerative techniques for solving some nonconvex global optimization problemsOR Spektrum, Vol. 10, No. 1 | 1 Mar 1988
- The complexity of a counting finite-state automatonFoundations of Software Technology and Theoretical Computer Science | 31 May 2005
- Symbolical Expressions for the Reliability of Complex SystemsGI — 18. Jahrestagung II | 1 Jan 1988
- Generalizing Fuzzy Logic Probabilistic InferencesUncertainty in Artificial Intelligence | 1 Jan 1988
- Edge-Packings of Graphs and Network ReliabilityGraph Theory and Applications, Proceedings of the First Japan Conference on Graph Theory and Applications | 1 Jan 1988
- Nonlinear Algebra and Optimization on Rings are “Hard”SIAM Journal on Computing, Vol. 16, No. 5 | 31 July 2006
- Counting almost minimum cutsets with reliability applicationsMathematical Programming, Vol. 39, No. 3 | 1 Oct 1987
- Consecutive-2 systems on treesProbability in the Engineering and Informational Sciences, Vol. 1, No. 4 | 27 July 2009
- Oracles for Deterministic Versus Alternating ClassesSIAM Journal on Computing, Vol. 16, No. 4 | 31 July 2006
- Permutations with Restricted DisplacementSIAM Journal on Algebraic Discrete Methods, Vol. 8, No. 3 | 17 July 2006
- Two-dimensional monomer-dimer systems are computationally intractableJournal of Statistical Physics, Vol. 48, No. 1-2 | 1 Jul 1987
- An application of the planar separator theorem to counting problemsInformation Processing Letters, Vol. 25, No. 5 | 1 Jul 1987
- Algebraic Methods Applied to Network Reliability ProblemsSIAM Journal on Algebraic Discrete Methods, Vol. 8, No. 2 | 17 July 2006
- Classifying the computational complexity of problemsThe Journal of Symbolic Logic, Vol. 52, No. 1 | 12 March 2014
- Uniform computational complexity of Taylor seriesAutomata, Languages and Programming | 29 May 2005
- Calculating the S-T up and down distributions of a class of stochastic networksMicroelectronics Reliability, Vol. 27, No. 2 | 1 Jan 1987
- Bounds for All-Terminal Reliability in Planar NetworksAnnals of Discrete Mathematics (33), Proceedings of the International Conference on Finite Geometries and Combinatorial Structures | 1 Jan 1987
- Product form parametric representation of the solutions to a quadratic boolean equationRAIRO - Operations Research, Vol. 21, No. 4 | 29 March 2011
- Steiner problem in networks: A surveyNetworks, Vol. 17, No. 2 | 11 October 2006
- Improving reliability bounds in computer networksNetworks, Vol. 16, No. 4 | 11 October 2006
- Searching in Trees, Series-Parallel and Interval OrdersSIAM Journal on Computing, Vol. 15, No. 4 | 31 July 2006
- Current Telecommunication Network Reliability Models: A Critical AssessmentIEEE Journal on Selected Areas in Communications, Vol. 4, No. 7 | 1 Oct 1986
- A Survey of Network Reliability Modeling and CalculationsMILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's | 1 Oct 1986
- The Complexity of Counting Stable MarriagesSIAM Journal on Computing, Vol. 15, No. 3 | 31 July 2006
- The Complexity of Reliability Computations in Planar and Acyclic GraphsSIAM Journal on Computing, Vol. 15, No. 3 | 31 July 2006
- Computational Complexity of Network Reliability Analysis: An OverviewIEEE Transactions on Reliability, Vol. 35, No. 3 | 1 Aug 1986
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel NetworksIEEE Transactions on Reliability, Vol. 35, No. 3 | 1 Aug 1986
- Efficient algorithms for reliability analysis of planar networks - a surveyIEEE Transactions on Reliability, Vol. 35, No. 3 | 1 Aug 1986
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, Vol. 33, No. 3 | 1 May 1986
- Hard Enumeration Problems in Geometry and CombinatoricsSIAM Journal on Algebraic Discrete Methods, Vol. 7, No. 2 | 17 July 2006
- Approximation to measurable functions and its relation to probabilistic computationAnnals of Pure and Applied Logic, Vol. 30, No. 2 | 1 Feb 1986
- Parallel computation with threshold functionsStructure in Complexity Theory | 2 June 2005
- What Is Enumerative Combinatorics?Enumerative Combinatorics | 1 Jan 1986
- A probabilistic analysis of Monte Carlo algorithms for a class of counting problemsStochastic Programming | 30 September 2005
- Some observations on the connection between counting and recursionTheoretical Computer Science, Vol. 47 | 1 Jan 1986
- On the construction of parallel computers from various bases of boolean functionsTheoretical Computer Science, Vol. 43 | 1 Jan 1986
- The complexity of colouring problems on dense graphsTheoretical Computer Science, Vol. 43 | 1 Jan 1986
- ReferencesMatching Theory | 1 Jan 1986
- Nonlevelable sets and immune sets in the accepting density hierarchy inNPMathematical Systems Theory, Vol. 18, No. 1 | 1 Dec 1985
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, Vol. 14, No. 4 | 13 July 2006
- On Approximation Algorithms for # PSIAM Journal on Computing, Vol. 14, No. 4 | 13 July 2006
- An analysis of monte carlo algorithms for counting problemsCalcolo, Vol. 22, No. 4 | 1 Oct 1985
- Monte-Carlo algorithms for the planar multiterminal network reliability problemJournal of Complexity, Vol. 1, No. 1 | 1 Oct 1985
- Voronoi diagrams with barriers and on polyhedra for minimal path planningThe Visual Computer, Vol. 1, No. 2 | 1 Aug 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 6, No. 2 | 1 Jun 1985
- A factoring algorithm using polygon‐to‐chain reductions for computing K‐terminal network reliabilityNetworks, Vol. 15, No. 2 | 11 October 2006
- Network reliability analysis using 2‐connected digraph reductionsNetworks, Vol. 15, No. 2 | 11 October 2006
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 6, No. 1 | 1 Mar 1985
- The most reliable series‐parallel networksNetworks, Vol. 15, No. 1 | 11 October 2006
- The complexity of counting homeomorphsTheoretical Computer Science, Vol. 36 | 1 Jan 1985
- On some natural complete operatorsTheoretical Computer Science, Vol. 37 | 1 Jan 1985
- Network reliability and acyclic orientationsNetworks, Vol. 14, No. 4 | 11 October 2006
- Randomized algorithms: An annotated bibliographyAnnals of Operations Research, Vol. 1, No. 3 | 1 Oct 1984
- The computational complexity of maximization and integrationAdvances in Mathematics, Vol. 53, No. 1 | 1 Jul 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 4, No. 4 | 1 Dec 1983
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, Vol. 12, No. 4 | 13 July 2006
- The complexity of evaluating relational queriesInformation and Control, Vol. 58, No. 1-3 | 1 Jul 1983
- An overview of computational complexityCommunications of the ACM, Vol. 26, No. 6 | 1 June 1983
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, Vol. 13, No. 2 | 11 October 2006
- Using the Decomposition-Tree of a Network in Reliability ComputationIEEE Transactions on Reliability, Vol. R-32, No. 1 | 1 Apr 1983
- Network reliability and the factoring theoremNetworks, Vol. 13, No. 1 | 11 October 2006
- Steiner trees in probabilistic networksMicroelectronics Reliability, Vol. 23, No. 5 | 1 Jan 1983
- Randomised algorithmsDiscrete Applied Mathematics, Vol. 5, No. 1 | 1 Jan 1983
- Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genusInformation and Control, Vol. 56, No. 1-2 | 1 Jan 1983
- Isomorphism of graphs which are pairwise k-separableInformation and Control, Vol. 56, No. 1-2 | 1 Jan 1983
- Polynomial algorithms for estimating network reliabilityNetworks, Vol. 12, No. 4 | 11 October 2006
- Selected Applications of Minimum Cuts in NetworksINFOR: Information Systems and Operational Research, Vol. 20, No. 4 | 25 May 2016
- Enumerating the cycles of a digraph: A new preprocessing strategyInformation Sciences, Vol. 27, No. 3 | 1 Aug 1982
- Bounds on the Reliability Polynomial for Shellable Independence SystemsSIAM Journal on Algebraic Discrete Methods, Vol. 3, No. 2 | 17 July 2006
- Some Colouring Problems and their ComplexityGraph Theory, Proceedings of the Conference on Graph Theory | 1 Jan 1982
- Some NP-Complete Problems Similar to Graph IsomorphismSIAM Journal on Computing, Vol. 10, No. 1 | 13 July 2006
- Series-parallel reduction for difficult measures of network reliabilityNetworks, Vol. 11, No. 4 | 1 Jan 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, Vol. 12, No. 2 | 1 Oct 1980
- Sulla complessità di alcuni problemi di conteggioCalcolo, Vol. 17, No. 2 | 1 Jun 1980
- Complexity of network reliability computationsNetworks, Vol. 10, No. 2 | 11 October 2006
- An approximation algorithm for computing the permanentCombinatorial Mathematics VII | 4 October 2006
- Combinatorial problems over power setsCalcolo, Vol. 16, No. 4 | 1 Dec 1979
- The complexity of computing the permanentTheoretical Computer Science, Vol. 8, No. 2 | 1 Jan 1979
- The complexity of constraint satisfaction: an algebraic approachStructural Theory of Automata, Semigroups, and Universal Algebra
- Foundations of Complexity TheoryComplexity Theory and Cryptology
- Randomized Algorithms and Complexity ClassesComplexity Theory and Cryptology
- Other Public-Key Cryptosystems and ProtocolsComplexity Theory and Cryptology
- Kernels for Predictive Graph MiningFrom Data and Information Analysis to Knowledge Engineering
- Complexity of Counting the Optimal SolutionsComputing and Combinatorics
- On Listing, Sampling, and Counting the Chordal Graphs with Edge ConstraintsComputing and Combinatorics
- Maximum Edge-Disjoint Paths Problem in Planar GraphsTheory and Applications of Models of Computation
- Phase Transition of Multivariate Polynomial SystemsTheory and Applications of Models of Computation
- Kernelizations for Parameterized Counting ProblemsTheory and Applications of Models of Computation
- Generating Multiple Solutions for Mixed Integer Programming ProblemsInteger Programming and Combinatorial Optimization
- Algorithms for Counting 2-Sat Solutions and Colorings with ApplicationsAlgorithmic Aspects in Information and Management
- Generating Minimal k-Vertex Connected Spanning SubgraphsComputing and Combinatorics
- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting ProblemComputing and Combinatorics
- The Most Reliable Subgraph ProblemKnowledge Discovery in Databases: PKDD 2007
- Efficient Evaluation of HAVING Queries on a Probabilistic DatabaseDatabase Programming Languages
- On the Complexity of Computing Generators of Closed SetsFormal Concept Analysis
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT InstancesParameterized and Exact Computation
- Flows with Unit Path Capacities and Related Packing and Covering ProblemsCombinatorial Optimization and Applications
- Symbolic Reliability Analysis of Self-healing Networked Embedded SystemsComputer Safety, Reliability, and Security
- Counting Complexity of Minimal Cardinality and Minimal Weight AbductionLogics in Artificial Intelligence
- Enumerative methods in nonconvex programmingConstrained Global Optimization: Algorithms and Applications
- On counting and approximationCAAP '88
- The complexity of verifying the characteristic polynomial and testing similarityProceedings 15th Annual IEEE Conference on Computational Complexity
- Holographic Algorithms (Extended Abstract)45th Annual IEEE Symposium on Foundations of Computer Science
- The complexity of finding mediansProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- Using and abusing bounds for network reliability[Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition
- Shortest path routing in partially connected ad hoc networksGLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)
- SelectivityProceedings of ICCI'93: 5th International Conference on Computing and Information
- Optimal coteries for rings and related networks[1992] Proceedings of the 12th International Conference on Distributed Computing Systems
- The reliability problem in distributed database systemsProceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat. No.97TH8237)
- A share assignment method to maximize the probability of secret sharing reconstruction under the InternetProceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)
- A novel algorithm on network reliability analysis10th International Conference on Telecommunications, 2003. ICT 2003.
- Zero-one permanent is not=P-complete, a simpler proof[1993] The 2nd Israel Symposium on Theory and Computing Systems
- On the complexity of statistical reasoningProceedings Third Israel Symposium on the Theory of Computing and Systems
- A quadratic-time heuristic method for reliable network design with arbitrary traffic loadsProceedings International Phoenix Conference on Computers and Communications
- A theory of robust planningProceedings 1992 IEEE International Conference on Robotics and Automation
- The evaluation of strategies in motion planning with uncertaintyProceedings of the 1994 IEEE International Conference on Robotics and Automation
- Runtime-Coordinated Scalable Incremental Checksum Testing of Combinational Circuits11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)
- A very hard log space counting classProceedings Fifth Annual Structure in Complexity Theory Conference
- A complexity theory for feasible closure properties[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
- On closure properties of Hash P in the context of PF (omicron) Hash P[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
- Random debaters and the hardness of approximating stochastic functionsProceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
- Sparse Oracles And Uniform Complexity Classes25th Annual Symposium onFoundations of Computer Science, 1984.
- Path coupling: A technique for proving rapid mixing in Markov chainsProceedings 38th Annual Symposium on Foundations of Computer Science
- Unsatisfiable systems of equations, over a finite fieldProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- Algorithms and complexity results for #SAT and Bayesian inference44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Towards a dichotomy theorem for the counting constraint satisfaction problem44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- Protection Survivability ArchitecturesResilient Optical Network Design
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].