scientific article; zbMATH DE number 1047152
zbMATH Open0916.68001MaRDI QIDQ4349101FDOQ4349101
Authors:
Publication date: 11 August 1997
Title of this publication is not available (Why is that?)
Recommendations
Algorithmsscheduling algorithmscryptographyVLSI layout algorithmsalgorithmic designComputation handbook
Data encryption (aspects in computer science) (68P25) Searching and sorting (68P10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Cited In (23)
- Obtaining splits from cut sets of tight spans
- Encyclopedia of algorithms. In 3 volumes
- Variability-based model transformation: formal foundation and application
- A scatter search for the periodic capacitated arc routing problem
- Computational power of infinite quantum parallelism
- Algorithms and theory of computation handbook. General concepts and techniques.
- Quantum computation with coherent spin states and the close Hadamard problem
- Algorithms and theory of computation handbook. Special topics and techniques.
- Tighter constant-factor time hierarchies
- The constrained longest common subsequence problem
- An algebraic representation of graphs and applications to graph enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- Title not available (Why is that?)
- Distributed Disaster Disclosure
- Title not available (Why is that?)
- Combinatorics of 1-particle irreducible n-point functions via coalgebra in quantum field theory
- Space efficient algorithms for the Burrows-Wheeler backtransformation
- Geometric stable roommates
- A program for sequential allocation of three Bernoulli populations
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
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 Q4349101)