The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

International Symposium on Algorithms (sigal)
1990 (conf/sigal/1990)

  1. Zvi Galil
    Recent Progress in String Algorithms. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:1- [Conf]
  2. Nicholas Pippenger
    Selection Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:2-11 [Conf]
  3. Hiroshi Nagamochi, Toshihide Ibaraki
    Computing Edge-Connectivity in Multiple and Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:12-20 [Conf]
  4. Hiroshi Imai, Kazuo Iwano
    Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:21-30 [Conf]
  5. Osamu Watanabe, Seinosuke Toda
    Structural Analyses on the Complexity of Inverting Functions. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:31-38 [Conf]
  6. Eric Allender
    Oracles versus Proof Techniques that Do Not Relativize. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:39-52 [Conf]
  7. Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
    20-Relative Neighborhood Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:53-65 [Conf]
  8. Tung-Hsin Su, Ruei-Chuan Chang
    The K-Gabriel Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:66-75 [Conf]
  9. Borivoje Djokic, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenovic
    Parallel Algorithms for Generating Subsets and Set Partitions. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:76-85 [Conf]
  10. Yijie Han
    Parallel Algorithms for Linked List and Beyond. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:86-100 [Conf]
  11. Pavol Hell, Jørgen Bang-Jensen, Jing Huang
    Local Tournaments and Proper Circular Arc Gaphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:101-108 [Conf]
  12. Kuo-Hui Tsai, Wen-Lian Hsu
    Fast Algorithms for the Dominating Set Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:109-117 [Conf]
  13. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:118-127 [Conf]
  14. Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
    Randomized Broadcast in Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:128-137 [Conf]
  15. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    On the Construction of Abstract Voronoi Diagrams, II. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:138-154 [Conf]
  16. Bernard Chazelle
    Searching in Higher Dimension. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:155- [Conf]
  17. David G. Kirkpatrick, Feng Gao
    Finding Extrema with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:156-164 [Conf]
  18. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Implicitly Searching Convolutions and Computing Depth of Collision. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:165-180 [Conf]
  19. Toshiya Itoh
    Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:181-190 [Conf]
  20. Michel Cosnard, Jean-Laurent Philippe
    Distributed Algorithms for Deciphering. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:191-200 [Conf]
  21. Kazuo Iwano, Susan Yeh
    An Efficient Algorithm for Optimal Loop Parallelization. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:201-210 [Conf]
  22. Wim Pijls, Arie de Bruin
    Another View on the SSS* Algorithm. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:211-220 [Conf]
  23. Lane A. Hemachandra
    Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:221-231 [Conf]
  24. Uwe Schöning
    Complexity Cores and Hard Problem Instances. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:232-240 [Conf]
  25. Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki
    Spatial Point Location and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:241-250 [Conf]
  26. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:251-260 [Conf]
  27. Leonidas J. Guibas, David Salesin, Jorge Stolfi
    Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:261-270 [Conf]
  28. Kazuo Murota
    Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:271-280 [Conf]
  29. Maria M. Klawe, Frank Thomson Leighton
    A Tight Lower Bound on the Size of Planar Permutation Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:281-287 [Conf]
  30. Refael Hassin
    Simultaneous Solution of Families of Problems. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:288-299 [Conf]
  31. Tetsuo Asano, Takeshi Tokuyama
    Algorithms for Projecting Points to Give the Most Uniform Distribution with Applications to Hashing. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:300-309 [Conf]
  32. Efthymios Anagnostou, Vassilios G. Polimenis, Leonidas J. Guibas
    Topological Sweeping in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:310-317 [Conf]
  33. Kwong-fai Chan, Tak Wah Lam
    Finding Least-Weight Subsequences with Fewer Processors. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:318-327 [Conf]
  34. Yijie Han, Yoshihide Igarashi
    Derandomization by Exploiting Redundancy and Mutual Independence. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:328-337 [Conf]
  35. Hillel Gazit, Gary L. Miller
    Planar Separators and the Euclidean Norm. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:338-347 [Conf]
  36. David Avis
    On the Complexity of Isometric Embedding in the Hypercube. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:348-357 [Conf]
  37. Nicola Santoro, Peter Widmayer
    Distributed Function Evaluation in the Presence of Transmission Faults. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:358-367 [Conf]
  38. Sara Bitan, Shmuel Zaks
    Optimal Linear Broadcast. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:368-377 [Conf]
  39. Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura
    Graph Augmentation Problems for a Specified Set of Vertices. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:378-387 [Conf]
  40. Qingzhou Wang, Kam-Hoi Cheng
    A Heuristic Algorithm for the k-Center Problem with Vertex Weight. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:388-396 [Conf]
  41. Hussein M. Alnuweiri, Viktor K. Prasanna
    Parallel Convexity Algorithms for Digitized Images on a Linear Array of Processors. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:397-406 [Conf]
  42. Wen-Jing Hsu, Xiaola Lin
    Parallel Algorithms for Labeling Image Components. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:407-418 [Conf]
  43. Herbert Edelsbrunner, Micha Sharir
    A Hyperplane Incidence Problem with Applications to Counting Distances. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:419-428 [Conf]
  44. Kazumiti Numata, Takeshi Tokuyama
    Splitting a Configuration in a Simplex. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:429-438 [Conf]
  45. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Segments in Space. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:439-446 [Conf]
  46. Andrzej Lingas
    Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:447-457 [Conf]
  47. Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
    Parallel Algorithms for Finding Steiner Forests in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:458-467 [Conf]
  48. Vassilis J. Tsotras, B. Gopinath, George W. Hart
    Optimally Managing the History of an Evolving Forest. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:468-478 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002