The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Computing and Information (ICCI) (icci)
1991 (conf/icci/1991)

  1. Eric C. R. Hehner
    What's Wrong With Formal Programming Methods? [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:2-23 [Conf]
  2. Robert L. Probert
    Computer Science and Communications Protocols: Research Relationships. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:24-32 [Conf]
  3. Stephen J. Smith
    Reaping the Benefits of Mass Production with Massively Parallel Computing - Four Example Applications. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:33-42 [Conf]
  4. Yung-Chen Hung, Gen-Huey Chen
    On the Quickest Path Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:44-46 [Conf]
  5. Vladimir Estivill-Castro, Derick Wood
    Practical Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:47-54 [Conf]
  6. Nader H. Bshouty
    Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:55-65 [Conf]
  7. James Haralambides, Fillia Makedon
    Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:66-77 [Conf]
  8. Aris M. Ouksel, Anan Yaagoub
    The Interpolation-Based Bintree and its Application to Graphics. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:78-89 [Conf]
  9. Martin C. Carlisle, Errol L. Lloyd
    On the k-Coloring of Intervals. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:90-101 [Conf]
  10. Ali A. Kooshesh, Bernard M. E. Moret
    Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:102-110 [Conf]
  11. Tony W. Lai, Derick Wood
    A Relationship Between Self-Organizing Lists and Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:111-116 [Conf]
  12. Helen Cameron, Derick Wood
    How Costly Can Red-Black Trees Be? [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:117-126 [Conf]
  13. Helen Cameron, Derick Wood
    Balance in AVL Trees. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:127-133 [Conf]
  14. Michel Cosnard, Afonso Ferreira
    A Tight Lower Bound for Selection in Sorted X+Y. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:134-138 [Conf]
  15. Christos Levcopoulos, Andrzej Lingas
    Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:139-148 [Conf]
  16. Rajeev Raman
    Generating Random Graphs Efficiently. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:149-160 [Conf]
  17. Ivan Rival, Siming Zhan
    Linear Extensions with Backtracking. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:161-168 [Conf]
  18. Jindong Chen, Yijie Han
    Storing Shortest Paths for a Polyhedron. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:169-180 [Conf]
  19. Kok-Phuang Tan, T. C. Tan
    An Improved Join Dependency for Efficient Constraint Checking. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:182-184 [Conf]
  20. Jiawei Han
    On the Power of Query-Independent Compilation. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:185-196 [Conf]
  21. Anestis A. Toptsis
    Parallel Transitive Closure Computation in Highly Scalable Multiprocessors. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:197-206 [Conf]
  22. Bogdan D. Czejdo, Malcolm C. Taylor
    Methods and Tools for Integrating Database Systems and Object-Oriented Programming Systems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:207-218 [Conf]
  23. Ke Wang, Li-Yan Yuan
    Incremental Database Design Revisited. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:219-230 [Conf]
  24. Dik Lun Lee, Wai Yee Peter Wong
    Partial Document Ranking by Heuristic Methods. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:231-239 [Conf]
  25. Li Yu, Sylvia L. Osborn
    Context Inheritance and Content Inheritance in an Object-Oriented Data Model. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:240-251 [Conf]
  26. Bogdan D. Czejdo, Ralph P. Tucci, David W. Embley
    Graphical Specification of Recursive Queries. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:252-263 [Conf]
  27. Michio Nakanishi, Yoshiki Katsuyama, Minoru Ito, Akihiro Hashimoto
    On Designing Relational Database Schemes for Efficient Query Processing. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:264-275 [Conf]
  28. Mohamed Eltoweissy, Nagwa M. El-Makky, M. Abougabal, Souheir A. Fouad
    The Mean Value Approach to Performance Evaluation of Time-Stamp Ordering Algorithms. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:276-287 [Conf]
  29. Budi Yuwono, Dik Lun Lee
    A Backend Text Retrieval Machine for Signature-Based Document Ranking. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:288-297 [Conf]
  30. Piyush Maheshwari
    Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:300-311 [Conf]
  31. Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney
    Subtree Availability in Binary Tree Architectures. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:312-322 [Conf]
  32. Ip-Wang Chan, Donald K. Friesen
    An Optimal Parallel Algorithm for the Vertical Segment Visibility Reporting Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:323-334 [Conf]
  33. Siu-Cheung Chau, Arthur L. Liestman
    A Fault-Tolerant Binary Tree Architecture. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:335-346 [Conf]
  34. Lih-Hsing Hsu, Jones J. J. Wang
    Undordered Tree Contraction. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:347-349 [Conf]
  35. Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen
    Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:350-359 [Conf]
  36. Ke Qiu, Henk Meijer, Selim G. Akl
    Parallel Routing and Sorting of the Pancake Network. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:360-371 [Conf]
  37. Eric S. Kirsch, Jean R. S. Blair
    Practical Parallel Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:372-382 [Conf]
  38. Lin Chen
    Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:383-394 [Conf]
  39. Alfred J. Boals, Ajay K. Gupta, Jahangir A. Hashmi, Naveed A. Sherwani
    Compact Hypercubes: Properties and Recognition. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:395-402 [Conf]
  40. Zhiyong Liu, Jia-Huai You
    Increasing Communication Bandwidth on Hypercube. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:403-414 [Conf]
  41. Daniel Herman, Laurent Trilling
    Programming a Parallel Sort Using Distributed Procedure Calls. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:415-417 [Conf]
  42. Danny Krizanc
    A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:418-420 [Conf]
  43. Jean Frédéric Myoupo
    A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:421-430 [Conf]
  44. Marc Baumslag
    On the Fault-Tolerance of Quasi-Minimal Cayley Networks. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:431-442 [Conf]
  45. Sajal K. Das, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad
    Some Fast Parallel Algorithms for Parentheses Matching. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:443-454 [Conf]
  46. Rong Lin, Stephan Olariu
    A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:455-461 [Conf]
  47. S. Biswas, Amitabha Sanyal, L. M. Tewari
    Extended Cycle Shrinking: A Restructuring Method for Parallel Compilation. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:462-470 [Conf]
  48. J. Ben Rosen, Guoliang Xue
    Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:471-473 [Conf]
  49. Alfred J. Boals, Ajay K. Gupta, Jahangir A. Hashmi, Naveed A. Sherwani
    An Efficient Approximation Algorithm for Hypercube Scheduling. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:474-483 [Conf]
  50. Stephan Olariu, C. Michael Overstreet, Zhaofang Wen
    An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:484-495 [Conf]
  51. Hee Yong Youn
    An Efficient Multiprocessor Architecture for Image Processing in VLSI. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:496-507 [Conf]
  52. Pradip K. Srimani
    Generalized Fault Tolerance Properties of Star Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:510-519 [Conf]
  53. B. Gopinath, Ambuj K. Singh, Prem Uppaluru
    A Formal Description of the IC* Model of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:520-531 [Conf]
  54. Satyendra P. Rana
    An Efficient Algorithm for Quiescence Detection in a Distributed System. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:532-534 [Conf]
  55. C. Murray Woodside, Shikharesh Majumdar, John E. Neilson
    Interval Arithmetic for Computing Performance Guarantees in Client-Server Software. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:535-546 [Conf]
  56. Ghasem S. Alijani, Horst Wedde
    Enhanced Reliability in Scheduling Critical Tasks for Hard Real-Time Distributed Systems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:547-558 [Conf]
  57. Reda A. Ammar, Ping Zhang
    A Design and Modeling Environment to Develop Real-Time, Distributed Software Systems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:559-570 [Conf]
  58. Wanlei Zhou, Brian Molinari
    On the Management of Remote Procedure Call Transactions. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:571-581 [Conf]
  59. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
    Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:582-587 [Conf]
  60. Osman ZeinElDine, Mohamed Eltoweissy, Ravi Mukkamala
    A Distributed Scheduling Algorithm for Heterogeneous Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:588-598 [Conf]
  61. Michel Raynal
    A Distributed Solution to the k-out of-M Resources Allocation Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:599-609 [Conf]
  62. Horst Wedde, Douglas C. Daniels, Dorota M. Huizinga
    Efficient Distributed Resource Scheduling for Adaptive Real-Time Operation Support. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:610-627 [Conf]
  63. Uma Bhattacharya, Swapan Bhattacharya
    Mapping of Fault-Tolerant Permutations in Omega. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:628-639 [Conf]
  64. Abhay B. Bulsari, Henrik Saxén
    Artificial Neural Networks for Predicting Silicon Content in Raw Iron From Blast Furnaces. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:642-644 [Conf]
  65. Abhay B. Bulsari, Bjørn Saxén, Henrik Saxén
    A Chemical Reactor Selection Expert System Created by Training an Artificial Neural Network. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:645-656 [Conf]
  66. Rattikorn Hewett
    A Modeling Technique for Generating Causal Explanations of Physical Systems. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:657-668 [Conf]
  67. Leixuan Yang, Stan Szpakowicz
    Planning in Conceptual Networks. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:669-671 [Conf]
  68. Patricia Cerrito, Waldemar Karwowski, Krzysztof Ostaszewski
    Empirical Study of the Meaning of the Hedge "VERY". [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:672-674 [Conf]
  69. M. A. Nait Abdallah
    Kernel Knowledge Versus Belt Knowledge in Default Reasoning: a Logical Approach. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:675-686 [Conf]
  70. Eugeniusz Eberbach
    Neural Network Processing Elements as a New Generation of "Flip-Flops". [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:687-698 [Conf]
  71. Li-Yan Yuan, Jia-Huai You, Cheng Hui Wang
    A Proof-Theoretic Framework for Nonmonotonic Reasoning and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:699-708 [Conf]
  72. Li-Yan Yuan
    On Semantics, Syntactics and Fixpoints of General Programs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:709-720 [Conf]
  73. Anup Basu, Xiaobo Li
    A Framework for Variable -Resolution Vision. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:721-732 [Conf]
  74. V. Sundararajan, Hitesh N. Dholakia, N. Parameswaran
    An RMS for Temporal Reasoning with Abstraction. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:733-744 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002