scientific article; zbMATH DE number 3564899

MaRDI QIDQ4137124zbMATH OpenFDO

Authors

Publication date 1976

zbMATH Keywords

AlgorithmsComplexityPittsburghProceedingsSymposium

Mathematics Subject Classification ID

Conference proceedings and collections of articles (00Bxx) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(28)

• Molecular dynamics on vector computers
• Learning optimization in simplifying fuzzy rules
• On the measurement of complexity in activity networks
• Maintenance of configurations in the plane
• The Kantorovich metric for probability measures on the circle
• An improved exact sampling algorithm for the standard normal distribution
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• Quantum and classical tradeoffs
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Deniable Functional Encryption
• Parallel tempering for the planted clique problem
• A binary algorithm with low divergence for modular inversion on SIMD architectures
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• Dynamic closest pairs — A probabilistic approach
• A time-randomness tradeoff for selection in parallel
• Investigation of finite-sample properties of robust location and scale estimators
• scientific article; zbMATH DE number 7561744 (Why is no real title available?)
• Hundreds of impossibility results for distributed computing
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• Exact sublinear binomial sampling
• On some _q-identities of Gosper
• Parameter synthesis for Markov models: covering the parameter space
• The 1982 ACM Turing Award lecture. An overview of computational complexity
• Parameter synthesis for probabilistic hyperproperties
• Detection of dense subhypergraphs by low-degree polynomials
• Channel simulation: theory and applications to lossy compression and differential privacy
• What is the minimum number of random bits required for computabilityokula and efficiency in anonymous networks?
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4137124)