Skip header Section
Skip Bibliometrics Section
Graph AlgorithmsJanuary 1979
- Author:
- Shimon Even
Abstract
No abstract available.
Cited By
- Shany Y and Berman A (2023). Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding, IEEE Transactions on Information Theory, 69:8, (4907-4926), Online publication date: 1-Aug-2023.
Kagaris D and Dutta S (2019). Scheduling Mutual Exclusion Accesses in Equal-Length Jobs, ACM Transactions on Parallel Computing (TOPC), 6:2, (1-26), Online publication date: 10-Sep-2019.- Salah S, Akbarinia R and Masseglia F (2017). Data placement in massively distributed environments for fast parallel mining of frequent itemsets, Knowledge and Information Systems, 53:1, (207-237), Online publication date: 1-Oct-2017.
- Athanasiou K, Liu P and Wahl T Unbounded-Thread Program Verification using Thread-State Equations Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706, (516-531)
- Salah S, Akbarinia R and Masseglia F Optimizing the Data-Process Relationship for Fast Mining of Frequent Itemsets in MapReduce Proceedings of the 11th International Conference on Machine Learning and Data Mining in Pattern Recognition - Volume 9166, (217-231)
- Lingas A and Persson M A fast parallel algorithm for minimum-cost small integral flows Proceedings of the 18th international conference on Parallel Processing, (688-699)
- Rosenthal E, Chaudhry S, Choi I and Jang J (2012). On a class of branching problems in broadcasting and distribution, Computers and Operations Research, 39:8, (1793-1799), Online publication date: 1-Aug-2012.
- Tsin Y Decomposing a multigraph into split components Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128, (3-12)
- Kuipers F (2018). An overview of algorithms for network survivability, ISRN Communications and Networking, 2012, (24-24), Online publication date: 1-Jan-2012.
- Monteiro P, Monteiro M and Pingali K Parallelizing irregular algorithms Proceedings of the 18th Conference on Pattern Languages of Programs, (1-18)
- Johnson M and Gutfraind A Evader interdiction and collateral damage Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, (86-100)
- Hou Y and Ji L (2011). Partially autonomous conceptual development of multifunctional structures, International Journal of Computer Applications in Technology, 40:1/2, (13-22), Online publication date: 1-Feb-2011.
- Emek Y, Korman A and Shavitt Y Approximating the statistics of various properties in randomly weighted graphs Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (1455-1467)
- Korman A, Kutten S and Peleg D (2010). Proof labeling schemes, Distributed Computing, 22:4, (215-233), Online publication date: 1-May-2010.
- Korman A (2010). Labeling schemes for vertex connectivity, ACM Transactions on Algorithms (TALG), 6:2, (1-10), Online publication date: 1-Mar-2010.
- Khuller S and Raghavachari B Advanced combinatorial algorithms Algorithms and theory of computation handbook, (8-8)
- Khuller S and Raghavachari B Basic graph algorithms Algorithms and theory of computation handbook, (7-7)
- Tamassia R and Cantrill B Basic data structures Algorithms and theory of computation handbook, (4-4)
- Goldreich O Introduction to testing graph properties Property testing, (105-141)
- Goldreich O Introduction to testing graph properties Property testing, (105-141)
- Tian J Parameter identification in a class of linear structural equation models Proceedings of the 21st International Joint Conference on Artificial Intelligence, (1970-1975)
- Chen Y General spanning trees and reachability query evaluation Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering, (243-252)
- Awerbuch B, Cidon I and Kutten S (2008). Optimal maintenance of a spanning tree, Journal of the ACM (JACM), 55:4, (1-45), Online publication date: 1-Sep-2008.
- Choi A and Darwiche A Many-pairs mutual information for adding structure to belief propagation approximations Proceedings of the 23rd national conference on Artificial intelligence - Volume 2, (1031-1036)
- Khilar P and Mahapatra S A fault diagnosis algorithm for wireless sensor networks Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems, (443-447)
- Garza S and Aguirre J Just-in-time monitoring of project activities through temporal reasoning Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence, (381-391)
- Korman A Labeling schemes for vertex connectivity Proceedings of the 34th international conference on Automata, Languages and Programming, (102-109)
- Klasing R, Kosowski A and Navarra A Cost minimisation in multi-interface networks Proceedings of the 1st EuroFGI international conference on Network control and optimization, (276-285)
- Khilar P and Mahapatra S Heartbeat based fault diagnosis for mobile ad-hoc network Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology, (194-199)
- Goldreich O and Ron D Approximating average parameters of graphs Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, (363-374)
- Ackerman E, Buchin K, Knauer C and Rote G Acyclic orientation of drawings Proceedings of the 10th Scandinavian conference on Algorithm Theory, (268-279)
- Kreowski H and Kuske S Autonomous units and their semantics Proceedings of the 18th international conference on Recent trends in algebraic development techniques, (56-73)
- Gandhi R, Khuller S, Parthasarathy S and Srinivasan A (2006). Dependent rounding and its applications to approximation algorithms, Journal of the ACM (JACM), 53:3, (324-360), Online publication date: 1-May-2006.
- Murat C and Paschos V (2006). On the probabilistic minimum coloring and minimum k-coloring, Discrete Applied Mathematics, 154:3, (564-586), Online publication date: 1-Mar-2006.
- Murat C and Paschos V (2006). On the probabilistic minimum coloring and minimum k-coloring, Discrete Applied Mathematics, 154:3, (564-586), Online publication date: 1-Mar-2006.
- Even G On teaching fast adder designs Theoretical Computer Science, (313-347)
- Dinitz Y Dinitz' algorithm Theoretical Computer Science, (218-240)
- Ikeda K, Sugiyama K, Watanabe I and Misue K Generation of relevance maps and navigation in a digital book Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60, (49-58)
- Yang B, Zheng S and Lu E Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function Proceedings of the 16th international conference on Algorithms and Computation, (954-963)
- Ruiz P and Gomez-Skarmeta A Heuristic algorithms for minimum bandwith consumption multicast routing in wireless mesh networks Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks, (258-270)
- Moore J and Zhang Q Proof pearl Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (373-384)
- Xu B and Wang L (2005). Decomposing toroidal graphs into circuits and edges, Discrete Applied Mathematics, 148:2, (147-159), Online publication date: 15-May-2005.
- Rosenkrantz D, Goel S, Ravi S and Gangolly J Structure-Based resilience metrics for service-oriented networks Proceedings of the 5th European conference on Dependable Computing, (345-362)
- Amir E and McIlraith S (2005). Partition-based logical reasoning for first-order and propositional theories, Artificial Intelligence, 162:1-2, (49-88), Online publication date: 1-Feb-2005.
- Pessoa A Planning the transportation of multiple commodities in bidirectional pipeline networks Proceedings of the 15th international conference on Algorithms and Computation, (766-777)
- Bar-Yehuda R, Bendel K, Freund A and Rawitz D (2004). Local ratio, ACM Computing Surveys (CSUR), 36:4, (422-463), Online publication date: 1-Dec-2004.
- Cortese P, Di Battista G, Patrignani M and Pizzonia M Clustering cycles into cycles of clusters Proceedings of the 12th international conference on Graph Drawing, (100-110)
- Bourdonov I (2019). Traversal of an Unknown Directed Graph by a Finite Robot, Programming and Computing Software, 30:4, (188-203), Online publication date: 1-Jul-2004.
- Subbiah A and Blough D (2004). Distributed Diagnosis in Dynamic Fault Environments, IEEE Transactions on Parallel and Distributed Systems, 15:5, (453-467), Online publication date: 1-May-2004.
- Liu Y, Sprague A and Lefkowitz E Network flow for outlier detection Proceedings of the 42nd annual Southeast regional conference, (402-103)
- Gat-Viks I, Tanay A and Shamir R Modeling and analysis of heterogeneous regulation in biological networks Proceedings of the 2004 RECOMB international conference on Regulatory Genomics, (98-113)
- Kuo Y, Wang J and Shih N Handling syntactic constraints in a DTD-compliant XML editor Proceedings of the 2003 ACM symposium on Document engineering, (222-224)
- Michiels W, Korst J and Aerts J (2003). On the Guaranteed Throughput of Multizone Disks, IEEE Transactions on Computers, 52:11, (1407-1420), Online publication date: 1-Nov-2003.
- Beimel A and Malka L Efficient reliable communication over partially authenticated networks Proceedings of the twenty-second annual symposium on Principles of distributed computing, (233-242)
- Pang W and Goodwin S A graph based backtracking algorithm for solving general CSPs Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence, (114-128)
- Amir E, Krauthgamer R and Rao S Constant factor approximation of vertex-cuts in planar graphs Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (90-99)
- Gibbons A Graph theory Encyclopedia of Computer Science, (755-759)
- Litkowski K Digraph analysis of dictionary preposition definitions Proceedings of the ACL-02 workshop on Word sense disambiguation: recent successes and future directions - Volume 8, (9-16)
- Liu L, Halper M, Geller J and Perl Y (2002). Using OODB Modeling to Partition a Vocabulary in Structurally and Semantically Uniform Concept Groups, IEEE Transactions on Knowledge and Data Engineering, 14:4, (850-866), Online publication date: 1-Jul-2002.
- Ginat D (2002). On varying perspectives of problem decomposition, ACM SIGCSE Bulletin, 34:1, (331-335), Online publication date: 1-Mar-2002.
- Ginat D On varying perspectives of problem decomposition Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (331-335)
- Lee S Fast detection and resolution of generalized distributed deadlocks Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing, (429-436)
- Katz M, Katz N, Korman A and Peleg D Labeling schemes for flow and connectivity Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (927-936)
- Goldreich O Property testing in massive graphs Handbook of massive data sets, (123-147)
- Amir E Efficient approximation for triangulation of minimum treewidth Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence, (7-15)
- Wolf W An architectural co-synthesis algorithm for distributed, embedded computing systems Readings in hardware/software co-design, (338-349)
- Miguel I and Shen Q (2001). Solution Techniques for Constraint Satisfaction Problems, Artificial Intelligence Review, 15:4, (269-293), Online publication date: 1-Jun-2001.
- Yanovski V, Wagner I and Bruckstein A (2019). Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs, Annals of Mathematics and Artificial Intelligence, 31:1-4, (99-112), Online publication date: 2-May-2001.
- Emmert J and Bhatia D (2019). A Fault Tolerant Technique for FPGAs, Journal of Electronic Testing: Theory and Applications, 16:6, (591-606), Online publication date: 1-Dec-2000.
- Lim H and Kim C Multicast tree construction and flooding in wireless ad hoc networks Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, (61-68)
- Bertolazzi P, Di Battista G and Didimo W (2000). Computing Orthogonal Drawings with the Minimum Number of Bends, IEEE Transactions on Computers, 49:8, (826-840), Online publication date: 1-Aug-2000.
- Chen X, Feng W, Zhao J, Meyer F and Lombardi F (1999). Reconfiguring One-Time Programmable FPGAs, IEEE Micro, 19:6, (53-63), Online publication date: 1-Nov-1999.
- Gupta S and Najm F Energy-per-cycle estimation at RTL Proceedings of the 1999 international symposium on Low power electronics and design, (121-126)
- Dinitz Y, Moran S and Rajsbaum S Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (265-274)
- Hartuv E, Schmitt A, Lange J, Meier-Ewert S, Lehrach H and Shamir R An algorithm for clustering cDNAs for gene expression analysis Proceedings of the third annual international conference on Computational molecular biology, (188-197)
- GyźRi E and Jordán T (1999). How to make a graph four-connected, Mathematical Programming: Series A and B, 84:3, (555-563), Online publication date: 1-Apr-1999.
- Boyer J and Myrvold W Stop minding your p's and q's Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (140-146)
- Biedl T Drawing planar partitions I Proceedings of the fourteenth annual symposium on Computational geometry, (287-296)
- Tamassia R (2019). Constraints in Graph Drawing Algorithms, Constraints, 3:1, (87-120), Online publication date: 1-Apr-1998.
- Karger D Better random sampling algorithms for flows in undirected graphs Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (490-499)
- Kuo T and Mok A (1997). Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems, IEEE Transactions on Computers, 46:12, (1313-1324), Online publication date: 1-Dec-1997.
- Lin Y and Druzdzel M Computational advantages of relevance reasoning in Bayesian belief networks Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence, (342-350)
- Yang S (2018). Performance evaluation of routing algorithms under various network configuration parameters, International Journal of Network Management, 7:4, (183-197), Online publication date: 14-Jul-1997.
- Agrawal S and Gupta R Data-flow assisted behavioral partitioning for embedded systems Proceedings of the 34th annual Design Automation Conference, (709-712)
- Ku H and Hayes J (1997). Connective Fault Tolerance in Multiple-Bus Systems, IEEE Transactions on Parallel and Distributed Systems, 8:6, (574-586), Online publication date: 1-Jun-1997.
- Malvestuto F and Moscarini M (1997). Suppressing marginal totals from a two-dimensional table to protect sensitive information, Statistics and Computing, 7:2, (101-114), Online publication date: 1-Jun-1997.
- Goldreich O and Ron D Property testing in bounded degree graphs Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (406-415)
- Karger D Using random sampling to find maximum flows in uncapacitated undirected graphs Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (240-249)
- Bahar R, Frohm E, Gaona C, Hachtel G, Macii E, Pardo A and Somenzi F (1997). Algebric Decision Diagrams and Their Applications, Formal Methods in System Design, 10:2-3, (171-206), Online publication date: 1-Apr-1997.
- Hachtel G and Somenzi F (1997). A Symbolic Algorithms for Maximum Flow in 0-1 Networks, Formal Methods in System Design, 10:2-3, (207-219), Online publication date: 1-Apr-1997.
- Puri R, Bjorksten A and Rosser T Logic optimization by output phase assignment in dynamic logic synthesis Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (2-7)
- Cheriyan J and Thurimella R Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract) Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (37-46)
- Malvestuto F and Moscarini M Censoring Statistical Tables to Protect Sensitive Information Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, (12-21)
- Desai M, Cvijetic R and Jensen J Sizing of clock distribution networks for high performance CPU chips Proceedings of the 33rd annual Design Automation Conference, (389-394)
- Desai M A systematic technique for verifying critical path delays in a 300MHz Alpha CPU design using circuit simulation Proceedings of the 33rd annual Design Automation Conference, (125-130)
- Azar Y, Naor J and Rom R (1996). Routing Strategies for Fast Networks, IEEE Transactions on Computers, 45:2, (165-173), Online publication date: 1-Feb-1996.
- Gabow H Perfect arborescence packing in preflow mincut graphs Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (528-538)
- Vadapalli P and Srimani P (1996). A New Family of Cayley Graph Interconnection Networks of Constant Degree Four, IEEE Transactions on Parallel and Distributed Systems, 7:1, (26-32), Online publication date: 1-Jan-1996.
- Bagali S and Waggenspack W A shortest path approach to wireframe to solid model conversion Proceedings of the third ACM symposium on Solid modeling and applications, (339-350)
- Klein S Efficient recompression techniques for dynamic full-text retrieval systems Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, (39-47)
- Ohm S Optimal Recovery Point Insertion for High-Level Synthesis of Recoverable Microarchitectures Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
- Najm F Towards a high-level power estimation capability Proceedings of the 1995 international symposium on Low power design, (87-92)
- Yang H and Wong D Circuit clustering for delay minimization under area and pin constraints Proceedings of the 1995 European conference on Design and Test
- Abuali F, Wainwright R and Schoenefeld D Determinant factorization and cycle basis Proceedings of the 1995 ACM symposium on Applied computing, (305-312)
- Li W An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization Proceedings of the 1995 ACM symposium on Applied computing, (56-60)
- Deokar R and Sapatnekar S A fresh look at retiming via clock skew optimization Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (310-315)
- Yang H and Wong D Efficient network flow based min-cut balanced partitioning Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, (50-55)
- Gerstel O and Zaks S The virtual path layout problem in fast networks (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, (235-243)
- Frost D and Dechter R In search of the best constraint satisfaction search Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (301-306)
- Puri R and Gu J A divide-and-conquer approach for asynchronous interface synthesis Proceedings of the 7th international symposium on High-level synthesis, (118-125)
- Chen M and Yu P (2019). A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing, IEEE Transactions on Knowledge and Data Engineering, 6:1, (152-165), Online publication date: 1-Feb-1994.
- Malvestuto F (1993). A universal-scheme approach to statistical databases containing homogeneous summary tables, ACM Transactions on Database Systems (TODS), 18:4, (678-708), Online publication date: 1-Dec-1993.
- Hachtel G and Somenzi F A symbolic algorithm for maximum flow in 0-1 networks Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, (403-406)
- Raz Y Extended commitment ordering, or guaranteeing global serializability by applying commitment order selectively to global transactions Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (83-96)
- Vaishnav H and Pedram M Routability-driven fanout optimization Proceedings of the 30th international Design Automation Conference, (230-235)
- Gabow H A representation for crossing set families with applications to submodular flow problems Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (202-211)
- Ripphausen-Lipa H, Wagner D and Weihe K The vertex-disjoint menger problem in planar graphs Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (112-119)
- Pomeranz I and Reddy S An efficient non-enumerative method to estimate path delay fault coverage Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (560-567)
- Michaels K and Strojwas A A methodology for improved circuit simulation efficiency via topology-based variable accuracy device modeling Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (254-257)
- Cheriyan J and Reif J Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (335-344)
- Khuller S and Vishkin U Biconnectivity approximations and graph carvings Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (759-770)
- Rao S Faster algorithms for finding small edge cuts in planar graphs Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (229-240)
- Gopal A, Gopal I and Kutten S (1991). Hardware flooding (preliminary version), ACM SIGCOMM Computer Communication Review, 21:4, (259-270), Online publication date: 1-Aug-1991.
- Gopal A, Gopal I and Kutten S Hardware flooding (preliminary version) Proceedings of the conference on Communications architecture & protocols, (259-270)
- Awerbuch B, Cidon I, Kutten S, Mansour Y and Peleg D Broadcast with partial knowledge (preliminary version) Proceedings of the tenth annual ACM symposium on Principles of distributed computing, (153-163)
- Krothapalli V and Sadayappan P (1991). Removal of redundant dependences in DOACROSS loops with constant dependences, ACM SIGPLAN Notices, 26:7, (51-60), Online publication date: 1-Jul-1991.
- Benkoski J and Strojwas A The role of timing verification in layout synthesis Proceedings of the 28th ACM/IEEE Design Automation Conference, (612-619)
- Even S and Litman A On the capabilities of systolic systems (extended abstract) Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, (357-367)
- Bertolazzi P and Di Battista G On upward drawing testing of triconnected digraphs (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (272-280)
- Malvestuto F, Moscarini M and Rafanelli M Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table (extended abstract) Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (252-258)
- Krothapalli V and Sadayappan P Removal of redundant dependences in DOACROSS loops with constant dependences Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, (51-60)
- Bergamaschi R, Camposano R and Payer M Area and performance optimizations in path-based scheduling Proceedings of the conference on European design automation, (304-310)
- Benkoski J and Stewart R TATOO Proceedings of the conference on European design automation, (256-260)
- Raghavan V and Tripathi A (1991). Improved Diagnosability Algorithms, IEEE Transactions on Computers, 40:2, (143-153), Online publication date: 1-Feb-1991.
- Cai H, Note S, Six P and De Man H A data path layout assembler for high performance DSP circuits Proceedings of the 27th ACM/IEEE Design Automation Conference, (306-311)
- Meyer S (1990). A new placement level wirability estimate with measurements, ACM SIGDA Newsletter, 20:2, (25-39), Online publication date: 1-Oct-1990.
- Awerbuch B, Baratz A and Peleg D Cost-sensitive analysis of communication protocols Proceedings of the ninth annual ACM symposium on Principles of distributed computing, (177-187)
- Markowitz V and Makowsky J (2019). Identifying Extended Entity-Relationship Object Structures in Relational Schemas, IEEE Transactions on Software Engineering, 16:8, (777-790), Online publication date: 1-Aug-1990.
- Chen M and Yu P Using join operations as reducers in distributed query processing Proceedings of the second international symposium on Databases in parallel and distributed systems, (116-123)
- Motro A (2018). FLEX, IEEE Transactions on Knowledge and Data Engineering, 2:2, (231-246), Online publication date: 1-Jun-1990.
- Gazit H and Reif J A randomized parallel algorithm for planar graph isomorphism Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (210-219)
- Shih W, Wu S and Kuo Y (1990). Unifying Maximum Cut and Minimum Cut of a Planar Graph, IEEE Transactions on Computers, 39:5, (694-697), Online publication date: 1-May-1990.
- Wu C and Cappello P (2019). Easily Testable Iterative Logic Arrays, IEEE Transactions on Computers, 39:5, (640-652), Online publication date: 1-May-1990.
- Ferrer C, Oliver J and Valderrama E A new switch-level test pattern generation algorithm based on single path over a graph representation Proceedings of the conference on European design automation, (402-406)
- Goldreich O, Krawczyk H and Luby M On the existence of pseudorandom generators Proceedings on Advances in cryptology, (146-162)
- Kanevsky A On the number of minimum size separating vertex sets in a graph and how to find all of them Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, (411-421)
- Som T, Cota B and Sargent R On analyzing events to estimate the possible speedup of parallel discrete event simulation Proceedings of the 21st conference on Winter simulation, (729-737)
- Sun X and Kamel N (2019). Processing Implication on Queries, IEEE Transactions on Software Engineering, 15:10, (1168-1175), Online publication date: 1-Oct-1989.
- Gaiotti S, Dagenais M and Rumin N Worst-case delay estimation of transistor groups Proceedings of the 26th ACM/IEEE Design Automation Conference, (491-495)
- Markowitz V and Shoshani A On the correctness of representing extended entity-relationship structures in the relational model Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (430-439)
- Sun X, Kamel N and Ni L Solving implication problems in database applications Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (185-192)
- Markowitz V and Shoshani A (2019). On the correctness of representing extended entity-relationship structures in the relational model, ACM SIGMOD Record, 18:2, (430-439), Online publication date: 1-Jun-1989.
- Sun X, Kamel N and Ni L (1989). Solving implication problems in database applications, ACM SIGMOD Record, 18:2, (185-192), Online publication date: 1-Jun-1989.
- Lakshmanan K, Thulasiraman K and Comeau M (2019). An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights, IEEE Transactions on Software Engineering, 15:5, (639-644), Online publication date: 1-May-1989.
- Atallah M, Kosaraju S, Larmore L, Miller G and Teng S Constructing trees in parallel Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, (421-431)
- Meyer S A data structure for circuit net lists Proceedings of the 25th ACM/IEEE Design Automation Conference, (613-616)
- Kuo Y, Chern T and Shih W Fast algorithm for optimal layer assignment Proceedings of the 25th ACM/IEEE Design Automation Conference, (554-559)
- Adler D A dynamically-directed switch model for MOS logic simulation Proceedings of the 25th ACM/IEEE Design Automation Conference, (506-511)
- Monma C, Paterson M, Suri S and Yao F Computing Euclidean maximum spanning trees Proceedings of the fourth annual symposium on Computational geometry, (241-251)
- Kirkpatrick D Establishing order in planar subdivisions Proceedings of the third annual symposium on Computational geometry, (316-321)
- Chlamtac I and Kutten S (1987). Tree-Based Broadcasting in Multihop Radio Networks, IEEE Transactions on Computers, 36:10, (1209-1223), Online publication date: 1-Oct-1987.
- Bhatia S and Starling A (1987). Multilayered illiac network scheme, ACM SIGARCH Computer Architecture News, 15:4, (23-31), Online publication date: 1-Sep-1987.
- Gold Y and Moran S (1987). Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network, Distributed Computing, 2:3, (139-148), Online publication date: 1-Sep-1987.
- Teng S (1987). The construction of Huffman-equivalent prefix code in NC, ACM SIGACT News, 18:4, (54-61), Online publication date: 1-Jul-1987.
- Segall A and Wolfson O Transaction commitment at minimal communication cost Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (112-118)
- Ebert J (1987). A versatile data structure for edge-oriented graph algorithms, Communications of the ACM, 30:6, (513-519), Online publication date: 1-Jun-1987.
- Li L and Marsland T A parallel algorithm for finding a maximum flow in 0-1 networks Proceedings of the 15th annual conference on Computer Science, (231-234)
- Miller G and Ramachandran V A new graphy triconnectivity algorithm and its parallelization Proceedings of the nineteenth annual ACM symposium on Theory of computing, (335-344)
- Goldberg A and Tarjan R A new approach to the maximum flow problem Proceedings of the eighteenth annual ACM symposium on Theory of computing, (136-146)
- Mansour Y and Zaks S On the bit complexity of distributed computations in a ring with a leader Proceedings of the fifth annual ACM symposium on Principles of distributed computing, (151-160)
- Moran S and Warmuth M Gap theorems for distributed computing Proceedings of the fifth annual ACM symposium on Principles of distributed computing, (131-150)
- Berry O and Lomow G Speeding up distributed simulation using the time warp mechanism Proceedings of the 2nd workshop on Making distributed systems work, (1-14)
- Motro A Constructing queries from tokens Proceedings of the 1986 ACM SIGMOD international conference on Management of data, (120-131)
- Motro A (2019). Constructing queries from tokens, ACM SIGMOD Record, 15:2, (120-131), Online publication date: 15-Jun-1986.
- Dahbura A (1986). An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System, IEEE Transactions on Computers, 35:4, (354-356), Online publication date: 1-Apr-1986.
- Choueka Y, Klein S and Perl Y Efficient variants of Huffman codes in high level languages Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, (122-130)
- Bernstein D, Pinter R and Rodeh M Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version) Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (325-333)
- Dolev D, Halpern J, Simons B and Strong R A new look at fault tolerant network routing Proceedings of the sixteenth annual ACM symposium on Theory of computing, (526-535)
- Awerbuch B An efficient network synchronization protocol Proceedings of the sixteenth annual ACM symposium on Theory of computing, (522-525)
- Awerbuch B, Israeli A and Shiloach Y Finding euler circuits in logarithmic parallel time Proceedings of the sixteenth annual ACM symposium on Theory of computing, (249-257)
- Atkins R Improved instruction formation in the exhaustive local microcode compaction algorithm Proceedings of the 17th annual workshop on Microprogramming, (105-111)
- Atkins R (1984). Improved instruction formation in the exhaustive local microcode compaction algorithm, ACM SIGMICRO Newsletter, 15:4, (105-111), Online publication date: 1-Dec-1984.
- Albertson M and Berman D (2006). Combinatorial Aspects of the Orrery Model of Syntax, SIAM Journal on Algebraic and Discrete Methods, 5:3, (451-456), Online publication date: 1-Sep-1984.
- Scheuermann P and Wu G (1984). Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks, IEEE Transactions on Computers, 33:9, (804-811), Online publication date: 1-Sep-1984.
- Jerrum M and Skyum S (1984). Families of Fixed Degree Graphs for Processor Interconnection, IEEE Transactions on Computers, 33:2, (190-194), Online publication date: 1-Feb-1984.
- Sarikaya B and Bochmann G Synchronization issues in protocol testing Proceedings of the symposium on Communications Architectures & Protocols, (121-128)
- Gustafson K and Hartman R (1983). Divergence-Free Bases for Finite Element Schemes in Hydrodynamics, SIAM Journal on Numerical Analysis, 20:4, (697-721), Online publication date: 1-Aug-1983.
- Sarikaya B and Bochmann G (1983). Synchronization issues in protocol testing, ACM SIGCOMM Computer Communication Review, 13:2, (121-128), Online publication date: 1-Apr-1983.
- Dolev D, Meseguer J and Pease M Finding safe paths in a faulty environment Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (95-103)
- Ja’Ja’ J and Simon J (1982). Parallel Algorithms in Graph Theory, SIAM Journal on Computing, 11:2, (314-328), Online publication date: 1-May-1982.
- Hassett J Automated layout in ASHLAR Proceedings of the 19th Design Automation Conference, (777-784)
Recommendations
Approximation algorithms for clique transversals on some graph classes
Given a graph G = ( V , E ) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a minimum-cardinality clique ...
Exact Algorithms for Graph Homomorphisms
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is k-colorable. During recent years the topic of exact (exponential-time)...
O( n 2) algorithms for graph planarization
The authors present two O( n 2) planarization algorithms, PLANARIZE and MAXIMAL-PLANARIZE. These algorithms are based on A. Lempel, S. Even, and I. Cederbaum's (1967) planarity testing algorithm and its implementation using PQ -trees. Algorithm ...