scientific article; zbMATH DE number 3564899
From MaRDI portal
Publication:4137124
zbMATH Open0363.00013MaRDI QIDQ4137124FDOQ4137124
Authors:
Publication date: 1976
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Algorithms in computer science (68W99) Conference proceedings and collections of articles (00Bxx)
Cited In (23)
- Dynamic closest pairs — A probabilistic approach
- Parameter synthesis for Markov models: covering the parameter space
- Quantum and classical tradeoffs
- On some \(\Pi_q\)-identities of Gosper
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- On the measurement of complexity in activity networks
- Hundreds of impossibility results for distributed computing
- Parallel tempering for the planted clique problem
- Title not available (Why is that?)
- An improved exact sampling algorithm for the standard normal distribution
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Maintenance of configurations in the plane
- Exact sublinear binomial sampling
- The Kantorovich metric for probability measures on the circle
- Deniable Functional Encryption
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- Investigation of finite-sample properties of robust location and scale estimators
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- A time-randomness tradeoff for selection in parallel
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Learning optimization in simplifying fuzzy rules
- Molecular dynamics on vector computers
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)
