M. Dietzfelbinger
F. Meyer auf der Heide
- DKM88.Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E., Dynamic perfect hashing: Upper and lower bounds, Proc. of the 29th IEEE FOCS, 1988, pp. 524-531; also: Tech. Report No. 282, Fachbereich Informatik, Universit/it Dortmund, 1988.Google Scholar
- DM89.Dietzfelbinger, M., and Meyer auf der Heide, F., An optimal parallel dictionary, Proc. of ACM Syrup. on Parallel Algorithms and Architectures, 1989, pp. 360-368. Google ScholarDigital Library
- DM90.Dietzfelbinger, M., and Meyer auf der Heide, F., A new universal class of hash functions and dynamic hashing in real time, Proc. of ICALP 1990. Google ScholarDigital Library
- FKS84.Fredman, M. L., Komlos, J., and Szemeredi, E., Storing a sparse table with 0(1) worst case access time, J. ACM 31(3), 1984, 538-544. Google ScholarDigital Library
- Han89.Han, Y., Parallel Algorithms for computing linked list prefix, J. Parallel Distr. Comput. 6, 1989, 537-557. Google ScholarDigital Library
- Hof87.Hofri, M., Probabilistic Analysis of Algorithms, Springer Verlag, New York, 1987. Google ScholarDigital Library
- KU86.Karlin, A., and Upfal, E., Parallel hashing-- an efficient implementation of shared memory, Proc. of the 18th ACM STOC, 1986, pp. 160-168. Google ScholarDigital Library
- KRS88.Kruskal, C. P., Rudolph, L., and Snir, M., A complexity theory of efficient parallel algorithms, Proc. of 15th ICALP, 1988, pp. 333-346, Springer LNCS 317; also: revised preprint. Google ScholarDigital Library
- MV84.Mehlhorn, K., and Vishkin, U., Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memory, Acta Informatica 21, 1984, 339-374. Google ScholarDigital Library
- Ran87.Ranade, A. G., How to emulate shared memory, Proc. of the 28th IEEE FOCS, 1987, pp. 185- 194.Google ScholarDigital Library
- Sie89.Siegel, A., On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, Proc. of the 30th IEEE FOCS, 1989, pp. 20-25.Google ScholarDigital Library
- Upf84.Upfal, E., Efficient schemes for parallel communication, J. ACM 31(3), 1984, 507-517. Google ScholarDigital Library
Index Terms
- How to distribute a dictionary in a complete network
Recommendations
Single-channel blind source separation based on joint dictionary with common sub-dictionary
The cross projection engenders when mixed speech signal is represented over joint dictionary because of the bad distinguishing ability of joint dictionary in single-channel blind source separation (SBSS) using sparse representation theory, which leads ...
Distributed Analysis Dictionary Learning Using a Diffusion Strategy
AbstractWe consider the problem of distributed dictionary learning which aims to learn a global dictionary from data geographically distributed on nodes of a network. Existing works are based on sparse synthesis model while this paper is based on sparse ...
Comments