skip to main content
Skip header Section
Introduction to algorithmsAugust 1990
Publisher:
  • MIT Press
  • 55 Hayward St.
  • Cambridge
  • MA
  • United States
ISBN:978-0-262-03141-7
Published:01 August 1990
Pages:
1028
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. Chentsov A and Chentsov P (2023). Two-Stage Dynamic Programming in the Routing Problem with Decomposition, Automation and Remote Control, 84:5, (543-563), Online publication date: 1-May-2023.
  2. ACM
    Psarras C, Barthels H and Bientinesi P (2022). The Linear Algebra Mapping Problem. Current State of Linear Algebra Languages and Libraries, ACM Transactions on Mathematical Software, 48:3, (1-30), Online publication date: 30-Sep-2022.
  3. ACM
    Juárez J, Santos C and Brizuela C (2021). A Comprehensive Review and a Taxonomy Proposal of Team Formation Problems, ACM Computing Surveys, 54:7, (1-33), Online publication date: 30-Sep-2022.
  4. ACM
    Zhang C, Hartline J and Dimoulas C Karp: a language for NP reductions Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, (762-776)
  5. Wada A and Takai S (2022). Decentralized diagnosis of discrete event systems subject to permanent sensor failures, Discrete Event Dynamic Systems, 32:2, (159-193), Online publication date: 1-Jun-2022.
  6. ACM
    Özdemir S, Khasawneh M, Rao S and Madden P Kernel Mapping Techniques for Deep Learning Neural Network Accelerators Proceedings of the 2022 International Symposium on Physical Design, (21-28)
  7. ACM
    Wang S, Bao Z, Culpepper J and Cong G (2021). A Survey on Trajectory Data Management, Analytics, and Learning, ACM Computing Surveys, 54:2, (1-36), Online publication date: 31-Mar-2022.
  8. Luo L, Liu Y, Yang H and Qian D (2022). Magas: matrix-based asynchronous graph analytics on shared memory systems, The Journal of Supercomputing, 78:4, (5650-5680), Online publication date: 1-Mar-2022.
  9. Mao Y, Mitra A, Sundaram S and Tabuada P (2021). On the computational complexity of the secure state-reconstruction problem, Automatica (Journal of IFAC), 136:C, Online publication date: 1-Feb-2022.
  10. Chakraborty M, Mehera R and Pal R (2021). Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph, Theoretical Computer Science, 900:C, (35-52), Online publication date: 8-Jan-2022.
  11. Biniaz A (2021). Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios, Discrete & Computational Geometry, 67:1, (311-327), Online publication date: 1-Jan-2022.
  12. ACM
    Hecht M, Gonciarz K and Horvát S (2021). Tight Localizations of Feedback Sets, ACM Journal of Experimental Algorithmics, 26, (1-19), Online publication date: 31-Dec-2022.
  13. Violettas G, Simoglou G, Petridou S and Mamatas L (2021). A Softwarized Intrusion Detection System for the RPL-based Internet of Things networks, Future Generation Computer Systems, 125:C, (698-714), Online publication date: 1-Dec-2021.
  14. ACM
    Cheng L, Ahmed S, Liljestrand H, Nyman T, Cai H, Jaeger T, Asokan N and Yao D (2021). Exploitation Techniques for Data-oriented Attacks with Existing and Potential Defense Approaches, ACM Transactions on Privacy and Security, 24:4, (1-36), Online publication date: 30-Nov-2021.
  15. Baidari I and Honnikoll N (2022). Bhattacharyya distance based concept drift detection method for evolving data stream, Expert Systems with Applications: An International Journal, 183:C, Online publication date: 30-Nov-2021.
  16. ACM
    Even G, Levi R, Medina M and Rosén A (2021). Sublinear Random Access Generators for Preferential Attachment Graphs, ACM Transactions on Algorithms, 17:4, (1-26), Online publication date: 31-Oct-2021.
  17. ACM
    Sati A, Karamouzas I and Zordan V DIGISEW: Anisotropic Stitching for Variable Stretch in Textiles Symposium on Computational Fabrication, (1-10)
  18. ACM
    Ishimwe D, Nguyen K and Nguyen T (2021). Dynaplex: analyzing program complexity using dynamically inferred recurrence relations, Proceedings of the ACM on Programming Languages, 5:OOPSLA, (1-23), Online publication date: 20-Oct-2021.
  19. ACM
    Besta M, Kanakagiri R, Kwasniewski G, Ausavarungnirun R, Beránek J, Kanellopoulos K, Janda K, Vonarburg-Shmaria Z, Gianinazzi L, Stefan I, Luna J, Golinowski J, Copik M, Kapp-Schwoerer L, Di Girolamo S, Blach N, Konieczny M, Mutlu O and Hoefler T SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture, (282-297)
  20. Arman A and Loguinov D (2022). Origami, Proceedings of the VLDB Endowment, 15:2, (259-271), Online publication date: 1-Oct-2021.
  21. Wu C, Peng Q, Lee J, Leibnitz K and Xia Y (2021). Effective hierarchical clustering based on structural similarities in nearest neighbor graphs, Knowledge-Based Systems, 228:C, Online publication date: 27-Sep-2021.
  22. Wu C, Wang L and Wang J (2021). A path relinking enhanced estimation of distribution algorithm for direct acyclic graph task scheduling problem, Knowledge-Based Systems, 228:C, Online publication date: 27-Sep-2021.
  23. Di Stolfo P and Schröder A (2021). C and C 0 hp-finite elements on d-dimensional meshes with arbitrary hanging nodes, Finite Elements in Analysis and Design, 192:C, Online publication date: 15-Sep-2021.
  24. Ha D, Katagiri S, Watanabe H and Ohsaki M (2021). An Improved Boundary Uncertainty-Based Estimation for Classifier Evaluation, Journal of Signal Processing Systems, 93:9, (1057-1084), Online publication date: 1-Sep-2021.
  25. ACM
    Ju W, Yuan D, Bao W, Ge L and Zhou B (2021). eDeepSave: Saving DNN Inference using Early Exit During Handovers in Mobile Edge Environment, ACM Transactions on Sensor Networks, 17:3, (1-28), Online publication date: 31-Aug-2021.
  26. Wißmann T, Deifel H, Milius S and Schröder L (2021). From generic partition refinement to weighted tree automata minimization, Formal Aspects of Computing, 33:4-5, (695-727), Online publication date: 1-Aug-2021.
  27. ACM
    López-Martínez A, Mukhopadhyay S and Nanongkai D Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (351-361)
  28. ACM
    Ahmad Z, Chowdhury R, Das R, Ganapathi P, Gregory A and Zhu Y Fast Stencil Computations using Fast Fourier Transforms Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (8-21)
  29. ACM
    Ahmad Z, Chowdhury R, Das R, Ganapathi P, Gregory A and Javanmard M Low-Span Parallel Algorithms for the Binary-Forking Model Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (22-34)
  30. Takai S (2021). A general framework for diagnosis of discrete event systems subject to sensor failures, Automatica (Journal of IFAC), 129:C, Online publication date: 1-Jul-2021.
  31. ACM
    Whitley D, Chicano F and Aguirre H Quadratization of gray coded representations, long path problems and needle functions Proceedings of the Genetic and Evolutionary Computation Conference, (644-651)
  32. ACM
    Salehi A, Coninx A and Doncieux S BR-NS Proceedings of the Genetic and Evolutionary Computation Conference, (172-179)
  33. ACM
    Paradis A, Bichsel B, Steffen S and Vechev M Unqomp: synthesizing uncomputation in Quantum circuits Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, (222-236)
  34. ACM
    Augustine J, Shetiya S, Esfandiari M, Basu Roy S and Das G A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems Proceedings of the 2021 International Conference on Management of Data, (142-154)
  35. ACM
    Tseng T, Dhulipala L and Shun J Parallel Index-Based Structural Graph Clustering and Its Approximation Proceedings of the 2021 International Conference on Management of Data, (1851-1864)
  36. ACM
    Wang Y, Wang Q, Koehler H and Lin Y Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks Proceedings of the 2021 International Conference on Management of Data, (1946-1958)
  37. ACM
    Kristensson P and Müllners T Design and Analysis of Intelligent Text Entry Systems with Function Structure Models and Envelope Analysis Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, (1-12)
  38. ACM
    Sun Y, Zhuang F, Zhu H, He Q and Xiong H Cost-Effective and Interpretable Job Skill Recommendation with Deep Reinforcement Learning Proceedings of the Web Conference 2021, (3827-3838)
  39. ACM
    Wu Y, Lian D, Gong N, Yin L, Yin M, Zhou J and Yang H Linear-Time Self Attention with Codeword Histogram for Efficient Recommendation Proceedings of the Web Conference 2021, (1262-1273)
  40. ACM
    Tang C, Liao J, Wang H, Sung C and Lin W ConceptGuide: Supporting Online Video Learning with Concept Map-based Recommendation of Learning Path Proceedings of the Web Conference 2021, (2757-2768)
  41. ACM
    Chikhi R, Holub J and Medvedev P (2021). Data Structures to Represent a Set of k-long DNA Sequences, ACM Computing Surveys, 54:1, (1-22), Online publication date: 1-Apr-2021.
  42. Kianian S and Rostamnia M (2021). An efficient path-based approach for influence maximization in social networks, Expert Systems with Applications: An International Journal, 167:C, Online publication date: 1-Apr-2021.
  43. Burhan H, Attea B, Abbood A, Abbas M and Al-Ani M (2021). Evolutionary multi-objective set cover problem for task allocation in the Internet of Things, Applied Soft Computing, 102:C, Online publication date: 1-Apr-2021.
  44. Zhang Y, Liu X, Ling Y, Yang M and Huang H (2021). Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality, Numerical Algorithms, 86:4, (1591-1614), Online publication date: 1-Apr-2021.
  45. Anselma L, Mazzei A, Piovesan L and Terenziani P (2021). Reasoning and querying bounds on differences with layered preferences, International Journal of Intelligent Systems, 36:5, (1998-2035), Online publication date: 31-Mar-2021.
  46. ACM
    Jiang L, Tan R and Easwaran A (2020). Resilience Bounds of Network Clock Synchronization with Fault Correction, ACM Transactions on Sensor Networks, 16:4, (1-30), Online publication date: 30-Nov-2020.
  47. ACM
    Ghzouli R, Berger T, Johnsen E, Dragule S and Wąsowski A Behavior trees in action: a study of robotics applications Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, (196-209)
  48. ACM
    Kelly T (2020). A penny in every fuse box, ACM Inroads, 11:4, (52-53), Online publication date: 12-Nov-2020.
  49. Knop D, Koutecký M and Mnich M (2019). Combinatorial n-fold integer programming and applications, Mathematical Programming: Series A and B, 184:1-2, (1-34), Online publication date: 1-Nov-2020.
  50. Guttmann W Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras Relational and Algebraic Methods in Computer Science, (134-151)
  51. ACM
    Jiang J, Li Z, Ju C and Wang W MARU Proceedings of the 29th ACM International Conference on Information & Knowledge Management, (575-584)
  52. ACM
    Xian Y, Fu Z, Zhao H, Ge Y, Chen X, Huang Q, Geng S, Qin Z, de Melo G, Muthukrishnan S and Zhang Y CAFE Proceedings of the 29th ACM International Conference on Information & Knowledge Management, (1645-1654)
  53. ACM
    Yan J, Xu Z, Tiwana B and Chatterjee S Ads Allocation in Feed via Constrained Optimization Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (3386-3394)
  54. ACM
    Konar A and Sidiropoulos N Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (577-587)
  55. ACM
    Fujiwara Y, Kumagai A, Kanai S, Ida Y and Ueda N Efficient Algorithm for the b-Matching Graph Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (187-197)
  56. ACM
    Liénardy S Learning Computer Programming around a CAFÉ Proceedings of the 2020 ACM Conference on International Computing Education Research, (318-319)
  57. ACM
    Feng Y, Shi Q, Gao X, Wan J, Fang C and Chen Z DeepGini: prioritizing massive tests to enhance the robustness of deep neural networks Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, (177-188)
  58. ACM
    Lokshtanov D, Panolan F, Saurabh S, Sharma R and Zehavi M (2020). Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms, ACM Transactions on Algorithms, 16:3, (1-31), Online publication date: 26-Jun-2020.
  59. ACM
    Whitley D, Aguirre H and Sutton A Understanding transforms of pseudo-boolean functions Proceedings of the 2020 Genetic and Evolutionary Computation Conference, (760-768)
  60. ACM
    McGlohon N, Ross R and Carothers C Evaluation of Link Failure Resilience in Multirail Dragonfly-Class Networks through Simulation Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, (105-116)
  61. ACM
    Chatterjee K, Fu H, Goharshady A and Goharshady E Polynomial invariant generation for non-deterministic recursive programs Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, (672-687)
  62. ACM
    Besta M, Fischer M, Ben-Nun T, Stanojevic D, Licht J and Hoefler T (2020). Substream-Centric Maximum Matchings on FPGA, ACM Transactions on Reconfigurable Technology and Systems, 13:2, (1-33), Online publication date: 10-Jun-2020.
  63. ACM
    Khamesi A, Silvestri S, Baker D and Paola A (2020). Perceived-Value-driven Optimization of Energy Consumption in Smart Homes, ACM Transactions on Internet of Things, 1:2, (1-26), Online publication date: 31-May-2020.
  64. ACM
    Li W, Jiang D, Xiong J and Bao Y HiLSM Proceedings of the 17th ACM International Conference on Computing Frontiers, (208-216)
  65. ACM
    Lockerman E, Feldmann A, Bakhshalipour M, Stanescu A, Gupta S, Sanchez D and Beckmann N Livia Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, (417-433)
  66. ACM
    Poyiadzi R, Sokol K, Santos-Rodriguez R, De Bie T and Flach P FACE Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, (344-350)
  67. Ye Z, Yu M and Liu Y (2019). NP-completeness of optimal planning problem for modular robots, Autonomous Robots, 43:8, (2261-2270), Online publication date: 1-Dec-2019.
  68. ACM
    Li M, Liu W, Guan N, Xie Y and Ye Y (2019). Hardware-Software Collaborative Thermal Sensing in Optical Network-on-Chip--based Manycore Systems, ACM Transactions on Embedded Computing Systems, 18:6, (1-24), Online publication date: 30-Nov-2019.
  69. ACM
    Jabal A, Davari M, Bertino E, Makaya C, Calo S, Verma D, Russo A and Williams C (2019). Methods and Tools for Policy Analysis, ACM Computing Surveys, 51:6, (1-35), Online publication date: 30-Nov-2019.
  70. Backhouse R An Analysis of Repeated Graph Search Mathematics of Program Construction, (298-328)
  71. Gupta N, Gupta T, Samaddar S and Roy S WebReLog: A Web-based Tool for Disaster Relief Logistics with Vehicle Route Planning 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), (1012-1017)
  72. Oleshchuk V Secure and Privacy Preserving Pattern Matching in Distributed Cloud-based Data Storage 2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), (820-823)
  73. Rivas D and Ribas-Xirgo L Agent-based Model for Transport Order Assignment in AGV Systems 2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), (947-954)
  74. ACM
    Dey S, Zhang P, Sow D and Ng K PerDREP Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1258-1268)
  75. Elmasry A, Kahla M, Ahdy F and Hashem M (2019). Red---black trees with constant update time, Acta Informatica, 56:5, (391-404), Online publication date: 1-Jul-2019.
  76. Cenciarelli P, Gorla D and Salvo I (2019). Depletable channels, Acta Informatica, 56:5, (405-431), Online publication date: 1-Jul-2019.
  77. ACM
    Sarkhel R and Nandi A Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents Proceedings of the 2019 International Conference on Management of Data, (247-262)
  78. ACM
    Sommer J, Boehm M, Evfimievski A, Reinwald B and Haas P MNC Proceedings of the 2019 International Conference on Management of Data, (1607-1623)
  79. ACM
    Pach J, Rubin N and Tardos G Planar point sets determine many pairwise crossing segments Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (1158-1166)
  80. Tangwongsan K, Hirzel M and Schneider S (2019). Optimal and general out-of-order sliding-window aggregation, Proceedings of the VLDB Endowment, 12:10, (1167-1180), Online publication date: 1-Jun-2019.
  81. ACM
    Fuentes Carranza J and Fong P Brokering Policies and Execution Monitors for IoT Middleware Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, (49-60)
  82. ACM
    Jung J, Iyer R and Vogel D Automating the Intentional Encoding of Human-Designable Markers Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, (1-11)
  83. Shah V, Silvestri S, Luciano B and Das S X-CHANT: A Diverse DSA based Architecture for Next-generation Challenged Networks IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, (586-594)
  84. Raß A, Schreiner J and Wanka R Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation Evolutionary Computation in Combinatorial Optimization, (115-130)
  85. Sahoo A, Hall T and Hagwood C Optimal Dynamic Spectrum Access Scheme for Utilizing White Space in LTE Systems 2019 IEEE Wireless Communications and Networking Conference (WCNC), (1-8)
  86. ACM
    Ramezanian S, Meskanen T and Niemi V Privacy preserving 2-party queries on bipartite graphs with private set intersection Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, (1867-1870)
  87. ACM
    Lunardi W, Voos H and Cherri L An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, (204-211)
  88. ACM
    Shan Z, Ren K, Blanton M and Wang C (2018). Practical Secure Computation Outsourcing, ACM Computing Surveys, 51:2, (1-40), Online publication date: 31-Mar-2019.
  89. Nipkow T and Brinkop H (2019). Amortized Complexity Verified, Journal of Automated Reasoning, 62:3, (367-391), Online publication date: 1-Mar-2019.
  90. Farazmanesh D and Tavakoli A (2019). Morphological Decomposition and Compression of Binary Images via a Minimum Set Cover Algorithm, Journal of Mathematical Imaging and Vision, 61:1, (71-83), Online publication date: 1-Jan-2019.
  91. ACM
    Shah V, Bhattacharjee S, Silvestri S and Das S (2018). Designing Green Communication Systems for Smart and Connected Communities via Dynamic Spectrum Access, ACM Transactions on Sensor Networks, 14:3-4, (1-32), Online publication date: 30-Nov-2018.
  92. ACM
    Vella F, Bernaschi M and Carbone G (2018). Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality, ACM Journal of Experimental Algorithmics, 23, (1-19), Online publication date: 15-Nov-2018.
  93. Kumar P, Agarwal A and Bhagvati C (2018). Isolated structural error analysis of printed mathematical expressions, Pattern Analysis & Applications, 21:4, (1097-1107), Online publication date: 1-Nov-2018.
  94. Wu X, Liu X, Chen Y, Shen J and Zhao W (2018). A graph based superpixel generation algorithm, Applied Intelligence, 48:11, (4485-4496), Online publication date: 1-Nov-2018.
  95. Liu H, Ibrahim M, Kayiran O, Pai S and Jog A Architectural support for efficient large-scale automata processing Proceedings of the 51st Annual IEEE/ACM International Symposium on Microarchitecture, (908-920)
  96. ACM
    Chen L and Liu J EasyGO Proceedings of the 24th Annual International Conference on Mobile Computing and Networking, (835-837)
  97. ACM
    Xiao M, Wang S, Zhou C, Liu L, Li Z, Liu Y and Chen S MiniView Layout for Bandwidth-Efficient 360-Degree Video Proceedings of the 26th ACM international conference on Multimedia, (914-922)
  98. Ciesielski K, Falcão A and Miranda P (2018). Path-Value Functions for Which Dijkstra's Algorithm Returns Optimal Mapping, Journal of Mathematical Imaging and Vision, 60:7, (1025-1036), Online publication date: 1-Sep-2018.
  99. ACM
    Zhao H, Zhang H, Xin S, Deng Y, Tu C, Wang W, Cohen-Or D and Chen B (2018). DSCarver, ACM Transactions on Graphics, 37:4, (1-14), Online publication date: 31-Aug-2018.
  100. ACM
    Ara H, Behrouzian A, Hendriks M, Geilen M, Goswami D and Basten T (2018). Scalable Analysis for Multi-Scale Dataflow Models, ACM Transactions on Embedded Computing Systems, 17:4, (1-26), Online publication date: 31-Jul-2018.
  101. Guha S, Kupferman O and Vardi G Multi-Player Flow Games Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (104-112)
  102. ACM
    Parque V and Miyashita T Towards bundling minimal trees in polygonal maps Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1813-1820)
  103. Sheibani K (2018). A Very Fast Heuristic for Combinatorial Optimization With Specific Application to Priority Rule Sequencing in Operations Management, International Journal of Operations Research and Information Systems, 9:3, (77-89), Online publication date: 1-Jul-2018.
  104. Li B, Khlif-Bouassida M and Toguyéni A (2018). On–The–Fly Diagnosability Analysis of Bounded and Unbounded Labeled Petri Nets Using Verifier Nets, International Journal of Applied Mathematics and Computer Science, 28:2, (269-281), Online publication date: 1-Jun-2018.
  105. Vinogradov D (2018). On Object Representation by Bit Strings for the VKF-Method, Automatic Documentation and Mathematical Linguistics, 52:3, (113-116), Online publication date: 1-May-2018.
  106. Yin B, Cao J, Kang Y, Lu X and Jiang X (2018). A novel POMDP-based server RAM caching algorithm for VoD systems, Multimedia Tools and Applications, 77:10, (13023-13045), Online publication date: 1-May-2018.
  107. Kupferman O and Vardi G (2018). On relative and probabilistic finite counterability, Formal Methods in System Design, 52:2, (117-146), Online publication date: 1-Apr-2018.
  108. Li L, Liu J, Sun Y, Xu G, Yuan J and Zhong L (2018). Unsupervised keyword extraction from microblog posts via hashtags, Journal of Web Engineering, 17:1-2, (93-120), Online publication date: 1-Mar-2018.
  109. Kulkarni S, Patil R, Krishnamoorthy M, Ernst A and Ranade A (2018). A new two-stage heuristic for the recreational vehicle scheduling problem, Computers and Operations Research, 91:C, (59-78), Online publication date: 1-Mar-2018.
  110. ACM
    Barthels H, Copik M and Bientinesi P The generalized matrix chain algorithm Proceedings of the 2018 International Symposium on Code Generation and Optimization, (138-148)
  111. Zhou G, Luo P, Cao R, Xiao Y, Lin F, Chen B and He Q Tree-structured neural machine for linguistics-aware sentence generation Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (5722-5729)
  112. Wang H, Wang J, Wang J, Zhao M, Zhang W, Zhang F, Xie X and Guo M GraphGAN Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (2508-2515)
  113. Carlson D (2018). Sophomores meet the traveling salesperson problem, Journal of Computing Sciences in Colleges, 33:3, (126-133), Online publication date: 1-Jan-2018.
  114. Gandy A and Veraart L (2017). A Bayesian Methodology for Systemic Risk Assessment in Financial Networks, Management Science, 63:12, (4428-4446), Online publication date: 1-Dec-2017.
  115. Jia Z, Kwon Y, Shipman G, McCormick P, Erez M and Aiken A (2017). A distributed multi-GPU system for fast graph processing, Proceedings of the VLDB Endowment, 11:3, (297-310), Online publication date: 1-Nov-2017.
  116. Boejko W, Gnatowski A, Pempera J and Wodecki M (2017). Parallel tabu search for the cyclic job shop scheduling problem, Computers and Industrial Engineering, 113:C, (512-524), Online publication date: 1-Nov-2017.
  117. Maleki H, Khanduzi R and Akbari R (2017). A novel hybrid algorithm for solving continuous single-objective defensive location problem, Neural Computing and Applications, 28:11, (3323-3340), Online publication date: 1-Nov-2017.
  118. ACM
    Hwang H, Janson S and Tsai T (2017). Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half, ACM Transactions on Algorithms, 13:4, (1-43), Online publication date: 31-Oct-2017.
  119. Jo H and Park H (2017). Fast prime number generation algorithms on smart mobile devices, Cluster Computing, 20:3, (2167-2175), Online publication date: 1-Sep-2017.
  120. Belardinelli F and Herzig A Dynamic logic for data-aware systems Proceedings of the 26th International Joint Conference on Artificial Intelligence, (821-827)
  121. ACM
    Zhang L, Wu Y and Wu X Achieving Non-Discrimination in Data Release Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1335-1344)
  122. ACM
    Li X, Cheng Y, Cong G and Chen L Discovering Pollution Sources and Propagation Patterns in Urban Area Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1863-1872)
  123. Hendriks M, Verriet J, Basten T, Theelen B, Brassé M and Somers L (2017). Analyzing execution traces, International Journal on Software Tools for Technology Transfer (STTT), 19:4, (487-510), Online publication date: 1-Aug-2017.
  124. ACM
    Barthels H and Bientinesi P Linnea Proceedings of the International Workshop on Parallel Symbolic Computation, (1-3)
  125. Mehdi M, Raza I and Hussain S (2017). A game theory based trust model for Vehicular Ad hoc Networks (VANETs), Computer Networks: The International Journal of Computer and Telecommunications Networking, 121:C, (152-172), Online publication date: 5-Jul-2017.
  126. ACM
    Eenberg K, Larsen K and Yu H DecreaseKeys are expensive for external memory priority queues Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (1081-1093)
  127. ACM
    Gan E and Bailis P Scalable Kernel Density Classification via Threshold-Based Pruning Proceedings of the 2017 ACM International Conference on Management of Data, (945-959)
  128. Ramanathan R, Ciftcioglu E, Samanta A, Urgaonkar R and La Porta T (2017). Symptotics, Wireless Networks, 23:4, (1063-1083), Online publication date: 1-May-2017.
  129. ACM
    Chow K and Zhu W Software Performance Analytics in the Cloud Proceedings of the 8th ACM/SPEC on International Conference on Performance Engineering, (419-421)
  130. Sheibani K (2017). An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management, International Journal of Applied Evolutionary Computation, 8:2, (58-72), Online publication date: 1-Apr-2017.
  131. Liang Y and Zhang S (2017). Embedding parallelizable virtual networks, Computer Communications, 102:C, (47-57), Online publication date: 1-Apr-2017.
  132. Hung C, Lin C and Wu P (2017). An Efficient GPU-Based Multiple Pattern Matching Algorithm for Packet Filtering, Journal of Signal Processing Systems, 86:2-3, (347-358), Online publication date: 1-Mar-2017.
  133. Park Y, Park K, Kim J and Jeong H (2017). Fast Fourier transform benchmark on X86 Xeon system for multimedia data processing, Multimedia Tools and Applications, 76:4, (6015-6030), Online publication date: 1-Feb-2017.
  134. ACM
    Georgiadis L, Italiano G, Laura L and Parotsidis N (2016). 2-Edge Connectivity in Directed Graphs, ACM Transactions on Algorithms, 13:1, (1-24), Online publication date: 21-Dec-2016.
  135. Maleki E and Mirjalily G (2016). Fault-tolerant interference-aware topology control in multi-radio multi-channel wireless mesh networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, 110:C, (206-222), Online publication date: 9-Dec-2016.
  136. Namkoong H and Duchi J Stochastic gradient methods for distributionally robust optimization with f-divergences Proceedings of the 30th International Conference on Neural Information Processing Systems, (2216-2224)
  137. Jansson J, Sung W, Vu H and Yiu S (2016). Faster Algorithms for Computing the R* Consensus Tree, Algorithmica, 76:4, (1224-1244), Online publication date: 1-Dec-2016.
  138. Toko Worou B and Galtier J (2016). Fast approximation for computing the fractional arboricity and extraction of communities of a graph, Discrete Applied Mathematics, 213:C, (179-195), Online publication date: 20-Nov-2016.
  139. Jain T and Schneider K Verifying the concentration property of permutation networks by BDDs Proceedings of the 14th ACM-IEEE International Conference on Formal Methods and Models for System Design, (43-53)
  140. Chentsov A and Chentsov P (2016). Routing under constraints, Automation and Remote Control, 77:11, (1957-1974), Online publication date: 1-Nov-2016.
  141. Gainanov D, Konygin A and Rasskazova V (2016). Modelling railway freight traffic using the methods of graph theory and combinatorial optimization, Automation and Remote Control, 77:11, (1928-1943), Online publication date: 1-Nov-2016.
  142. Hirsch M, Ish-Shalom A and Klein S (2016). Optimal partitioning of data chunks in deduplication systems, Discrete Applied Mathematics, 212:C, (104-114), Online publication date: 30-Oct-2016.
  143. ACM
    Barthels H A compiler for linear algebra operations Companion Proceedings of the 2016 ACM SIGPLAN International Conference on Systems, Programming, Languages and Applications: Software for Humanity, (49-50)
  144. Alawneh L, Hamou-Lhadj A and Hassine J (2016). Segmenting large traces of inter-process communication with a focus on high performance computing systems, Journal of Systems and Software, 120:C, (1-16), Online publication date: 1-Oct-2016.
  145. Karathanasopoulos N and Kress G (2016). Two dimensional modeling of helical structures, an application to simple strands, Computers and Structures, 174:C, (79-84), Online publication date: 1-Oct-2016.
  146. ACM
    Cai F, Reinanda R and Rijke M (2016). Diversifying Query Auto-Completion, ACM Transactions on Information Systems, 34:4, (1-33), Online publication date: 14-Sep-2016.
  147. Willemse E and Joubert J (2016). Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities, Operations Research Letters, 44:5, (569-574), Online publication date: 1-Sep-2016.
  148. van Riessen B, Negenborn R and Dekker R (2016). Real-time container transport planning with decision trees based on offline obtained optimal solutions, Decision Support Systems, 89:C, (1-16), Online publication date: 1-Sep-2016.
  149. Pascali M, Giorgi D, Bastiani L, Buzzigoli E, Henriquez P, Matuszewski B, Morales M and Colantonio S (2016). Face morphology, Computers in Biology and Medicine, 76:C, (238-249), Online publication date: 1-Sep-2016.
  150. ACM
    Sui X, Lenharth A, Fussell D and Pingali K (2016). Proactive Control of Approximate Programs, ACM SIGARCH Computer Architecture News, 44:2, (607-621), Online publication date: 29-Jul-2016.
  151. ACM
    WU Y, Zhu X, Li L, Fan W, Jin R and Zhang X (2016). Mining Dual Networks, ACM Transactions on Knowledge Discovery from Data, 10:4, (1-37), Online publication date: 27-Jul-2016.
  152. Xia Y, Leung H and Kamel M (2016). A discrete-time learning algorithm for image restoration using a novel L2-norm noise constrained estimation, Neurocomputing, 198:C, (155-170), Online publication date: 19-Jul-2016.
  153. ACM
    Bender M, Demaine E, Ebrahimi R, Fineman J, Johnson R, Lincoln A, Lynch J and McCauley S Cache-Adaptive Analysis Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, (135-144)
  154. Lee M and Sheu J (2016). An efficient routing algorithm based on segment routing in software-defined networking, Computer Networks: The International Journal of Computer and Telecommunications Networking, 103:C, (44-55), Online publication date: 5-Jul-2016.
  155. Čomić L Morse Chain Complex from Forman Gradient in 3D with $$\mathbb {Z}_2$$Z2 Coefficients Proceedings of the 6th International Workshop on Computational Topology in Image Context - Volume 9667, (42-52)
  156. ACM
    Sui X, Lenharth A, Fussell D and Pingali K (2016). Proactive Control of Approximate Programs, ACM SIGPLAN Notices, 51:4, (607-621), Online publication date: 9-Jun-2016.
  157. ACM
    Yasui Y, Fujisawa K, Goh E, Baron J, Sugiura A and Uchiyama T NUMA-aware Scalable Graph Traversal on SGI UV Systems Proceedings of the ACM Workshop on High Performance Graph Processing, (19-26)
  158. ACM
    Salinas S, Luo C, Liao W and Li P Efficient Secure Outsourcing of Large-scale Quadratic Programs Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (281-292)
  159. Lambert T, Bénard P and Guennebaud G Multi-resolution meshes for feature-aware hardware tessellation Proceedings of the 37th Annual Conference of the European Association for Computer Graphics, (253-262)
  160. ACM
    Bae J, Bae S, Moon I and Kim T (2016). Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models, ACM Transactions on Modeling and Computer Simulation, 26:4, (1-25), Online publication date: 2-May-2016.
  161. Wen Y (2016). Energy-aware dynamical hosts and tasks assignment for cloud computing, Journal of Systems and Software, 115:C, (144-156), Online publication date: 1-May-2016.
  162. ACM
    Lenharth A, Nguyen D and Pingali K (2016). Parallel graph analytics, Communications of the ACM, 59:5, (78-87), Online publication date: 26-Apr-2016.
  163. ACM
    Sui X, Lenharth A, Fussell D and Pingali K Proactive Control of Approximate Programs Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, (607-621)
  164. ACM
    Sankar A, Chakraborty S and Nandivada V Improved MHP Analysis Proceedings of the 25th International Conference on Compiler Construction, (207-217)
  165. ACM
    Lacassagne L, Cabaret L, Etiemble D, Hebache F and Petreto A A new SIMD iterative connected component labeling algorithm Proceedings of the 3rd Workshop on Programming Models for SIMD/Vector Processing, (1-8)
  166. Colombo F, Cordone R and Lulli G (2016). The multimode covering location problem, Computers and Operations Research, 67:C, (25-33), Online publication date: 1-Mar-2016.
  167. Chassaing M, Duhamel C and Lacomme P (2016). An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem, Engineering Applications of Artificial Intelligence, 48:C, (119-133), Online publication date: 1-Feb-2016.
  168. Faisal M, Mathkour H and Alsulaiman M (2016). AntStar, Scientific Programming, 2016, (2-2), Online publication date: 1-Jan-2016.
  169. Bhushan A and Sajith G An I/O Efficient Algorithm for Minimum Spanning Trees Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (499-509)
  170. Chauvin B, Gardy D and Mailler C (2015). A sprouting tree model for random boolean functions, Random Structures & Algorithms, 47:4, (635-662), Online publication date: 1-Dec-2015.
  171. Sen A, Mazumder A, Banerjee S, Das A, Zhou C and Shirazipourazad S (2015). Region-based fault-tolerant distributed file storage system design in networks, Networks, 66:4, (380-395), Online publication date: 1-Dec-2015.
  172. Richter S, Alvarez V and Dittrich J (2015). A seven-dimensional analysis of hashing methods and its implications on query processing, Proceedings of the VLDB Endowment, 9:3, (96-107), Online publication date: 1-Nov-2015.
  173. Bing Li and Schlichtmann U (2015). Statistical Timing Analysis and Criticality Computation for Circuits With Post-Silicon Clock Tuning Elements, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 34:11, (1784-1797), Online publication date: 1-Nov-2015.
  174. Fuchun Liu (2015). Safe Diagnosability of Fuzzy Discrete-Event Systems and a Polynomial-Time Verification, IEEE Transactions on Fuzzy Systems, 23:5, (1534-1544), Online publication date: 1-Oct-2015.
  175. ACM
    Hata T, Kawasaki H, Kurasawa H, Sato H, Nakamura M and Tsutsui A Top of worlds Adjunct Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2015 ACM International Symposium on Wearable Computers, (1405-1412)
  176. (2015). Speeding up the cyclic edit distance using LAESA with early abandon, Pattern Recognition Letters, 62:C, (1-7), Online publication date: 1-Sep-2015.
  177. Seshadri K, Mercy Shalinie S and Kollengode C (2015). Design and evaluation of a parallel algorithm for inferring topic hierarchies, Information Processing and Management: an International Journal, 51:5, (662-676), Online publication date: 1-Sep-2015.
  178. Yu J (2015). A model for tracing cross-referenced statement validity, Computer Standards & Interfaces, 41:C, (10-16), Online publication date: 1-Sep-2015.
  179. Chaudhary R, Fernández-Baca D and Burleigh J Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis Proceedings of the Second International Conference on Algorithms for Computational Biology - Volume 9199, (97-108)
  180. Miller B, Beard M, Wolfe P and Bliss N (2015). A Spectral Framework for Anomalous Subgraph Detection, IEEE Transactions on Signal Processing, 63:16, (4191-4206), Online publication date: 1-Aug-2015.
  181. Werth T, Büttner S and Krumke S (2015). Robust bottleneck routing games, Networks, 66:1, (57-66), Online publication date: 1-Aug-2015.
  182. Qian C, Yu Y and Zhou Z On constrained boolean pareto optimization Proceedings of the 24th International Conference on Artificial Intelligence, (389-395)
  183. ACM
    Singhee A, Lavin M, Finkler U, Heng F, Qu J and Hirsch S HAMS Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, (171-178)
  184. Rybicki J and Suomela J Exact Bounds for Distributed Graph Colouring Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439, (46-60)
  185. ACM
    Whitley D Mk Landscapes, NK Landscapes, MAX-kSAT Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (927-934)
  186. ACM
    Corus D, He J, Jansen T, Oliveto P, Sudholt D and Zarges C On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (1399-1406)
  187. ACM
    Weissman S, Ayhan S, Bradley J and Lin J Identifying Duplicate and Contradictory Information in Wikipedia Proceedings of the 15th ACM/IEEE-CS Joint Conference on Digital Libraries, (57-60)
  188. ACM
    Larsen K, Nelson J and Nguyên H Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, (803-812)
  189. ACM
    Green O, Dukhan M and Vuduc R Branch-Avoiding Graph Algorithms Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, (212-223)
  190. Kobayashi T, Aoyama T, Sekiyama K and Fukuda T (2015). Selection Algorithm for Locomotion Based on the Evaluation of Falling Risk, IEEE Transactions on Robotics, 31:3, (750-765), Online publication date: 1-Jun-2015.
  191. Der-Wei Yang , Li-Chia Chu , Chun-Wei Chen , Jonas Wang and Ming-Der Shieh (2015). Depth-Reliability-Based Stereo-Matching Algorithm and Its VLSI Architecture Design, IEEE Transactions on Circuits and Systems for Video Technology, 25:6, (1038-1050), Online publication date: 1-Jun-2015.
  192. ACM
    Müller I, Sanders P, Lacurie A, Lehner W and Färber F Cache-Efficient Aggregation Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, (1123-1136)
  193. ACM
    Liu W, Salman E, Sitik C and Taskin B Clock Skew Scheduling in the Presence of Heavily Gated Clock Networks Proceedings of the 25th edition on Great Lakes Symposium on VLSI, (283-288)
  194. Yu H, Hsieh C, Yun H, Vishwanathan S and Dhillon I A Scalable Asynchronous Distributed Algorithm for Topic Modeling Proceedings of the 24th International Conference on World Wide Web, (1340-1350)
  195. ACM
    Chatterjee K, Ibsen-Jensen R, Pavlogiannis A and Goyal P (2015). Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth, ACM SIGPLAN Notices, 50:1, (97-109), Online publication date: 11-May-2015.
  196. ACM
    Piovarči M, Madaras M and Ďurikovič R Physically inspired stretching for skinning animation of non-rigid bodies Proceedings of the 31st Spring Conference on Computer Graphics, (47-53)
  197. Santana V and Baranauskas M (2015). WELFIT, International Journal of Human-Computer Studies, 76:C, (40-49), Online publication date: 1-Apr-2015.
  198. Grandin M (2015). Data structures and algorithms for high-dimensional structured adaptive mesh refinement, Advances in Engineering Software, 82:C, (75-86), Online publication date: 1-Apr-2015.
  199. Yanovich D (2015). Compact representation of polynomials for algorithms for computing Gröbner and involutive bases, Programming and Computing Software, 41:2, (126-130), Online publication date: 1-Mar-2015.
  200. Bei Yu , Kun Yuan , Duo Ding and Pan D (2015). Layout Decomposition for Triple Patterning Lithography, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 34:3, (433-446), Online publication date: 1-Mar-2015.
  201. Caluori U and Simon K (2015). DETEXTIVE optical character recognition with pattern matching on-the-fly, Pattern Recognition, 48:3, (827-836), Online publication date: 1-Mar-2015.
  202. Isaiah P and Shima T (2015). Motion planning algorithms for the Dubins Travelling Salesperson Problem, Automatica (Journal of IFAC), 53:C, (247-255), Online publication date: 1-Mar-2015.
  203. Bhattacharyya M and Bandyopadhyay S (2015). Finding quasi core with simulated stacked neural networks, Information Sciences: an International Journal, 294:C, (1-14), Online publication date: 10-Feb-2015.
  204. Kwiatkowski Ł and Verhoef C (2015). Reducing operational costs through MIPS management, Science of Computer Programming, 98:P4, (551-588), Online publication date: 1-Feb-2015.
  205. Ruiz-Rivera A, Chin K and Soh S (2015). A novel framework to mitigate the negative impacts of green techniques on BGP, Journal of Network and Computer Applications, 48:C, (22-34), Online publication date: 1-Feb-2015.
  206. ACM
    Tinós R, Whitley D and Chicano F Partition Crossover for Pseudo-Boolean Optimization Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, (137-149)
  207. ACM
    Chatterjee K, Ibsen-Jensen R, Pavlogiannis A and Goyal P Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (97-109)
  208. ACM
    Lee H, Hwang H, Le Duc T, Shon M, Choo H and Kim D Restructuring binomial trees for delay-aware and energy-efficient data aggregation in wireless sensor networks Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, (1-4)
  209. Georgiadis L, Italiano G, Laura L and Parotsidis N 2-edge connectivity in directed graphs Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (1988-2005)
  210. ACM
    Chilukuri S and Sahoo A Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks Proceedings of the 2015 International Conference on Distributed Computing and Networking, (1-10)
  211. P. P, Agarwal A and Bhagvati C A Knowledge-Based Design for Structural Analysis of Printed Mathematical Expressions Proceedings of the 8th International Workshop on Multi-disciplinary Trends in Artificial Intelligence - Volume 8875, (112-123)
  212. ACM
    Deora M and Sharma S Challenges & Effects of increasing Computational Speed for ICT Applications Proceedings of the 2014 International Conference on Information and Communication Technology for Competitive Strategies, (1-5)
  213. Tosi A, Hauberg S, Vellido A and Lawrence N Metrics for probabilistic geometries Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, (800-808)
  214. ACM
    Alkhalaf M, Aydin A and Bultan T Semantic differential repair for input validation and sanitization Proceedings of the 2014 International Symposium on Software Testing and Analysis, (225-236)
  215. ACM
    Rahat A, Everson R and Fieldsend J Multi-objective routing optimisation for battery-powered wireless sensor mesh networks Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, (1175-1182)
  216. ACM
    Nilakant K, Dalibard V, Roy A and Yoneki E PrefEdge Proceedings of International Conference on Systems and Storage, (1-12)
  217. Yasui Y, Fujisawa K and Sato Y Fast and Energy-efficient Breadth-First Search on a Single NUMA System Proceedings of the 29th International Conference on Supercomputing - Volume 8488, (365-381)
  218. ACM
    Wang S, Wang Y and Wenger R The JS-graphs of Join and Split Trees Proceedings of the thirtieth annual symposium on Computational geometry, (539-548)
  219. ACM
    Javed M and Zdun U A systematic literature review of traceability approaches between software architecture and source code Proceedings of the 18th International Conference on Evaluation and Assessment in Software Engineering, (1-10)
  220. He L, Kong L, Lin S, Ying S, Gu Y, He T and Liu C Reconfiguration-Assisted Charging in Large-Scale Lithium-Ion Battery Systems ICCPS '14: ACM/IEEE 5th International Conference on Cyber-Physical Systems (with CPS Week 2014), (60-71)
  221. Chentsov A (2014). Problem of successive megalopolis traversal with the precedence conditions, Automation and Remote Control, 75:4, (728-744), Online publication date: 1-Apr-2014.
  222. Friedler O, Kadry W, Morgenshtein A, Nahir A and Sokhin V Effective post-silicon failure localization using dynamic program slicing Proceedings of the conference on Design, Automation & Test in Europe, (1-6)
  223. ACM
    Arshad M, Kundu A, Bertino E, Madhavan K and Ghafoor A Security of graph data Proceedings of the 4th ACM conference on Data and application security and privacy, (223-234)
  224. Czarnul P and Rościszewski P Optimization of Execution Time under Power Consumption Constraints in a Heterogeneous Parallel System with GPUs and CPUs Proceedings of the 15th International Conference on Distributed Computing and Networking - Volume 8314, (66-80)
  225. ACM
    Ma S, Cao Y, Fan W, Huai J and Wo T (2014). Strong simulation, ACM Transactions on Database Systems, 39:1, (1-46), Online publication date: 1-Jan-2014.
  226. Hirsch M, Klein S and Toaff Y (2014). Improving deduplication techniques by accelerating remainder calculations, Discrete Applied Mathematics, 163, (307-315), Online publication date: 1-Jan-2014.
  227. Cirillo P, Hüsler J and Muliere P (2013). Alarm Systems and Catastrophes from a Diverse Point of View, Methodology and Computing in Applied Probability, 15:4, (821-839), Online publication date: 1-Dec-2013.
  228. Yuan K, Kuo C, Jiang J and Li M Encoding multi-valued functions for symmetry Proceedings of the International Conference on Computer-Aided Design, (771-778)
  229. Natarajan A, Savoie L and Mittal N Concurrent Wait-Free Red Black Trees 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 8255, (45-60)
  230. Kifetew F, Jin W, Tiella R, Orso A and Tonella P SBFR Proceedings of the 28th IEEE/ACM International Conference on Automated Software Engineering, (604-609)
  231. ACM
    Gudmundsson J, van Kreveld M and Staals F Algorithms for hotspot computation on trajectory data Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (134-143)
  232. Ikeda K and Hontani A Probability of Perfect Reconstruction of Pareto Set in Multi-Objective Optimization Proceedings, Part II, of the 20th International Conference on Neural Information Processing - Volume 8227, (13-18)
  233. ACM
    Melo D and Lopes A Data visualization and relevance feedback applied to information retrieval Proceedings of the sixth workshop on Ph.D. students in information and knowledge management, (27-32)
  234. Yeh S, Su M, Chen H and Lin C (2013). An efficient and secure approach for a cloud collaborative editing, Journal of Network and Computer Applications, 36:6, (1632-1641), Online publication date: 1-Nov-2013.
  235. ACM
    Bogdanov P and Singh A Accurate and scalable nearest neighbors in large networks based on effective importance Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (1009-1018)
  236. Srivastava S, Gulwani S and Foster J (2013). Template-based program verification and program synthesis, International Journal on Software Tools for Technology Transfer (STTT), 15:5-6, (497-518), Online publication date: 1-Oct-2013.
  237. Kranakis E, MacQuarrie F and Morales Ponce O Approximation algorithms for the antenna orientation problem Proceedings of the 19th international conference on Fundamentals of Computation Theory, (225-235)
  238. ACM
    Doerr C and Blenn N Metric convergence in social network sampling Proceedings of the 5th ACM workshop on HotPlanet, (45-50)
  239. ACM
    Natanzon A and Bachmat E (2013). Dynamic Synchronous/Asynchronous Replication, ACM Transactions on Storage, 9:3, (1-19), Online publication date: 1-Aug-2013.
  240. ACM
    Zhao Y and Barbič J (2013). Interactive authoring of simulation-ready plants, ACM Transactions on Graphics, 32:4, (1-12), Online publication date: 21-Jul-2013.
  241. ACM
    Benazouz M and Munier-Kordon A Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, (3-12)
  242. ACM
    Drmota M and Szpankowski W (2013). A Master Theorem for Discrete Divide and Conquer Recurrences, Journal of the ACM, 60:3, (1-49), Online publication date: 1-Jun-2013.
  243. ACM
    Salodkar N, Rajagopalan S, Bhattacharya S and Batterywala S Automatic design rule correction in presence of multiple grids and track patterns Proceedings of the 50th Annual Design Automation Conference, (1-6)
  244. Nistor A, Song L, Marinov D and Lu S Toddler: detecting performance problems via similar memory-access patterns Proceedings of the 2013 International Conference on Software Engineering, (562-571)
  245. Gremme G, Steinbiss S and Kurtz S (2013). GenomeTools, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:3, (645-656), Online publication date: 1-May-2013.
  246. ACM
    Setty S, Braun B, Vu V, Blumberg A, Parno B and Walfish M Resolving the conflict between generality and plausibility in verified computation Proceedings of the 8th ACM European Conference on Computer Systems, (71-84)
  247. Couprie M (2013). Topological maps and robust hierarchical Euclidean skeletons in cubical complexes, Computer Vision and Image Understanding, 117:4, (355-369), Online publication date: 1-Apr-2013.
  248. Beltrán C and Leykin A (2013). Robust Certified Numerical Homotopy Tracking, Foundations of Computational Mathematics, 13:2, (253-295), Online publication date: 1-Apr-2013.
  249. Postolski M, Couprie M and Janaszewski M Scale filtered euclidean medial axis Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery, (360-371)
  250. ACM
    Libeskind-Hadas R A derivation-first approach to teaching algorithms Proceeding of the 44th ACM technical symposium on Computer science education, (573-578)
  251. Xu D, Li G, Ramamurthy B, Chiu A, Wang D and Doverspike R (2013). On provisioning diverse circuits in heterogeneous multi-layer optical networks, Computer Communications, 36:6, (689-697), Online publication date: 1-Mar-2013.
  252. ACM
    Fraigniaud P and Pelc A (2013). Delays Induce an Exponential Memory Gap for Rendezvous in Trees, ACM Transactions on Algorithms, 9:2, (1-24), Online publication date: 1-Mar-2013.
  253. ACM
    Green O and Birk Y Scheduling directives for shared-memory many-core processor systems Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores, (115-124)
  254. ACM
    Suomela J (2013). Survey of local algorithms, ACM Computing Surveys, 45:2, (1-40), Online publication date: 1-Feb-2013.
  255. Shieh B (2013). Solution to the covering problem, Information Sciences: an International Journal, 222, (626-633), Online publication date: 1-Feb-2013.
  256. Huang J, Jiang B, Pei J, Chen J and Tang Y (2013). Skyline distance, Knowledge and Information Systems, 34:2, (373-396), Online publication date: 1-Feb-2013.
  257. ACM
    Carbon A, Lhuillier Y and Charles H Code specialization for red-black tree management algorithms Proceedings of the 3rd International Workshop on Adaptive Self-Tuning Computing Systems, (1-3)
  258. ACM
    Burjorjee K Explaining optimization in genetic algorithms with uniform crossover Proceedings of the twelfth workshop on Foundations of genetic algorithms XII, (37-50)
  259. Turki M, Marrakchi Z, Mehrez H and Abid M (2013). Frequency optimization objective during system prototyping on multi-FPGA platform, International Journal of Reconfigurable Computing, 2013, (9-9), Online publication date: 1-Jan-2013.
  260. ACM
    Wu N, Zhou M and Hu G (2013). One-Step Look-Ahead Maximally Permissive Deadlock Control of AMS by Using Petri Nets, ACM Transactions on Embedded Computing Systems, 12:1, (1-23), Online publication date: 1-Jan-2013.
  261. Chen H, Lin J, Hu H and Jou S (2013). STBC-OFDM downlink baseband receiver for mobile WMAN, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 21:1, (43-54), Online publication date: 1-Jan-2013.
  262. Ovaska K, Lyly L, Sahu B, Janne O and Hautaniemi S (2013). Genomic Region Operation Kit for Flexible Processing of Deep Sequencing Data, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:1, (200-206), Online publication date: 1-Jan-2013.
  263. Leno I, Saravana Sankar S and Ponnambalam S Multi objective integrated layout design problem Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing, (500-508)
  264. Takada M, Inada H, Nakazawa K, Tani S, Iwata M, Sugimoto Y and Nagata S (2012). A High-Speed Drug Interaction Search System for Ease of Use in the Clinical Environment, Journal of Medical Systems, 36:6, (3533-3541), Online publication date: 1-Dec-2012.
  265. ACM
    Nokhbeh Zaeem R and Khurshid S Test input generation using dynamic programming Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, (1-11)
  266. Kornev D (2012). On numerical solution of positional differential games with nonterminal payoff, Automation and Remote Control, 73:11, (1808-1821), Online publication date: 1-Nov-2012.
  267. Hashemikhabir S, Ayaz E, Kavurucu Y, Can T and Kahveci T (2012). Large-Scale Signaling Network Reconstruction, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:6, (1696-1708), Online publication date: 1-Nov-2012.
  268. ACM
    Lappas T and Terzi E Daily-deal selection for revenue maximization Proceedings of the 21st ACM international conference on Information and knowledge management, (565-574)
  269. ACM
    Vatavu R, Anthony L and Wobbrock J Gestures as point clouds Proceedings of the 14th ACM international conference on Multimodal interaction, (273-280)
  270. ACM
    Štrbac-Savić S and Tomašević M Comparative performance evaluation of the AVL and red-black trees Proceedings of the Fifth Balkan Conference in Informatics, (14-19)
  271. Nonner T Polynomial-Time approximation schemes for shortest path with alternatives Proceedings of the 20th Annual European conference on Algorithms, (755-765)
  272. ACM
    Baswana S, Khurana S and Sarkar S (2012). Fully dynamic randomized algorithms for graph spanners, ACM Transactions on Algorithms, 8:4, (1-51), Online publication date: 1-Sep-2012.
  273. Ozgul F and Erdem Z Detecting Criminal Networks Using Social Similarity Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), (581-585)
  274. ACM
    Summa B, Tierny J and Pascucci V (2012). Panorama weaving, ACM Transactions on Graphics, 31:4, (1-11), Online publication date: 5-Aug-2012.
  275. Xu W, He S, Song R and Chaudhry S (2012). Finding the K shortest paths in a schedule-based transit network, Computers and Operations Research, 39:8, (1812-1826), Online publication date: 1-Aug-2012.
  276. Pradhan P and Panda G (2012). Connectivity constrained wireless sensor deployment using multiobjective evolutionary algorithms and fuzzy decision making, Ad Hoc Networks, 10:6, (1134-1145), Online publication date: 1-Aug-2012.
  277. ACM
    Burjorjee K Explaining adaptation in genetic algorithms with uniform crossover Proceedings of the 14th annual conference companion on Genetic and evolutionary computation, (1461-1462)
  278. ACM
    Green O, McColl R and Bader D GPU merge path Proceedings of the 26th ACM international conference on Supercomputing, (331-340)
  279. Chatterjee K and Velner Y Mean-Payoff Pushdown Games Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science, (195-204)
  280. ACM
    Wang T, Srivatsa M and Liu L Fine-grained access control of personal data Proceedings of the 17th ACM symposium on Access Control Models and Technologies, (145-156)
  281. Goel S, Pennock D, Mahdian M and Reeves D TrustBets Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1319-1320)
  282. Obraztsova S and Elkind E Optimal manipulation of voting rules Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (619-626)
  283. Szczepański P, Michalak T and Rahwan T A new approach to betweenness centrality based on the Shapley Value Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (239-246)
  284. Keidar M and Kaminka G Robot exploration with fast frontier detection Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (113-120)
  285. Staats M, Gay G and Heimdahl M Automated oracle creation support, or: how I learned to stop worrying about fault propagation and love mutation testing Proceedings of the 34th International Conference on Software Engineering, (870-880)
  286. ACM
    Martínez-Prieto M, Fernández J and Cánovas R (2012). Querying RDF dictionaries in compressed space, ACM SIGAPP Applied Computing Review, 12:2, (64-77), Online publication date: 1-Jun-2012.
  287. Pomeranz I (2012). Gradual diagnostic test generation and observation point insertion based on the structural distance between indistinguished fault pairs, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 20:6, (1026-1035), Online publication date: 1-Jun-2012.
  288. Brendel P, Dłotko P, Mrozek M and Żelazna N Homology computations via acyclic subspace Proceedings of the 4th international conference on Computational Topology in Image Context, (117-127)
  289. ACM
    Shekhar S, Gunturi V, Evans M and Yang K Spatial big-data challenges intersecting mobility and cloud computing Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access, (1-6)
  290. ACM
    Jin R, Ruan N, Xiang Y and Lee V A highway-centric labeling approach for answering distance queries on large sparse graphs Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, (445-456)
  291. Zoppis I, Gianazza E, Borsani M, Chinello C, Mainini V, Galbusera C, Ferrarese C, Galimberti G, Sorbi S, Borroni B, Magni F, Antoniotti M and Mauri G (2012). Mutual Information Optimization for Mass Spectra Data Alignment, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:3, (934-939), Online publication date: 1-May-2012.
  292. Meeks K and Scott A (2012). The complexity of flood-filling games on graphs, Discrete Applied Mathematics, 160:7-8, (959-969), Online publication date: 1-May-2012.
  293. Asahiro Y, Jansson J, Miyano E and Ono H Graph orientations optimizing the number of light or heavy vertices Proceedings of the Second international conference on Combinatorial Optimization, (332-343)
  294. ACM
    Ma S, Cao Y, Huai J and Wo T Distributed graph pattern matching Proceedings of the 21st international conference on World Wide Web, (949-958)
  295. Delling D and Nannicini G (2012). Core Routing on Dynamic Time-Dependent Road Networks, INFORMS Journal on Computing, 24:2, (187-201), Online publication date: 1-Apr-2012.
  296. Raskin M (2012). Toom's partial order is transitive, Problems of Information Transmission, 48:2, (154-172), Online publication date: 1-Apr-2012.
  297. ACM
    Zhang Z, Yu J, Qin L, Zhu Q and Zhou X I/O cost minimization Proceedings of the 15th International Conference on Extending Database Technology, (468-479)
  298. ACM
    Su Z, Tung A and Zhang Z Supporting top-K item exchange recommendations in large online communities Proceedings of the 15th International Conference on Extending Database Technology, (97-108)
  299. Higa D and Stefanes M A coarse-grained parallel algorithm for the matrix chain order problem Proceedings of the 2012 Symposium on High Performance Computing, (1-8)
  300. ACM
    Martínez-Prieto M, Fernández J and Cánovas R Compression of RDF dictionaries Proceedings of the 27th Annual ACM Symposium on Applied Computing, (340-347)
  301. ACM
    Cunha T, de Souza F, de A. Araújo A and Pappa G Rushes video summarization based on spatio-temporal features Proceedings of the 27th Annual ACM Symposium on Applied Computing, (45-50)
  302. Liu S, Lee C and Chen H Agglomerative-based flip-flop merging with signal wirelength optimization Proceedings of the Conference on Design, Automation and Test in Europe, (1391-1396)
  303. Klimoš M, Larsen K, Štefaňák F and Thaarup J Nash equilibria in concurrent priced games Proceedings of the 6th international conference on Language and Automata Theory and Applications, (363-376)
  304. ACM
    St. John T, Dennis J and Gao G Massively parallel breadth first search using a tree-structured memory model Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores, (115-123)
  305. ACM
    Myung J and Lee S Matrix chain multiplication via multi-way join algorithms in MapReduce Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, (1-5)
  306. Zarifzadeh S, Yazdani N and Nayyeri A (2012). Energy-efficient topology control in wireless ad hoc networks with selfish nodes, Computer Networks: The International Journal of Computer and Telecommunications Networking, 56:2, (902-914), Online publication date: 1-Feb-2012.
  307. Ghada K, Li J and Ji Y (2012). Cross-layer design for topology control and routing in MANETs, Wireless Communications & Mobile Computing, 12:3, (257-267), Online publication date: 1-Feb-2012.
  308. Steinbrecher J and Shang W On supernode transformations and multithreading for the longest common subsequence problem Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127, (3-12)
  309. ACM
    Frigo M, Leiserson C, Prokop H and Ramachandran S (2012). Cache-Oblivious Algorithms, ACM Transactions on Algorithms, 8:1, (1-22), Online publication date: 1-Jan-2012.
  310. ACM
    Verbeek F and Schmaltz J (2012). Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures, ACM Transactions on Design Automation of Electronic Systems, 17:1, (1-28), Online publication date: 1-Jan-2012.
  311. Leno I, Sankar S, Raj M and Ponnambalam S Bi-criteria optimization in integrated layout design of cellular manufacturing systems using a genetic algorithm Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I, (323-331)
  312. Ahn J, Sung C and Kim T A binary partition-based matching algorithm for data distribution management Proceedings of the Winter Simulation Conference, (2728-2739)
  313. Leea H and Shimb J (2011). Indexing method for transitive relationships of product information, Web Intelligence and Agent Systems, 9:4, (351-362), Online publication date: 1-Dec-2011.
  314. Ma S, Cao Y, Fan W, Huai J and Wo T (2011). Capturing topology in graph pattern matching, Proceedings of the VLDB Endowment, 5:4, (310-321), Online publication date: 1-Dec-2011.
  315. Ursani Z, Essam D, Cornforth D and Stocker R (2011). Localized genetic algorithm for vehicle routing problem with time windows, Applied Soft Computing, 11:8, (5375-5390), Online publication date: 1-Dec-2011.
  316. Saracchini R, Stolfi J, Leitão H, Atkinson G and Smith M Multi-scale integration of slope data on an irregular mesh Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part I, (109-120)
  317. ACM
    Buluç A and Madduri K Parallel breadth-first search on distributed memory systems Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, (1-12)
  318. ACM
    Park C, Sen K, Hargrove P and Iancu C Efficient data race detection for distributed memory parallel programs Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, (1-12)
  319. Li B, Chen N and Schlichtmann U Fast statistical timing analysis for circuits with post-silicon tunable clock buffers Proceedings of the International Conference on Computer-Aided Design, (111-117)
  320. Yu B, Yuan K, Zhang B, Ding D and Pan D Layout decomposition for triple patterning lithography Proceedings of the International Conference on Computer-Aided Design, (1-8)
  321. Khalek S, Narayanan V and Khurshid S Mixed constraints for test input generation - An initial exploration Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering, (548-551)
  322. ACM
    Yao B, Tang M and Li F Multi-approximate-keyword routing in GIS data Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (201-210)
  323. Siddiqui J and Khurshid S Symbolic execution of alloy models Proceedings of the 13th international conference on Formal methods and software engineering, (340-355)
  324. ACM
    Cao H, Candan K and Sapino M Skynets Proceedings of the 20th ACM international conference on Information and knowledge management, (1775-1784)
  325. ACM
    Yang J, Zhang S and Jin W DELTA Proceedings of the 20th ACM international conference on Information and knowledge management, (1765-1774)
  326. ACM
    Pu Y, Bodik R and Srivastava S Synthesis of first-order dynamic programming algorithms Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, (83-98)
  327. ACM
    Laoutaris N, Sirivianos M, Yang X and Rodriguez P (2011). Inter-datacenter bulk transfers with netstitcher, ACM SIGCOMM Computer Communication Review, 41:4, (74-85), Online publication date: 22-Oct-2011.
  328. ACM
    Monteiro P, Monteiro M and Pingali K Parallelizing irregular algorithms Proceedings of the 18th Conference on Pattern Languages of Programs, (1-18)
  329. ACM
    Pu Y, Bodik R and Srivastava S (2011). Synthesis of first-order dynamic programming algorithms, ACM SIGPLAN Notices, 46:10, (83-98), Online publication date: 18-Oct-2011.
  330. Cortes C and Mohri M Domain adaptation in regression Proceedings of the 22nd international conference on Algorithmic learning theory, (308-323)
  331. Medini S, Galinier P, Penta M, Guéhéneuc Y and Antoniol G A fast algorithm to locate concepts in execution traces Proceedings of the Third international conference on Search based software engineering, (252-266)
  332. ACM
    Hassaan M, Burtscher M and Pingali K (2011). Ordered vs. unordered, ACM SIGPLAN Notices, 46:8, (3-12), Online publication date: 7-Sep-2011.
  333. Zhao M, Li J and Yang Y Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks Proceedings of the 23rd International Teletraffic Congress, (238-245)
  334. ACM
    Delorimier M, Kapre N, Mehta N and Dehon A (2011). Spatial hardware implementation for sparse graph algorithms in GraphStep, ACM Transactions on Autonomous and Adaptive Systems, 6:3, (1-20), Online publication date: 1-Sep-2011.
  335. ACM
    Pritchard D and Thurimella R (2011). Fast computation of small cuts via cycle space sampling, ACM Transactions on Algorithms, 7:4, (1-30), Online publication date: 1-Sep-2011.
  336. ACM
    Thompson H and Chadhuri P (2011). An alternative visual analysis of the build heap algorithm, ACM Inroads, 2:3, (31-32), Online publication date: 31-Aug-2011.
  337. ACM
    Laoutaris N, Sirivianos M, Yang X and Rodriguez P Inter-datacenter bulk transfers with netstitcher Proceedings of the ACM SIGCOMM 2011 conference, (74-85)
  338. Vikas N Algorithms for partition of some class of graphs under compaction Proceedings of the 17th annual international conference on Computing and combinatorics, (319-330)
  339. Lê D (2011). On Three Alternative Characterizations of Combined Traces, Fundamenta Informaticae, 113:3-4, (265-293), Online publication date: 1-Aug-2011.
  340. Mo D and Huang S (2011). Feature selection based on inference correlation, Intelligent Data Analysis, 15:3, (375-398), Online publication date: 1-Aug-2011.
  341. ACM
    Sauthoff G, Janssen S and Giegerich R Bellman's GAP Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming, (29-40)
  342. Yu S and Gao Y State complexity research and approximation Proceedings of the 15th international conference on Developments in language theory, (46-57)
  343. Marinescu D, Băicoianu A and Simian D The determination of the guillotine restrictions for a rectangular three dimensional bin packing pattern Proceedings of the 15th WSEAS international conference on Computers, (491-496)
  344. Cussens J Bayesian network learning with cutting planes Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (153-160)
  345. ACM
    Haigh K and Yaman F (2011). RECYCLE, ACM Transactions on Intelligent Systems and Technology, 2:4, (1-32), Online publication date: 1-Jul-2011.
  346. MartíN J, Mayor G and Valero O (2011). On aggregation of normed structures, Mathematical and Computer Modelling: An International Journal, 54:1-2, (815-827), Online publication date: 1-Jul-2011.
  347. Brešar B, Kardoš F, Katrenič J and Semanišin G (2011). Minimum k-path vertex cover, Discrete Applied Mathematics, 159:12, (1189-1195), Online publication date: 1-Jul-2011.
  348. Ferragina P On the weak prefix-search problem Proceedings of the 22nd annual conference on Combinatorial pattern matching, (261-272)
  349. Nenkova A, Maskey S and Liu Y Automatic summarization Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011, (1-86)
  350. ACM
    Xu Y, Kostamaa P, Qi Y, Wen J and Zhao K A Hadoop based distributed loading approach to parallel data warehouses Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, (1091-1100)
  351. ACM
    Fan W, Li J, Ma S, Tang N and Yu W Interaction between record matching and data repairing Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, (469-480)
  352. ACM
    Kim D and Rinard M Verification of semantic commutativity conditions and inverse operations on linked data structures Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (528-541)
  353. ACM
    Kim D and Rinard M (2011). Verification of semantic commutativity conditions and inverse operations on linked data structures, ACM SIGPLAN Notices, 46:6, (528-541), Online publication date: 4-Jun-2011.
  354. Marinescu D and Băicoianu A (2011). A test of the guillotine restrictions determination for a rectangular three dimensional bin packing problem, WSEAS Transactions on Information Science and Applications, 8:6, (253-263), Online publication date: 1-Jun-2011.
  355. Caceres A, Daley S, DeJesus J, Hintze M, Moore D and John K (2011). Walks in phylogenetic treespace, Information Processing Letters, 111:12, (600-604), Online publication date: 1-Jun-2011.
  356. Cobano J, Conde R, Alejo D, Viguria A and Ollero A Conflict detection and resolution algorithm for en-route conflicts in dense non-segregated aerial traffic Proceedings of the 1st International Conference on Application and Theory of Automation in Command and Control Systems, (15-22)
  357. Papa J, Pereira C, de Albuquerque V, Silva C, Falcão A and Tavares J Precipitates segmentation from scanning electron microscope images through machine learning techniques Proceedings of the 14th international conference on Combinatorial image analysis, (456-468)
  358. ACM
    Yu F, Alkhalaf M and Bultan T Patching vulnerabilities with sanitization synthesis Proceedings of the 33rd International Conference on Software Engineering, (251-260)
  359. ACM
    Bilardi G, Ekanadham K and Pattnaik P Efficient stack distance computation for priority replacement policies Proceedings of the 8th ACM International Conference on Computing Frontiers, (1-10)
  360. ACM
    Yan J and Chen Z New optimal layer assignment for bus-oriented escape routing Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI, (205-210)
  361. Zou L, Mo J, Chen L, Özsu M and Zhao D (2011). gStore, Proceedings of the VLDB Endowment, 4:8, (482-493), Online publication date: 1-May-2011.
  362. Ao N, Zhang F, Wu D, Stones D, Wang G, Liu X, Liu J and Lin S (2011). Efficient parallel lists intersection and index compression algorithms using graphics processing units, Proceedings of the VLDB Endowment, 4:8, (470-481), Online publication date: 1-May-2011.
  363. Kuliamin V and Petukhov A (2011). A survey of methods for constructing covering arrays, Programming and Computing Software, 37:3, (121-146), Online publication date: 1-May-2011.
  364. Araújo W, Ekel P, Filho R, Kokshenev I and Schuffner H Multicriteria decision making for reactive power compensation in distribution systems Proceedings of the 5th European conference on European computing conference, (56-61)
  365. Liu X, Wang Y, Li Y and Shi B Identifying topic experts and topic communities in the blogspace Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I, (68-77)
  366. Couprie M Hierarchic euclidean skeletons in cubical complexes Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery, (141-152)
  367. Czekster R, Fernandes P, Sales A and Webber T Stationary solution approximation using a memory-efficient perfect sampling technique Proceedings of the 44th Annual Simulation Symposium, (119-126)
  368. Pantelidou A and Ephremides A (2011). Scheduling in Wireless Networks, Foundations and Trends® in Networking, 4:4, (421-511), Online publication date: 1-Apr-2011.
  369. ACM
    Ykman-Couvreur C, Nollet V, Catthoor F and Corporaal H (2011). Fast multidimension multichoice knapsack heuristic for MP-SoC runtime management, ACM Transactions on Embedded Computing Systems, 10:3, (1-16), Online publication date: 1-Apr-2011.
  370. ACM
    Aguilera M, Keidar I, Malkhi D and Shraer A (2011). Dynamic atomic storage without consensus, Journal of the ACM, 58:2, (1-32), Online publication date: 1-Apr-2011.
  371. Lezcano L, Sicilia M and Rodríguez-Solano C (2011). Integrating reasoning and clinical archetypes using OWL ontologies and SWRL rules, Journal of Biomedical Informatics, 44:2, (343-353), Online publication date: 1-Apr-2011.
  372. ACM
    Yan J and Chen Z Obstacle-aware length-matching bus routing Proceedings of the 2011 international symposium on Physical design, (61-68)
  373. Colón M and Sankaranarayanan S Generalizing the template polyhedral domain Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software, (176-195)
  374. ACM
    Giegerich R and Sauthoff G Yield grammar analysis in the Bellman's GAP compiler Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications, (1-8)
  375. Das D, Shebaita A, Zhou H, Ismail Y and Killpack K (2011). FA-STAC, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 19:3, (443-456), Online publication date: 1-Mar-2011.
  376. ACM
    Hassaan M, Burtscher M and Pingali K Ordered vs. unordered Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, (3-12)
  377. ACM
    Kang U, Tsourakakis C, Appel A, Faloutsos C and Leskovec J (2011). HADI, ACM Transactions on Knowledge Discovery from Data, 5:2, (1-24), Online publication date: 1-Feb-2011.
  378. Munier Kordon A (2011). A graph-based analysis of the cyclic scheduling problem with time constraints, Journal of Scheduling, 14:1, (103-117), Online publication date: 1-Feb-2011.
  379. Drmota M and Szpankowski W A master theorem for discrete divide and conquer recurrences Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (342-361)
  380. ACM
    Jansen T and Zarges C Analysis of evolutionary algorithms Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, (1-14)
  381. Krepska E, Kielmann T, Fokkink W and Bal H A high-level framework for distributed processing of large-scale graphs Proceedings of the 12th international conference on Distributed computing and networking, (155-166)
  382. Lattari L, Montenegro A, Conci A, Clua E, Mota V, Vieira M and Lizarraga G (2011). Using graph cuts in GPUs for color based human skin segmentation, Integrated Computer-Aided Engineering, 18:1, (41-59), Online publication date: 1-Jan-2011.
  383. Wang J, Kuang S and Liang S (2011). High-accuracy fixed-width modified booth multipliers for lossy applications, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 19:1, (52-60), Online publication date: 1-Jan-2011.
  384. Madaras M, Ďurikovič R, Ágošton T and Nishita T Skeleton extraction from a mesh for easy skinning animation Proceedings of the 13th International Conference on Humans and Computers, (37-41)
  385. Cohen R, Grebla G and Katzir L (2010). Cross-layer hybrid FEC/ARQ reliable multicast with adaptive modulation and coding in broadband wireless networks, IEEE/ACM Transactions on Networking, 18:6, (1908-1920), Online publication date: 1-Dec-2010.
  386. Mak T, Lam K, Ng H, Rachmuth G and Poon C (2010). A CMOS current-mode dynamic programming circuit, IEEE Transactions on Circuits and Systems Part I: Regular Papers, 57:12, (3112-3123), Online publication date: 1-Dec-2010.
  387. Rahman M, Ranjan R and Buyya R (2010). Reputation-based dependable scheduling of workflow applications in Peer-to-Peer Grids, Computer Networks: The International Journal of Computer and Telecommunications Networking, 54:18, (3341-3359), Online publication date: 1-Dec-2010.
  388. Malik T, Wang X, Little P, Chaudhary A and Thakar A A dynamic data middleware cache for rapidly-growing scientific repositories Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware, (64-84)
  389. Sampath R, Sundar H and Veerapaneni S Parallel Fast Gauss Transform Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, (1-10)
  390. Luna J, Revoredo K and Cozman F Learning sentences and assessments in probabilistic description logics Proceedings of the 6th International Conference on Uncertainty Reasoning for the Semantic Web - Volume 654, (85-96)
  391. Li B, Chen N and Schlichtmann U Fast statistical timing analysis of latch-controlled circuits for arbitrary clock periods Proceedings of the International Conference on Computer-Aided Design, (524-531)
  392. Sarshar N and Wu X (2010). On L∞ properties of multiresolution scalar quantizers, IEEE Transactions on Information Theory, 56:11, (5805-5810), Online publication date: 1-Nov-2010.
  393. Grigorieva E, Herings P, Müller R and Vermeulen D (2010). On the Fastest Vickrey Algorithm, Algorithmica, 58:3, (566-590), Online publication date: 1-Nov-2010.
  394. ACM
    Zhao G and Yuan J Mining and cropping common objects from images Proceedings of the 18th ACM international conference on Multimedia, (975-978)
  395. ACM
    Shrestha P, de With P, Weda H, Barbieri M and Aarts E Automatic mashup generation from multiple-camera concert recordings Proceedings of the 18th ACM international conference on Multimedia, (541-550)
  396. ACM
    Blagojević F, Hargrove P, Iancu C and Yelick K Hybrid PGAS runtime support for multicore nodes Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model, (1-10)
  397. Nicolau A and Kejariwal A How many threads to spawn during program multithreading? Proceedings of the 23rd international conference on Languages and compilers for parallel computing, (166-183)
  398. Marinescu D and Băicoianu A (2010). An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern, WSEAS Transactions on Computers, 9:10, (1160-1169), Online publication date: 1-Oct-2010.
  399. ACM
    Bistarelli S, Montanari U, Rossi F and Santini F (2010). Unicast and multicast QoS routing with soft-constraint logic programming, ACM Transactions on Computational Logic, 12:1, (1-48), Online publication date: 1-Oct-2010.
  400. Marques A, González A, Rojo-Álvarez J, Requena-Carrión J and Ramos J (2010). Optimizing average performance of OFDM systems using limited-rate feedback, IEEE Transactions on Wireless Communications, 9:10, (3130-3143), Online publication date: 1-Oct-2010.
  401. ACM
    Hassaan M, Burtscher M and Pingali K Ordered and unordered algorithms for parallel breadth first search Proceedings of the 19th international conference on Parallel architectures and compilation techniques, (539-540)
  402. Fan W, Li J, Ma S, Wang H and Wu Y (2010). Graph homomorphism revisited for graph matching, Proceedings of the VLDB Endowment, 3:1-2, (1161-1172), Online publication date: 1-Sep-2010.
  403. Yildirim H, Chaoji V and Zaki M (2010). GRAIL, Proceedings of the VLDB Endowment, 3:1-2, (276-284), Online publication date: 1-Sep-2010.
  404. Neumann T and Weikum G (2010). x-RDF-3X, Proceedings of the VLDB Endowment, 3:1-2, (256-263), Online publication date: 1-Sep-2010.
  405. Basu K and Mishra P (2010). Test data compression using efficient bitmask and dictionary selection methods, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 18:9, (1277-1286), Online publication date: 1-Sep-2010.
  406. Guerriero F and Talarico L (2010). A solution approach to find the critical path in a time-constrained activity network, Computers and Operations Research, 37:9, (1557-1569), Online publication date: 1-Sep-2010.
  407. Saraswat M Efficiently finding similar objects on ontologies using earth mover's distance Proceedings of the 21st international conference on Database and expert systems applications: Part II, (360-374)
  408. Lei Y, Xu Y, Zhang S, Wang S and Ding Z Fast ISOMAP based on minimum set coverage Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing, (173-179)
  409. Pan J, Van Woudenberg J, Den Hartog J and Witteman M Improving DPA by peak distribution analysis Proceedings of the 17th international conference on Selected areas in cryptography, (241-261)
  410. Bonet B and Helmert M Strengthening Landmark Heuristics via Hitting Sets Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (329-334)
  411. Ong L and Motani M (2010). Optimal routing for decode-forward in cooperative wireless networks, IEEE Transactions on Communications, 58:8, (2345-2355), Online publication date: 1-Aug-2010.
  412. Rosman G, Bronstein M, Bronstein A and Kimmel R (2010). Nonlinear Dimensionality Reduction by Topologically Constrained Isometric Embedding, International Journal of Computer Vision, 89:1, (56-68), Online publication date: 1-Aug-2010.
  413. Marinescu D and Băicoianu A The determination of the guillotine restrictions for a rectangular cutting-stock pattern Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I, (121-126)
  414. Berman P, Karpinski M and Lingas A Exact and approximation algorithms for geometric and capacitated set cover problems Proceedings of the 16th annual international conference on Computing and combinatorics, (226-234)
  415. Chatterjee S and Kishinevsky M Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics Proceedings of the 22nd international conference on Computer Aided Verification, (321-338)
  416. Navigli R and Velardi P Learning word-class lattices for definition and hypernym extraction Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, (1318-1327)
  417. Krüger B, Tautges J, Weber A and Zinke A Fast local and global similarity searches in large motion capture databases Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, (1-10)
  418. Azar Y, Feige U and Glasner D (2010). A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Algorithmica, 57:3, (517-537), Online publication date: 1-Jul-2010.
  419. Cominetti R, Correa J, Rothvoß T and Martín J (2010). Optimal Selection of Customers for a Last-Minute Offer, Operations Research, 58:4-Part-1, (878-888), Online publication date: 1-Jul-2010.
  420. Manea F, Martín-Vide C and Mitrana V Hairpin lengthening Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (296-306)
  421. Yao C, Wang B, Chan B, Yong J and Paul J Multi-image based photon tracing for interactive global illumination of dynamic scenes Proceedings of the 21st Eurographics conference on Rendering, (1315-1324)
  422. ACM
    Park K, Lin Y, Metsis V, Le Z and Makedon F Abnormal human behavioral pattern detection in assisted living environments Proceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments, (1-8)
  423. Gate J and Stewart I Frameworks for logically classifying polynomial-time optimisation problems Proceedings of the 5th international conference on Computer Science: theory and Applications, (120-131)
  424. Régin J, Rousseau L, Rueher M and van Hoeve W The weighted spanning tree constraint revisited Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (287-291)
  425. ACM
    Wang B, Zhu Y and Deng Y Distributed time, conservative parallel logic simulation on GPUs Proceedings of the 47th Design Automation Conference, (761-766)
  426. ACM
    Fraigniaud P and Pelc A Delays induce an exponential memory gap for rendezvous in trees Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, (224-232)
  427. ACM
    Zhang Z, Hadjieleftheriou M, Ooi B and Srivastava D Bed-tree Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (915-926)
  428. ACM
    Kanne C and Moerkotte G Histograms reloaded Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (663-674)
  429. ACM
    Jin R, Hong H, Wang H, Ruan N and Xiang Y Computing label-constraint reachability in graph databases Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (123-134)
  430. Lacoursière C, Linde M and Sabelström O Direct sparse factorization of blocked saddle point matrices Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2, (324-335)
  431. Badreddine A and Amor N A new approach to construct optimal bow tie diagrams for risk analysis Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II, (595-604)
  432. Thakoor N, Gao J and Devarajan V (2010). Multibody structure-and-motion segmentation by branch-and-bound model selection, IEEE Transactions on Image Processing, 19:6, (1393-1402), Online publication date: 1-Jun-2010.
  433. Hunold S Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, (253-262)
  434. Desprez F and Suter F A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, (243-252)
  435. Hsu C and Chen T (2010). Performance- and economisation-oriented scheduling techniques for managing applications with QoS demands in grids, International Journal of Ad Hoc and Ubiquitous Computing, 5:4, (219-226), Online publication date: 1-May-2010.
  436. Lev B (2010). Book Reviews, Interfaces, 40:3, (246-249), Online publication date: 1-May-2010.
  437. ACM
    Méndez-Lojo M, Nguyen D, Prountzos D, Sui X, Hassaan M, Kulkarni M, Burtscher M and Pingali K (2010). Structure-driven optimizations for amorphous data-parallel programs, ACM SIGPLAN Notices, 45:5, (3-14), Online publication date: 1-May-2010.
  438. ACM
    Schaefer C, Pankratius V and Tichy W Engineering parallel applications with tunable architectures Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1, (405-414)
  439. ACM
    Albers S (2010). Energy-efficient algorithms, Communications of the ACM, 53:5, (86-96), Online publication date: 1-May-2010.
  440. Ruiz-Torrubiano R and Suárez A (2010). Hybrid approaches and dimensionality reduction for portfolio selection with cardinality constraints, IEEE Computational Intelligence Magazine, 5:2, (92-107), Online publication date: 1-May-2010.
  441. Fraigniaud P, Ilcinkas D and Pelc A (2010). Communication algorithms with advice, Journal of Computer and System Sciences, 76:3-4, (222-232), Online publication date: 1-May-2010.
  442. Mors A, Yadati C, Witteveen C and Zhang Y (2010). Coordination by design and the price of autonomy, Autonomous Agents and Multi-Agent Systems, 20:3, (308-341), Online publication date: 1-May-2010.
  443. ACM
    Bhatia S, Mitra P and Giles C Finding algorithms in scientific articles Proceedings of the 19th international conference on World wide web, (1061-1062)
  444. ACM
    Kandhalu A, Lakshmanan K and Rajkumar R U-connect Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks, (350-361)
  445. ACM
    Bestavros A, Kfoury A, Lapets A and Ocean M Safe compositional network sketches Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, (231-241)
  446. Tonella P and Di Francescomarino C (2010). Supporting Ontology-Based Semantic Annotation of Business Processes with Automated Suggestions, International Journal of Information System Modeling and Design, 1:2, (59-84), Online publication date: 1-Apr-2010.
  447. Fusco G and Gupta H (2010). Ɛ-net approach to sensor k-coverage, EURASIP Journal on Wireless Communications and Networking, 2010, (1-12), Online publication date: 1-Apr-2010.
  448. Dieudonné Y, Labbani-Igbida O and Petit F (2010). Deterministic robot-network localization is hard, IEEE Transactions on Robotics, 26:2, (331-339), Online publication date: 1-Apr-2010.
  449. ACM
    Monteiro P and Monteiro M A pattern language for parallelizing irregular algorithms Proceedings of the 2010 Workshop on Parallel Programming Patterns, (1-14)
  450. ACM
    Li Y, Tian Y, Yang J, Duan L and Gao W Video retargeting with multi-scale trajectory optimization Proceedings of the international conference on Multimedia information retrieval, (45-54)
  451. ACM
    Kundu A and Bertino E How to authenticate graphs without leaking Proceedings of the 13th International Conference on Extending Database Technology, (609-620)
  452. ACM
    Xiao X, Yi K and Tao Y The hardness and approximation algorithms for l-diversity Proceedings of the 13th International Conference on Extending Database Technology, (135-146)
  453. ACM
    Pelley S, Meisner D, Zandevakili P, Wenisch T and Underwood J Power routing Proceedings of the fifteenth International Conference on Architectural support for programming languages and operating systems, (231-242)
  454. Verbeek F and Schmaltz J Formal specification of networks-on-chips Proceedings of the Conference on Design, Automation and Test in Europe, (1701-1706)
  455. Yu H A memory- and time-efficient on-chip TCAM minimizer for IP lookup Proceedings of the Conference on Design, Automation and Test in Europe, (926-931)
  456. ACM
    Pelley S, Meisner D, Zandevakili P, Wenisch T and Underwood J (2010). Power routing, ACM SIGPLAN Notices, 45:3, (231-242), Online publication date: 5-Mar-2010.
  457. ACM
    Pelley S, Meisner D, Zandevakili P, Wenisch T and Underwood J (2010). Power routing, ACM SIGARCH Computer Architecture News, 38:1, (231-242), Online publication date: 5-Mar-2010.
  458. Hsu W, Chiang Y and Wu J (2010). Integrating weighted LCS and SVM for 3D handwriting recognition on handheld devices using accelerometers, WSEAS Transactions on Computers, 9:3, (235-251), Online publication date: 1-Mar-2010.
  459. Baran T, Wei D and Oppenheim A (2010). Linear programming algorithms for sparse filter design, IEEE Transactions on Signal Processing, 58:3, (1605-1617), Online publication date: 1-Mar-2010.
  460. ACM
    You Q, Fang S and Ebright P Iterative visual clustering for unstructured text mining Proceedings of the International Symposium on Biocomputing, (1-8)
  461. Pantazopoulos P, Stavrakakis I, Passarella A and Conti M Efficient social-aware content placement in opportunistic networks Proceedings of the 7th international conference on Wireless on-demand network systems and services, (17-24)
  462. Crochemore M and Hancart C Pattern matching in strings Algorithms and theory of computation handbook, (13-13)
  463. Khuller S and Raghavachari B Advanced combinatorial algorithms Algorithms and theory of computation handbook, (8-8)
  464. Khuller S and Raghavachari B Basic graph algorithms Algorithms and theory of computation handbook, (7-7)
  465. Italiano G and Raman R Topics in data structures Algorithms and theory of computation handbook, (5-5)
  466. Tamassia R and Cantrill B Basic data structures Algorithms and theory of computation handbook, (4-4)
  467. Estivill-Castro V Sorting and order statistics Algorithms and theory of computation handbook, (3-3)
  468. Turaga S, Murray J, Jain V, Roth F, Helmstaedter M, Briggman K, Denk W and Seung H (2010). Convolutional networks can learn to generate affinity graphs for image segmentation, Neural Computation, 22:2, (511-538), Online publication date: 1-Feb-2010.
  469. Lin C, Hsu F and Lin W (2010). Recognizing human actions using NWFE-based histogram vectors, EURASIP Journal on Advances in Signal Processing, 2010, (1-10), Online publication date: 1-Feb-2010.
  470. ACM
    Lysyanskaya A, Tamassia R and Triandopoulos N (2010). Authenticated error-correcting codes with applications to multicast authentication, ACM Transactions on Information and System Security, 13:2, (1-34), Online publication date: 1-Feb-2010.
  471. Baumann M, Léonard S, Croft E and Little J (2010). Path planning for improved visibility using a probabilistic road map, IEEE Transactions on Robotics, 26:1, (195-200), Online publication date: 1-Feb-2010.
  472. Ila V, Porta J and Andrade-Cetto J (2010). Information-based compact pose SLAM, IEEE Transactions on Robotics, 26:1, (78-93), Online publication date: 1-Feb-2010.
  473. Aloupis G, Cardinal J, Collette S, Hurtado F, Langerman S, O'Rourke J and Palop B (2010). Highway hull revisited, Computational Geometry: Theory and Applications, 43:2, (115-130), Online publication date: 1-Feb-2010.
  474. Yang S, Wang D, Chai T and Kendall G (2010). An improved constraint satisfaction adaptive neural network for job-shop scheduling, Journal of Scheduling, 13:1, (17-38), Online publication date: 1-Feb-2010.
  475. ACM
    Pushpa S, Easwarakumar K, Elias S and Maamar Z Referral based expertise search system in a time evolving social network Proceedings of the Third Annual ACM Bangalore Conference, (1-8)
  476. Yan J, Jhong M and Chen Z Obstacle-aware longest path using rectangular pattern detouring in routing grids Proceedings of the 2010 Asia and South Pacific Design Automation Conference, (287-292)
  477. ACM
    Harris W, Sankaranarayanan S, Ivančić F and Gupta A Program analysis via satisfiability modulo path programs Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (71-82)
  478. ACM
    Chaudhuri S, Gulwani S and Lublinerman R Continuity analysis of programs Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (57-70)
  479. Wu T, Kwong K, Shen C, Michie C and Andonovic I The impact of physical conditions on network connectivity in wireless sensor network Proceedings of the 7th IEEE conference on Consumer communications and networking conference, (1139-1140)
  480. ACM
    Méndez-Lojo M, Nguyen D, Prountzos D, Sui X, Hassaan M, Kulkarni M, Burtscher M and Pingali K Structure-driven optimizations for amorphous data-parallel programs Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (3-14)
  481. ACM
    Harris W, Sankaranarayanan S, Ivančić F and Gupta A (2010). Program analysis via satisfiability modulo path programs, ACM SIGPLAN Notices, 45:1, (71-82), Online publication date: 2-Jan-2010.
  482. ACM
    Chaudhuri S, Gulwani S and Lublinerman R (2010). Continuity analysis of programs, ACM SIGPLAN Notices, 45:1, (57-70), Online publication date: 2-Jan-2010.
  483. Woeginger G (2010). An algorithmic comparison of three scientific impact indices, Acta Cybernetica, 19:3, (661-672), Online publication date: 1-Jan-2010.
  484. Du W, Murugesan M and Jia J Uncheatable grid computing Algorithms and theory of computation handbook, (30-30)
  485. Robert Y and Vivien F Algorithmic issues in grid computing Algorithms and theory of computation handbook, (29-29)
  486. Karger D, Stein C and Wein J Scheduling algorithms Algorithms and theory of computation handbook, (20-20)
  487. Zomorodian A Computational topology Algorithms and theory of computation handbook, (3-3)
  488. Wan S, Dras M, Dale R and Paris C Spanning tree approaches for statistical sentence generation Empirical methods in natural language generation, (13-44)
  489. Atkinson A A dynamic, decentralised search algorithm for efficient data retrieval in a distributed tuple space Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107, (21-30)
  490. ACM
    Koh S and Diessel O (2010). Configuration Merging in Point-to-Point Networks for Module-Based FPGA Reconfiguration, ACM Transactions on Reconfigurable Technology and Systems, 3:1, (1-36), Online publication date: 1-Jan-2010.
  491. Berlemont S and Olivo-Marin J (2010). Combining local filtering and multiscale analysis for edge, ridge, and curvilinear objects detection, IEEE Transactions on Image Processing, 19:1, (74-84), Online publication date: 1-Jan-2010.
  492. Rommes J and Schilders W (2010). Efficient methods for large resistor networks, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 29:1, (28-39), Online publication date: 1-Jan-2010.
  493. Hsu W, Chiang Y, Lin W, Tai W and Wu J Integrating LCS and SVM for 3D handwriting recognition on handheld devices using accelerometers Proceedings of the 3rd International Conference on Communications and information technology, (195-197)
  494. ACM
    Farooq F, Aslam S and Sarwar S QoS-based MPLS multicast tree selection algorithms Proceedings of the 7th International Conference on Frontiers of Information Technology, (1-8)
  495. ACM
    Pokam G, Pereira C, Danne K, Kassa R and Adl-Tabatabai A Architecting a chunk-based memory race recorder in modern CMPs Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture, (576-585)
  496. Lin T and Lee D Optimal Randomized Algorithm for the Density Selection Problem Proceedings of the 20th International Symposium on Algorithms and Computation, (1004-1013)
  497. Kwolek B (2009). Object segmentation in video via graph cut built on superpixels, Fundamenta Informaticae, 90:4, (379-393), Online publication date: 1-Dec-2009.
  498. Strehl A, Li L and Littman M (2009). Reinforcement Learning in Finite MDPs: PAC Analysis, The Journal of Machine Learning Research, 10, (2413-2444), Online publication date: 1-Dec-2009.
  499. Esposito R and Radicioni D (2009). CarpeDiem: Optimizing the Viterbi Algorithm and Applications to Supervised Sequential Learning, The Journal of Machine Learning Research, 10, (1851-1880), Online publication date: 1-Dec-2009.
  500. Yu T, Goldberg D, Sastry K, Lima C and Pelikan M (2009). Dependency structure matrix, genetic algorithms, and effective recombination, Evolutionary Computation, 17:4, (595-626), Online publication date: 1-Dec-2009.
  501. ACM
    Agrawal N, Arpaci-Dusseau A and Arpaci-Dusseau R (2009). Generating realistic impressions for file-system benchmarking, ACM Transactions on Storage, 5:4, (1-30), Online publication date: 1-Dec-2009.
  502. ACM
    Hoffman K, Zage D and Nita-Rotaru C (2009). A survey of attack and defense techniques for reputation systems, ACM Computing Surveys, 42:1, (1-31), Online publication date: 1-Dec-2009.
  503. Chaum D, Carback R, Clark J, Essex A, Popoveniuc S, Rivest R, Ryan P, Shen E, Sherman A and Vora P (2009). Scantegrity II, IEEE Transactions on Information Forensics and Security, 4:4, (611-627), Online publication date: 1-Dec-2009.
  504. Fredriksson K and Grabowski S (2009). Average-optimal string matching, Journal of Discrete Algorithms, 7:4, (579-594), Online publication date: 1-Dec-2009.
  505. Bagnara R, Hill P and Zaffanella E (2009). Weakly-relational shapes for numeric abstractions, Formal Methods in System Design, 35:3, (279-323), Online publication date: 1-Dec-2009.
  506. Pantelidou A and Ephremides A Minimum-length scheduling for multicast traffic under channel uncertainty Proceedings of the 28th IEEE conference on Global telecommunications, (5437-5442)
  507. Pavlopoulou C and Yu S A Unifying View of Contour Length Bias Correction Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I, (906-913)
  508. Zarras A and Issarny V A framework for systematic synthesis of transactional middleware Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, (257-272)
  509. ACM
    Watthayu W and Praekhao P A concept in error correction of text editors Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, (1176-1180)
  510. ACM
    Qiang S, Shasha C and Nianshen C A maximum network lifetime QoS routing algorithm in MANETs Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, (462-467)
  511. Poon W, Wong H, Lo K and Feng J (2009). Hierarchical network architecture for layered video streaming, International Journal of Wireless and Mobile Computing, 3:4, (271-279), Online publication date: 1-Nov-2009.
  512. Kern W and Paulusma D (2009). On the Core and f-Nucleolus of Flow Games, Mathematics of Operations Research, 34:4, (981-991), Online publication date: 1-Nov-2009.
  513. Anderson T, Loftus J, Rampersad N, Santean N and Shallit J (2009). Detecting palindromes, patterns and borders in regular languages, Information and Computation, 207:11, (1096-1118), Online publication date: 1-Nov-2009.
  514. ACM
    Tsafrir D, Wisniewski R, Bacon D and Stroustrup B Minimizing dependencies within generic classes for faster and smaller programs Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications, (425-444)
  515. ACM
    Tsafrir D, Wisniewski R, Bacon D and Stroustrup B (2009). Minimizing dependencies within generic classes for faster and smaller programs, ACM SIGPLAN Notices, 44:10, (425-444), Online publication date: 25-Oct-2009.
  516. ACM
    Ficara D, Giordano S, Kumar S and Lynch B Divide and discriminate Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, (133-142)
  517. Sun X, Mao T, Kralik J and Ray L Cooperative multi-robot reinforcement learning Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (1190-1196)
  518. Ortega A, Dias B, Teniente E, Bernardino A, Gaspar J and Andrade-Cetto J Calibrating an outdoor distributed camera network using laser range finder data Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (303-308)
  519. Xu B, Stilwell D and Kurdila A Efficient computation of level sets for path planning Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4414-4419)
  520. Cesa-Bianchi N, Gentile C and Vitale F Learning unknown graphs Proceedings of the 20th international conference on Algorithmic learning theory, (110-125)
  521. ACM
    Kao M, Sanghi M and Schweller R (2009). Randomized fast design of short DNA words, ACM Transactions on Algorithms, 5:4, (1-24), Online publication date: 1-Oct-2009.
  522. ACM
    Berend D and Braverman V (2009). A linear algorithm for computing convex hulls for random lines, ACM Transactions on Algorithms, 5:4, (1-21), Online publication date: 1-Oct-2009.
  523. ACM
    Golubchik L, Khanna S, Khuller S, Thurimella R and Zhu A (2009). Approximation algorithms for data placement on parallel disks, ACM Transactions on Algorithms, 5:4, (1-26), Online publication date: 1-Oct-2009.
  524. ACM
    Nahapetian A, Brisk P, Ghiasi S and Sarrafzadeh M (2009). An approximation algorithm for scheduling on heterogeneous reconfigurable resources, ACM Transactions on Embedded Computing Systems, 9:1, (1-20), Online publication date: 1-Oct-2009.
  525. Beume N, Fonseca C, López-Ibáñez M, Paquete L and Vahrenhold J (2009). On the complexity of computing the hypervolume indicator, IEEE Transactions on Evolutionary Computation, 13:5, (1075-1082), Online publication date: 1-Oct-2009.
  526. Hong C and Tewfik A (2009). Heuristic Reusable Dynamic Programming, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6:4, (570-582), Online publication date: 1-Oct-2009.
  527. Safarpour S and Veneris A (2009). Automated design debugging with abstraction and refinement, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28:10, (1597-1608), Online publication date: 1-Oct-2009.
  528. Kayasith P and Theeramunkong T (2009). Speech confusion index (Φ), Computers & Mathematics with Applications, 58:8, (1534-1549), Online publication date: 1-Oct-2009.
  529. Goldberg Y and Ritov Y (2009). Local procrustes for manifold embedding, Machine Language, 77:1, (1-25), Online publication date: 1-Oct-2009.
  530. Sirbiladze G, Sikharulidze A and Ghvaberidze B Fuzzy covering problem based on the expert valuations Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering, (163-170)
  531. Liu W, Shao S, Yang L and Zhu H An advanced scheduling algorithm in OFDM wireless communication systems Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, (4336-4339)
  532. Chen L and Wang H BREAC: broadcast routing based on Edmonds algorithm for ad hoc networks with asymmetric cost model Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, (2600-2604)
  533. ACM
    Codish M, Genaim S and Stuckey P A declarative encoding of telecommunications feature subscription in SAT Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, (255-266)
  534. Diaconu A, Manea F and Tiseanu C Combinatorial queries and updates on partial words Proceedings of the 17th international conference on Fundamentals of computation theory, (96-108)
  535. Cenciarelli P, Gorla D and Salvo I Depletable channels Proceedings of the 17th international conference on Fundamentals of computation theory, (50-61)
  536. Mu S, Ko H and Jansson P (2009). Algebra of programming in agda, Journal of Functional Programming, 19:5, (545-579), Online publication date: 1-Sep-2009.
  537. Stibor T (2009). Foundations of r-contiguous matching in negative selection for anomaly detection, Natural Computing: an international journal, 8:3, (613-641), Online publication date: 1-Sep-2009.
  538. ACM
    Argyrides C, Dimosthenous G, Pradhan D, Lisboa C and Carro L Reliability aware yield improvement technique for nanotechnology based circuits Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes, (1-6)
  539. Papa J and Falcão A On the Training Patterns Pruning for Optimum-Path Forest Proceedings of the 15th International Conference on Image Analysis and Processing, (259-268)
  540. ACM
    James P and Chalin P ESC4 Proceedings of the 8th international workshop on Specification and verification of component-based systems, (19-26)
  541. ACM
    Velázquez-Iturbide J and Pérez-Carrasco A (2009). Active learning of greedy algorithms by means of interactive experimentation, ACM SIGCSE Bulletin, 41:3, (119-123), Online publication date: 25-Aug-2009.
  542. Carpentieri M On multivariate genetic systems Proceedings of the 18th international conference on Fuzzy Systems, (35-40)
  543. ACM
    Moser C, Chen J and Thiele L Power management in energy harvesting embedded systems with discrete service levels Proceedings of the 2009 ACM/IEEE international symposium on Low power electronics and design, (413-418)
  544. Shan J, Liu Z and Zhou W Sentence similarity measure based on events and content words Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7, (627-631)
  545. ACM
    Buluç A, Fineman J, Frigo M, Gilbert J and Leiserson C Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (233-244)
  546. ACM
    Frigo M, Halpern P, Leiserson C and Lewin-Berlin S Reducers and other Cilk++ hyperobjects Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (79-90)
  547. ACM
    Aguilera M, Keidar I, Malkhi D and Shraer A Dynamic atomic storage without consensus Proceedings of the 28th ACM symposium on Principles of distributed computing, (17-25)
  548. Marinescu D and Baicoianu A (2009). An algorithm for the guillotine restrictions verification in a rectangular covering model, WSEAS Transactions on Computers, 8:8, (1306-1316), Online publication date: 1-Aug-2009.
  549. Hassanzadeh O, Chiang F, Lee H and Miller R (2009). Framework for evaluating clustering algorithms in duplicate detection, Proceedings of the VLDB Endowment, 2:1, (1282-1293), Online publication date: 1-Aug-2009.
  550. ACM
    Mi X, DeCarlo D and Stone M Abstraction of 2D shapes in terms of parts Proceedings of the 7th International Symposium on Non-Photorealistic Animation and Rendering, (15-24)
  551. ACM
    Moiseev K, Kolodny A and Wimer S (2009). Power-delay optimization in VLSI microprocessors by wire spacing, ACM Transactions on Design Automation of Electronic Systems, 14:4, (1-28), Online publication date: 1-Aug-2009.
  552. ACM
    Moyen J (2009). Resource control graphs, ACM Transactions on Computational Logic, 10:4, (1-44), Online publication date: 1-Aug-2009.
  553. Choi H, Brunet L and How J (2009). Consensus-based decentralized auctions for robusttask allocation, IEEE Transactions on Robotics, 25:4, (912-926), Online publication date: 1-Aug-2009.
  554. Sivaraman V, Elgindy H, Moreland D and Ostry D (2009). Packet pacing in small buffer optical packet switched networks, IEEE/ACM Transactions on Networking, 17:4, (1066-1079), Online publication date: 1-Aug-2009.
  555. Biegler F and Salomaa K (2009). On the synchronized derivation depth of context-free grammars, Theoretical Computer Science, 410:35, (3198-3208), Online publication date: 1-Aug-2009.
  556. Marx D and Schlotter I (2009). Parameterized graph cleaning problems, Discrete Applied Mathematics, 157:15, (3258-3267), Online publication date: 1-Aug-2009.
  557. Sun H and Shu L (2009). Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint, Multimedia Tools and Applications, 44:1, (111-131), Online publication date: 1-Aug-2009.
  558. Gamboa R (2009). A Formalization of Powerlist Algebra in ACL2, Journal of Automated Reasoning, 43:2, (139-172), Online publication date: 1-Aug-2009.
  559. Marinescu D and Baicoianu A The determination of the guillotine restrictions for a rectangular covering model Proceedings of the WSEAES 13th international conference on Computers, (307-312)
  560. Tian J Parameter identification in a class of linear structural equation models Proceedings of the 21st International Joint Conference on Artificial Intelligence, (1970-1975)
  561. Keyder E and Geffner H Trees of shortest paths vs. Steiner trees Proceedings of the 21st International Joint Conference on Artificial Intelligence, (1734-1739)
  562. Maher M Open contractible global constraints Proceedings of the 21st International Joint Conference on Artificial Intelligence, (578-583)
  563. Procaccia A Thou shalt covet thy neighbor's cake Proceedings of the 21st International Joint Conference on Artificial Intelligence, (239-244)
  564. ACM
    Whitley D, Hains D and Howe A Tunneling between optima Proceedings of the 11th Annual conference on Genetic and evolutionary computation, (915-922)
  565. ACM
    Auger A, Bader J, Brockhoff D and Zitzler E Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences Proceedings of the 11th Annual conference on Genetic and evolutionary computation, (563-570)
  566. ACM
    Velázquez-Iturbide J and Pérez-Carrasco A Active learning of greedy algorithms by means of interactive experimentation Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education, (119-123)
  567. Spina T, Montoya-Zegarra J, Falcão A and Miranda P Fast interactive segmentation of natural images using the image foresting transform Proceedings of the 16th international conference on Digital Signal Processing, (998-1005)
  568. Papa J, Falcão A, Levada A, Corrêa D, Salvadeo D and Mascarenhas N Fast and accurate holistic face recognition using optimum-path forest Proceedings of the 16th international conference on Digital Signal Processing, (781-786)
  569. Mittal N, Krishnamurthy S, Chandrasekaran R, Venkatesan S and Zeng Y (2009). On neighbor discovery in cognitive radio networks, Journal of Parallel and Distributed Computing, 69:7, (623-637), Online publication date: 1-Jul-2009.
  570. Kujala J (2009). Assembling approximately optimal binary search trees efficiently using arithmetics, Information Processing Letters, 109:16, (962-966), Online publication date: 1-Jul-2009.
  571. Wang F, Pu J and Hamdi M (2009). QoS based scheduling in the downlink of multi-user wireless systems (extended), Computer Communications, 32:11, (1257-1262), Online publication date: 1-Jul-2009.
  572. ACM
    Han W and Lee J Dependency-aware reordering for parallelizing query optimization in multi-core CPUs Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, (45-58)
  573. ACM
    Kešelj V, Liu H, Zeh N, Blouin C and Whidden C Finding optimal parameters for edit distance based sequence classification is NP-hard Proceedings of the KDD-09 Workshop on Statistical and Relational Learning in Bioinformatics, (17-21)
  574. ACM
    Tantipathananandh C and Berger-Wolf T Constant-factor approximation algorithms for identifying dynamic communities Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (827-836)
  575. Bauer Jr. D, Carothers C and Holder A Scalable Time Warp on Blue Gene Supercomputers Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation, (35-44)
  576. ACM
    Wang W, Cai J and Alfa A Distributed routing schemes for multi-hop fixed relay networks Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, (477-482)
  577. ACM
    Mitev M, Racheva E and Marinova G Algorithm for defining of initial package of notions for purpose of e-learning Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, (1-5)
  578. Hecker A and Kürner T Introduction of measurement-based estimation of handover attempts for automatic planning of mobile radio networks Proceedings of the 2009 IEEE international conference on Communications, (4701-4705)
  579. Chen I, Lin P, Luo C, Cheng T, Lin Y, Lai Y and Lin F Extracting attack sessions from real traffic with intrusion prevention systems Proceedings of the 2009 IEEE international conference on Communications, (889-893)
  580. Ko C and Shi L Scheduling for finite time consensus Proceedings of the 2009 conference on American Control Conference, (1982-1986)
  581. Lavaei J and Sojoudi S Complexity of checking the existence of a stabilizing decentralized controller Proceedings of the 2009 conference on American Control Conference, (1827-1832)
  582. ACM
    Park K, Becker E, Vinjumur J, Le Z and Makedon F Human behavioral detection and data cleaning in assisted living environment using wireless sensor networks Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments, (1-8)
  583. ACM
    Agarwal P, Ezra E and Shair M Near-linear approximation algorithms for geometric hitting sets Proceedings of the twenty-fifth annual symposium on Computational geometry, (23-32)
  584. Ramakrishnan A A, Kuppan S and Devi S Automatic generation of Tamil lyrics for melodies Proceedings of the Workshop on Computational Approaches to Linguistic Creativity, (40-46)
  585. ACM
    Loh P and Prakash E (2009). Novel moving target search algorithms for computer gaming, Computers in Entertainment, 7:2, (1-16), Online publication date: 1-Jun-2009.
  586. Das S, Abraham A, Chakraborty U and Konar A (2009). Differential evolution using a neighborhood-based mutation operator, IEEE Transactions on Evolutionary Computation, 13:3, (526-553), Online publication date: 1-Jun-2009.
  587. Kim D and Cho J (2009). Active caching, IEEE Communications Letters, 13:6, (378-380), Online publication date: 1-Jun-2009.
  588. Sakai Y (2009). Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence, Theoretical Computer Science, 410:27-29, (2759-2766), Online publication date: 1-Jun-2009.
  589. Park K, Park H, Jeun W and Ha S (2009). Boolean circuit programming, Journal of Discrete Algorithms, 7:2, (267-277), Online publication date: 1-Jun-2009.
  590. Barrière L, Dalfó C, Fiol M and Mitjana M (2009). The generalized hierarchical product of graphs, Discrete Mathematics, 309:12, (3871-3881), Online publication date: 1-Jun-2009.
  591. Fomin F, Mazoit F and Todinca I (2009). Computing branchwidth via efficient triangulations and blocks, Discrete Applied Mathematics, 157:12, (2726-2736), Online publication date: 1-Jun-2009.
  592. Oltean M and Muntean O (2009). Solving the subset-sum problem with a light-based device, Natural Computing: an international journal, 8:2, (321-331), Online publication date: 1-Jun-2009.
  593. Su F and Markert K Subjectivity recognition on word senses via semi-supervised mincuts Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, (1-9)
  594. ACM
    Aronov B, Ezra E and Shair M Small-size ε-nets for axis-parallel rectangles and boxes Proceedings of the forty-first annual ACM symposium on Theory of computing, (639-648)
  595. ACM
    Ding M and Cheng X Fault tolerant target tracking in sensor networks Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, (125-134)
  596. Lee Y and Zomaya A Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, (92-99)
  597. Hsu H and Orso A MINTS Proceedings of the 31st International Conference on Software Engineering, (419-429)
  598. Fortin J, Kasperski A and Zieliński P (2009). Some methods for evaluating the optimality of elements in matroids with ill-known weights, Fuzzy Sets and Systems, 160:10, (1341-1354), Online publication date: 15-May-2009.
  599. Fitch R and Lal R Experiments with a ZigBee wireless communication system for self-reconfiguring modular robots Proceedings of the 2009 IEEE international conference on Robotics and Automation, (3965-3970)
  600. Joo H, Jeong Y, Duchenne O, Ko S and Kweon I Graph-based robust shape matching for robotic application Proceedings of the 2009 IEEE international conference on Robotics and Automation, (2618-2624)
  601. Piniés P, Paz L and Tardós J CI-graph Proceedings of the 2009 IEEE international conference on Robotics and Automation, (2538-2545)
  602. Ågotnes T, van der Hoek W, Tennenholtz M and Wooldridge M Power in normative systems Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (145-152)
  603. ACM
    Yan J and Chen Z RDL pre-assignment routing for flip-chip designs Proceedings of the 19th ACM Great Lakes symposium on VLSI, (401-404)
  604. ACM
    Srinivasan R and Carter H A taylor series methodology for analyzing the effects of process variation on circuit operation Proceedings of the 19th ACM Great Lakes symposium on VLSI, (203-208)
  605. Chali Y, Joty S and Hasan S (2009). Complex question answering, Journal of Artificial Intelligence Research, 35:1, (1-47), Online publication date: 1-May-2009.
  606. Sliwko L and Zgrzywa A (2009). A novel strategy for multi-resource load balancing in agent-based systems, International Journal of Intelligent Information and Database Systems, 3:2, (180-202), Online publication date: 1-May-2009.
  607. Pun M, Brown D and Poor H (2009). Opportunistic collaborative beamforming with one-bit feedback, IEEE Transactions on Wireless Communications, 8:5, (2629-2641), Online publication date: 1-May-2009.
  608. Silva J and Narayanan S (2009). Discriminative wavelet packet filter bank selection for pattern recognition, IEEE Transactions on Signal Processing, 57:5, (1796-1810), Online publication date: 1-May-2009.
  609. Saule E and Trystram D (2009). Analyzing scheduling with transient failures, Information Processing Letters, 109:11, (539-542), Online publication date: 1-May-2009.
  610. Sirbiladze G, Ghvaberidze B, Latsabidze T and Matsaberidze B (2009). Using a minimal fuzzy covering in decision-making problems, Information Sciences: an International Journal, 179:12, (2022-2027), Online publication date: 1-May-2009.
  611. Knudsen L, Mendel F, Rechberger C and Thomsen S Cryptanalysis of MDC-2 Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479, (106-120)
  612. ACM
    Holdsworth J and Lui S GPS-enabled mobiles for learning shortest paths Proceedings of the 4th International Conference on Foundations of Digital Games, (86-90)
  613. Tran N, Min B, Li J and Subramanian L Sybil-resilient online content voting Proceedings of the 6th USENIX symposium on Networked systems design and implementation, (15-28)
  614. Bae S, Mangalagiri P and Vijaykrishnan N Exploiting clock skew scheduling for FPGA Proceedings of the Conference on Design, Automation and Test in Europe, (1524-1529)
  615. Arora A and Sang L Dialog codes for secure wireless communications Proceedings of the 2009 International Conference on Information Processing in Sensor Networks, (13-24)
  616. ACM
    Wu F and Tory M PhotoScope Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (1103-1112)
  617. Tsatsaronis G and Panagiotopoulou V A generalized vector space model for text retrieval based on semantic relatedness Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop, (70-78)
  618. Kwolek B (2009). Object segmentation in video via graph cut built on superpixels, Fundamenta Informaticae, 90:4, (379-393), Online publication date: 1-Apr-2009.
  619. Cheng K, Lui K, Wu Y and Tam V (2009). A distributed multihop time synchronization protocol for wireless sensor networks using pairwise broadcast synchronization, IEEE Transactions on Wireless Communications, 8:4, (1764-1772), Online publication date: 1-Apr-2009.
  620. Park Y, Shackney S and Schwartz R (2009). Network-Based Inference of Cancer Progression from Microarray Data, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6:2, (200-212), Online publication date: 1-Apr-2009.
  621. Sanyal A, Ganeshpure K and Kundu S (2009). An improved soft-error rate measurement technique, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28:4, (596-600), Online publication date: 1-Apr-2009.
  622. Gargano L and Rescigno A (2009). Collision-free path coloring with application to minimum-delay gathering in sensor networks, Discrete Applied Mathematics, 157:8, (1858-1872), Online publication date: 1-Apr-2009.
  623. Paul M, Finch A and Sumita E NICT@WMT09 Proceedings of the Fourth Workshop on Statistical Machine Translation, (105-109)
  624. Navigli R Using cycles and quasi-cycles to disambiguate dictionary glosses Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, (594-602)
  625. Lopez A Translation as weighted deduction Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, (532-540)
  626. ACM
    Xiao Y, Wu W, Pei J, Wang W and He Z Efficiently indexing shortest paths by exploiting symmetry in graphs Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, (493-504)
  627. ACM
    Cheng J and Yu J On-line exact shortest distance query processing Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, (481-492)
  628. ACM
    Selçuk Candan K, Cao H, Qi Y and Sapino M AlphaSum Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, (96-107)
  629. ACM
    Green T, Ives Z and Tannen V Reconcilable differences Proceedings of the 12th International Conference on Database Theory, (212-224)
  630. ACM
    Harsh P and Newman R Using geo-spatial session tagging for smart multicast session discovery Proceedings of the 2009 ACM symposium on Applied Computing, (22-27)
  631. ACM
    Gal-Ezer J, Vilner T and Zur E (2009). Has the paradigm shift in CS1 a harmful effect on data structures courses, ACM SIGCSE Bulletin, 41:1, (126-130), Online publication date: 4-Mar-2009.
  632. ACM
    Gal-Ezer J, Vilner T and Zur E Has the paradigm shift in CS1 a harmful effect on data structures courses Proceedings of the 40th ACM technical symposium on Computer science education, (126-130)
  633. Hui S, Fader P and Bradlow E (2009). Path Data in Marketing, Marketing Science, 28:2, (320-335), Online publication date: 1-Mar-2009.
  634. ACM
    Hong Y and Huang J (2009). Reducing fault dictionary size for million-gate large circuits, ACM Transactions on Design Automation of Electronic Systems, 14:2, (1-14), Online publication date: 1-Mar-2009.
  635. Li Z, Zhu S and Zhou M (2009). A divide-and-conquer strategy to deadlock prevention in flexible manufacturing systems, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39:2, (156-169), Online publication date: 1-Mar-2009.
  636. Ozdal M (2009). Detailed-routing algorithms for dense pin clusters in integrated circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28:3, (340-349), Online publication date: 1-Mar-2009.
  637. Juszczak P, Tax D, Pekalska E and Duin R (2009). Minimum spanning tree based one-class classifier, Neurocomputing, 72:7-9, (1859-1869), Online publication date: 1-Mar-2009.
  638. Klein S (2009). On the use of negation in Boolean IR queries, Information Processing and Management: an International Journal, 45:2, (298-311), Online publication date: 1-Mar-2009.
  639. Zhang Y, Manisterski E, Kraus S, Subrahmanian V and Peleg D (2009). Computing the fault tolerance of multi-agent deployment, Artificial Intelligence, 173:3-4, (437-465), Online publication date: 1-Mar-2009.
  640. Oltean M (2009). Light-based string matching, Natural Computing: an international journal, 8:1, (121-132), Online publication date: 1-Mar-2009.
  641. Sen S Approximating Shortest Paths in Graphs Proceedings of the 3rd International Workshop on Algorithms and Computation, (32-43)
  642. ACM
    Cho E, Moon C, Im H and Baik D An anonymous communication model for privacy-enhanced location based service using an echo agent Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, (290-297)
  643. ACM
    Nicolau A, Li G and Kejariwal A (2009). Techniques for efficient placement of synchronization primitives, ACM SIGPLAN Notices, 44:4, (199-208), Online publication date: 14-Feb-2009.
  644. ACM
    Kulkarni M, Burtscher M, Inkulu R, Pingali K and Casçaval C (2009). How much parallelism is there in irregular applications?, ACM SIGPLAN Notices, 44:4, (3-14), Online publication date: 14-Feb-2009.
  645. ACM
    Nicolau A, Li G and Kejariwal A Techniques for efficient placement of synchronization primitives Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, (199-208)
  646. ACM
    Kulkarni M, Burtscher M, Inkulu R, Pingali K and Casçaval C How much parallelism is there in irregular applications? Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, (3-14)
  647. Bouras C and Primpas D (2009). Architectures and performance evaluation of bandwidth brokers, International Journal of Network Management, 19:2, (101-117), Online publication date: 3-Feb-2009.
  648. Panangadan A and Dyer M (2009). Construction in a Simulated Environment Using Temporal Goal Sequencing and Reinforcement Learning, Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems, 17:1, (81-104), Online publication date: 1-Feb-2009.
  649. ACM
    Chen C, Chen M and Chen M (2009). An adaptive threshold framework for event detection using HMM-based life profiles, ACM Transactions on Information Systems, 27:2, (1-35), Online publication date: 1-Feb-2009.
  650. ACM
    Urgaonkar B, Shenoy P and Roscoe T (2009). Resource overbooking and application profiling in a shared Internet hosting platform, ACM Transactions on Internet Technology, 9:1, (1-45), Online publication date: 1-Feb-2009.
  651. Tabatabaee V and Tassiulas L (2009). MNCM, IEEE/ACM Transactions on Networking, 17:1, (294-304), Online publication date: 1-Feb-2009.
  652. Van Mieghem P and Wang H (2009). The observable part of a network, IEEE/ACM Transactions on Networking, 17:1, (93-105), Online publication date: 1-Feb-2009.
  653. Mehta V, Marek-Sadowska M, Tsai K and Rajski J (2009). Timing-aware multiple-delay-fault diagnosis, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28:2, (245-258), Online publication date: 1-Feb-2009.
  654. Antiqueira L, Oliveira O, Costa L and Nunes M (2009). A complex network approach to text summarization, Information Sciences: an International Journal, 179:5, (584-599), Online publication date: 1-Feb-2009.
  655. Hashemian S and Mavaddat F (2008). A Logical Reasoning Approach to Automatic Composition of Stateless Components, Fundamenta Informaticae, 89:4, (539-577), Online publication date: 31-Jan-2009.
  656. Yan J and Chen Z IO connection assignment and RDL routing for flip-chip designs Proceedings of the 2009 Asia and South Pacific Design Automation Conference, (588-593)
  657. Basagni S, Nidito F and Faragó A The multi-radio advantage Proceedings of the 4th international conference on Radio and wireless symposium, (451-454)
  658. Hou Y, Zafer M, Lee K, Verma D and Leung K On the mapping between logical and physical topologies Proceedings of the First international conference on COMmunication Systems And NETworks, (483-492)
  659. Clifford R, Efremenko K, Porat E and Rothschild A From coding theory to efficient pattern matching Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (778-784)
  660. Yates A and Etzioni O (2009). Unsupervised methods for determining object and relation synonyms on the web, Journal of Artificial Intelligence Research, 34:1, (255-296), Online publication date: 1-Jan-2009.
  661. ACM
    Armoni M (2009). Reduction in CS, Journal on Educational Resources in Computing, 8:4, (1-30), Online publication date: 1-Jan-2009.
  662. ACM
    Dasdan A (2009). Provably efficient algorithms for resolving temporal and spatial difference constraint violations, ACM Transactions on Design Automation of Electronic Systems, 14:1, (1-24), Online publication date: 1-Jan-2009.
  663. Liu L, Liu W, Cartes D and Chung I (2009). Slow coherency and Angle Modulated Particle Swarm Optimization based islanding of large-scale power systems, Advanced Engineering Informatics, 23:1, (45-56), Online publication date: 1-Jan-2009.
  664. Lee H and Shim J Indexing Method for Transitive Relationships of Product Information Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03, (521-524)
  665. Wolf J, Bansal N, Hildrum K, Parekh S, Rajan D, Wagle R, Wu K and Fleischer L SODA Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware, (306-325)
  666. Hashemian S and Mavaddat F (2008). A Logical Reasoning Approach to Automatic Composition of Stateless Components, Fundamenta Informaticae, 89:4, (539-577), Online publication date: 1-Dec-2008.
  667. ACM
    Mitra S, Liberzon D and Lynch N (2009). Verifying average dwell time of hybrid systems, ACM Transactions on Embedded Computing Systems, 8:1, (1-37), Online publication date: 1-Dec-2008.
  668. ACM
    Costa M, Crowcroft J, Castro M, Rowstron A, Zhou L, Zhang L and Barham P (2008). Vigilante, ACM Transactions on Computer Systems, 26:4, (1-68), Online publication date: 1-Dec-2008.
  669. Oprocha_ca P (2008). Algorithmic Approach to Devaney Chaos in Shift Spaces, Fundamenta Informaticae, 87:3-4, (435-446), Online publication date: 30-Nov-2008.
  670. ACM
    Schmidt T, Wählisch M and Christ O AuthoCast Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia, (142-149)
  671. Kandemir M, Li F, Irwin M and Son S A novel migration-based NUCA design for chip multiprocessors Proceedings of the 2008 ACM/IEEE conference on Supercomputing, (1-12)
  672. Mogal H and Bazargan K Thermal-aware floorplanning for task migration enabled active sub-threshold leakage reduction Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, (302-305)
  673. Leporati A and Gutiérrez-Naranjo M (2008). Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources, Fundamenta Informaticae, 87:1, (61-77), Online publication date: 1-Nov-2008.
  674. Ciobanu G and Resios A (2008). Computational Complexity of Simple P Systems, Fundamenta Informaticae, 87:1, (49-59), Online publication date: 1-Nov-2008.
  675. ACM
    Grandoni F, Könemann J and Panconesi A (2008). Distributed weighted vertex cover via maximal matchings, ACM Transactions on Algorithms, 5:1, (1-12), Online publication date: 1-Nov-2008.
  676. ACM
    Huang C and Leung C Downlink mixed-traffic scheduling with packet division multiplexing Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, (165-172)
  677. ACM
    Gopinathan M and Rajamani S (2008). Enforcing object protocols by combining static and runtime analysis, ACM SIGPLAN Notices, 43:10, (245-260), Online publication date: 27-Oct-2008.
  678. ACM
    Wang M and Hua X Study on the combination of video concept detectors Proceedings of the 16th ACM international conference on Multimedia, (647-650)
  679. Kim Y, Kim K, Ahn S and Chung J Network Stability Analysis Techniques Using the Virtual Articulation Node Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management, (458-461)
  680. Bouillard A, Jouhet L and Thierry E Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools, (1-7)
  681. Coeurjolly D, Hulin J and Sivignon I (2008). Finding a minimum medial axis of a discrete shape is NP-hard, Theoretical Computer Science, 406:1-2, (72-79), Online publication date: 20-Oct-2008.
  682. ACM
    Huang C, Sheldon D and Vahid F Dynamic tuning of configurable architectures Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis, (97-102)
  683. ACM
    Gopinathan M and Rajamani S Enforcing object protocols by combining static and runtime analysis Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications, (245-260)
  684. Barus A, Chen T, Grant D, Kuo F and Lau M Testing of heuristic methods Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques, (246-260)
  685. Daniela M, Paul I and Alexandra B (2008). A plan of lauding the boxes for a three dimensional bin packing model, WSEAS TRANSACTIONS on SYSTEMS, 7:10, (830-839), Online publication date: 1-Oct-2008.
  686. Stratan C, Iosup A and Epema D A performance study of grid workflow engines Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing, (25-32)
  687. ACM
    Fischer S and Kuchen H (2008). Data-flow testing of declarative programs, ACM SIGPLAN Notices, 43:9, (201-212), Online publication date: 27-Sep-2008.
  688. Dechev D, Rouquette N, Pirkelbauer P and Stroustrup B Verification and semantic parallelization of goal-driven autonomous software Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems, (1-8)
  689. ACM
    Fischer S and Kuchen H Data-flow testing of declarative programs Proceedings of the 13th ACM SIGPLAN international conference on Functional programming, (201-212)
  690. Helmert M and Geffner H Unifying the causal graph and additive heuristics Proceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling, (140-147)
  691. Furrow B (2008). A panoply of quantum algorithms, Quantum Information & Computation, 8:8, (834-859), Online publication date: 1-Sep-2008.
  692. Amir A, Levy A and Reuveni L (2008). The Practical Efficiency of Convolutions in Pattern Matching Algorithms, Fundamenta Informaticae, 84:1, (1-15), Online publication date: 1-Sep-2008.
  693. ACM
    Ozdal M, Wong M and Honsinger P (2008). Optimal routing algorithms for rectilinear pin clusters in high-density multichip modules, ACM Transactions on Design Automation of Electronic Systems, 13:4, (1-20), Online publication date: 1-Sep-2008.
  694. Volegov D and Yurin D (2008). Preliminary coarse image registration by using straight lines found on them for constructing super resolution mosaics and 3D scene recovery, Programming and Computing Software, 34:5, (279-293), Online publication date: 1-Sep-2008.
  695. Wang Y, He K, Luo R, Wang H and Yang H (2008). Two-phase fine-grain sleep transistor insertion technique in leakage critical circuits, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16:9, (1101-1113), Online publication date: 1-Sep-2008.
  696. Biasotti S, Giorgi D, Spagnuolo M and Falcidieno B (2008). Size functions for comparing 3D models, Pattern Recognition, 41:9, (2855-2873), Online publication date: 1-Sep-2008.
  697. Fatima S, Wooldridge M and Jennings N (2008). A linear approximation method for the Shapley value, Artificial Intelligence, 172:14, (1673-1699), Online publication date: 1-Sep-2008.
  698. ACM
    Garriga G, Junttila E and Mannila H Banded structure in binary matrices Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, (292-300)
  699. Laugerotte É and Ziadi D (2008). WeightedWord Recognition, Fundamenta Informaticae, 83:3, (277-298), Online publication date: 20-Aug-2008.
  700. ACM
    Jarosz W, Jensen H and Donner C Advanced global illumination using photon mapping ACM SIGGRAPH 2008 classes, (1-112)
  701. Oprocha P (2008). Algorithmic Approach to Devaney Chaos in Shift Spaces, Fundamenta Informaticae, 87:3-4, (435-446), Online publication date: 1-Aug-2008.
  702. Laugerotte É and Ziadi D (2008). WeightedWord Recognition, Fundamenta Informaticae, 83:3, (277-298), Online publication date: 1-Aug-2008.
  703. Cheng R, Chen J and Xie X (2008). Cleaning uncertain data with quality guarantees, Proceedings of the VLDB Endowment, 1:1, (722-735), Online publication date: 1-Aug-2008.
  704. Machanavajjhala A, Vee E, Garofalakis M and Shanmugasundaram J (2008). Scalable ranked publish/subscribe, Proceedings of the VLDB Endowment, 1:1, (451-462), Online publication date: 1-Aug-2008.
  705. ACM
    Komogortsev O and Khan J (2008). Predictive real-time perceptual compression based on eye-gaze-position analysis, ACM Transactions on Multimedia Computing, Communications, and Applications, 4:3, (1-16), Online publication date: 1-Aug-2008.
  706. Timmis J, Hone A, Stibor T and Clark E (2008). Theoretical advances in artificial immune systems, Theoretical Computer Science, 403:1, (11-32), Online publication date: 1-Aug-2008.
  707. Bonet B and Geffner H (2008). Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Artificial Intelligence, 172:12-13, (1579-1604), Online publication date: 1-Aug-2008.
  708. Wang F and Hamdi M QoS based scheduling in the downlink of multiuser wireless systems Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, (1-6)
  709. Daniela M, Paul I and Alexandra B A topological order for a rectangular three dimensional bin packing problem Proceedings of the 12th WSEAS international conference on Computers, (285-290)
  710. ACM
    Elkarablieh B, Marinov D and Khurshid S Efficient solving of structural constraints Proceedings of the 2008 international symposium on Software testing and analysis, (39-50)
  711. Shen J, Li L and Wong W Markov blanket feature selection for support vector machines Proceedings of the 23rd national conference on Artificial intelligence - Volume 2, (696-701)
  712. Lesaint D, Mehta D, O'Sullivan B, Quesada L and Wilson N Personalisation of telecommunications services as combinatorial optimisation Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3, (1693-1698)
  713. Brandt F, Fischer F, Harrenstein P and Mair M A computational analysis of the tournament equilibrium set Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (38-43)
  714. ACM
    Weyland D Simulated annealing, its parameter settings and the longest common subsequence problem Proceedings of the 10th annual conference on Genetic and evolutionary computation, (803-810)
  715. Lee Y, Thomo A, Wu K and King V Scalable Ubiquitous Data Access in Clustered Sensor Networks Proceedings of the 20th international conference on Scientific and Statistical Database Management, (533-540)
  716. Kriegel H, Kröger P, Renz M and Schmidt T Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks Proceedings of the 20th international conference on Scientific and Statistical Database Management, (150-167)
  717. Steinemann D, Otaduy M and Gross M Fast adaptive shape matching deformations Proceedings of the 2008 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, (87-94)
  718. Pritchard D Fast Distributed Computation of Cuts Via Random Circulations Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I, (145-160)
  719. Oommen B and Fayyoumi E Enhancing Micro-Aggregation Technique by Utilizing Dependence-Based Information in Secure Statistical Databases Proceedings of the 13th Australasian conference on Information Security and Privacy, (404-418)
  720. Meyer U On Trade-Offs in External-Memory Diameter-Approximation Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (426-436)
  721. Azar Y, Feige U and Glasner D A Preemptive Algorithm for Maximizing Disjoint Paths on Trees Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (319-330)
  722. Ésik Z and Iván S (2008). Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics, Fundamenta Informaticae, 82:1-2, (79-103), Online publication date: 1-Jul-2008.
  723. ACM
    Tseng I and Postula A (2008). Partitioning parameterized 45-degree polygons with constraint programming, ACM Transactions on Design Automation of Electronic Systems, 13:3, (1-29), Online publication date: 1-Jul-2008.
  724. Wensch J, Gerisch A and Posch S (2008). Optimised coupling of hierarchies in image registration, Image and Vision Computing, 26:7, (1000-1011), Online publication date: 1-Jul-2008.
  725. Caumond A, Lacomme P and Tchernev N (2008). A memetic algorithm for the job-shop with time-lags, Computers and Operations Research, 35:7, (2331-2356), Online publication date: 1-Jul-2008.
  726. Sharifzadeh M, Kolahdouzan M and Shahabi C (2008). The optimal sequenced route query, The VLDB Journal — The International Journal on Very Large Data Bases, 17:4, (765-787), Online publication date: 1-Jul-2008.
  727. Hadzic T, Lesaint D, Mehta D, O'Sullivan B, Quesada L and Wilson N A BDD Approach to the Feature Subscription Problem Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (698-702)
  728. Bleiweiss A GPU accelerated pathfinding Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware, (65-74)
  729. Clifford R, Efremenko K, Porat B and Porat E A Black Box for Online Approximate Pattern Matching Proceedings of the 19th annual symposium on Combinatorial Pattern Matching, (143-151)
  730. Avni H and Shavit N Maintaining Consistent Transactional States without a Global Clock Proceedings of the 15th international colloquium on Structural Information and Communication Complexity, (131-140)
  731. ACM
    Balmin A, Özcan F, Singh A and Ting E Grouping and optimization of XPath expressions in DB2® pureXML Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (1065-1074)
  732. ACM
    Qi Y, Candan K, Tatemura J, Chen S and Liao F Supporting OLAP operations over imperfectly integrated taxonomies Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (875-888)
  733. ACM
    Jin R, Xiang Y, Ruan N and Wang H Efficiently answering reachability queries on very large directed graphs Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (595-608)
  734. ACM
    Liu K and Terzi E Towards identity anonymization on graphs Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (93-106)
  735. ACM
    McCamant S and Ernst M Quantitative information flow as network flow capacity Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, (193-205)
  736. Ramakrishnan G, Joshi S, Khaitan S and Balakrishnan S Optimization issues in inverted index-based entity annotation Proceedings of the 3rd international conference on Scalable information systems, (1-10)
  737. ACM
    Choi Y, Khan M, Kumar V and Pandurangan G Energy-optimal distributed algorithms for minimum spanning trees Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, (188-190)
  738. Zhao C, Zhao Y and Dey S (2008). Intelligent robustness insertion for optimal transient error tolerance improvement in VLSI circuits, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16:6, (714-724), Online publication date: 1-Jun-2008.
  739. Lee I (2008). A Simple Algorithm for Transposition-Invariant Amplified (δ, γ)-Matching, IEICE - Transactions on Information and Systems, E91-D:6, (1824-1826), Online publication date: 1-Jun-2008.
  740. Ozertem U, Erdogmus D and Jenssen R (2008). Mean shift spectral clustering, Pattern Recognition, 41:6, (1924-1938), Online publication date: 1-Jun-2008.
  741. Aho T, Elomaa T and Kujala J Reducing splaying by taking advantage of working sets Proceedings of the 7th international conference on Experimental algorithms, (1-12)
  742. ACM
    McCamant S and Ernst M (2008). Quantitative information flow as network flow capacity, ACM SIGPLAN Notices, 43:6, (193-205), Online publication date: 30-May-2008.
  743. Régin J Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, (233-247)
  744. ACM
    Malik M, Pervaiz A, Uzuncaova E and Khurshid S Deryaft Proceedings of the 30th international conference on Software engineering, (859-862)
  745. Shafran V, Kaminka G, Kraus S and Goldman C Towards bidirectional distributed matchmaking Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1437-1440)
  746. Cheng K and Dasgupta P Coalition game-based distributed coverage of unknown environments by robot swarms Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1191-1194)
  747. Giovannucci A, Vinyals M, Rodriguez-Aguilar J and Cerquides J Computationally-efficient winner determination for mixed multi-unit combinatorial auctions Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2, (1071-1078)
  748. ACM
    Zied M, Hayder M, Emna A and Habib M Efficient tree topology for FPGA interconnect network Proceedings of the 18th ACM Great Lakes symposium on VLSI, (321-326)
  749. Sikharulidze A and Sirbiladze G Average misbelief criterion in the minimal fuzzy covering problem Proceedings of the 9th WSEAS International Conference on Fuzzy Systems, (42-48)
  750. Katz M and Domshlak C (2008). New Islands of tractability of cost-optimal planning, Journal of Artificial Intelligence Research, 32:1, (203-288), Online publication date: 1-May-2008.
  751. ACM
    Monniaux D (2008). The pitfalls of verifying floating-point computations, ACM Transactions on Programming Languages and Systems, 30:3, (1-41), Online publication date: 1-May-2008.
  752. Goto H (2008). Efficient Calculation of the Transition Matrix in a Max-Plus Linear State-Space Representation, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:5, (1278-1282), Online publication date: 1-May-2008.
  753. Rozanov M and Strichman O (2008). Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 198:2, (3-17), Online publication date: 1-May-2008.
  754. Wang X, Feng D, Xu Z and Hu H Mediator-free secure policy interoperation of exclusively-trusted multiple domains Proceedings of the 4th international conference on Information security practice and experience, (248-262)
  755. ACM
    Cai R, Yang J, Lai W, Wang Y and Zhang L iRobot Proceedings of the 17th international conference on World Wide Web, (447-456)
  756. Nederhof M and Satta G (2008). Computation of distances for regular and context-free probabilistic languages, Theoretical Computer Science, 395:2-3, (235-254), Online publication date: 20-Apr-2008.
  757. Iliopoulos C and Sohel Rahman M (2008). Algorithms for computing variants of the longest common subsequence problem, Theoretical Computer Science, 395:2-3, (255-267), Online publication date: 20-Apr-2008.
  758. Dupas A and Damiand G First results for 3D image segmentation with topological map Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery, (507-518)
  759. ACM
    Long J, Zhou H and Memik S An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction Proceedings of the 2008 international symposium on Physical design, (126-133)
  760. Dupas A and Damiand G Comparison of local and global region merging in the topological map Proceedings of the 12th international conference on Combinatorial image analysis, (420-431)
  761. Lingas A and Lundell E Efficient approximation algorithms for shortest cycles in undirected graphs Proceedings of the 8th Latin American conference on Theoretical informatics, (736-746)
  762. ACM
    Natale M and Pappalardo V (2008). Buffer optimization in multitask implementations of Simulink models, ACM Transactions on Embedded Computing Systems, 7:3, (1-32), Online publication date: 1-Apr-2008.
  763. Rocha P, Ravetti M, Mateus G and Pardalos P (2008). Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Computers and Operations Research, 35:4, (1250-1264), Online publication date: 1-Apr-2008.
  764. Agmon N, Hazon N and Kaminka G (2008). The giving tree, Annals of Mathematics and Artificial Intelligence, 52:2-4, (143-168), Online publication date: 1-Apr-2008.
  765. ACM
    Cech Previtali S and Gross T Extracting updating aspects from version differences Proceedings of the 2008 AOSD workshop on Linking aspect technology and evolution, (1-5)
  766. Ulitsky I, Karp R and Shamir R Detecting disease-specific dysregulated pathways via analysis of clinical expression profiles Proceedings of the 12th annual international conference on Research in computational molecular biology, (347-359)
  767. Andersson J, Ericsson M, Kessler C and Löwe W Profile-guided composition Proceedings of the 7th international conference on Software composition, (157-164)
  768. ACM
    Ding L and Dixon B Using an edge-dual graph and k-connectivity to identify strong connections in social networks Proceedings of the 46th Annual Southeast Regional Conference on XX, (475-480)
  769. ACM
    Polycarpou I Induction as a tool for conceptual coherence in computer science Proceedings of the 46th Annual Southeast Regional Conference on XX, (440-445)
  770. ACM
    Li R A space efficient algorithm for the constrained heaviest common subsequence problem Proceedings of the 46th Annual Southeast Regional Conference on XX, (226-230)
  771. ACM
    Kulkarni M, Pingali K, Ramanarayanan G, Walter B, Bala K and Chew L (2008). Optimistic parallelism benefits from data partitioning, ACM SIGPLAN Notices, 43:3, (233-243), Online publication date: 25-Mar-2008.
  772. ACM
    Ottoni G and August D (2008). Communication optimizations for global multi-threaded instruction scheduling, ACM SIGPLAN Notices, 43:3, (222-232), Online publication date: 25-Mar-2008.
  773. ACM
    Tuck J, Ahn W, Ceze L and Torrellas J (2008). SoftSig, ACM SIGPLAN Notices, 43:3, (145-156), Online publication date: 25-Mar-2008.
  774. ACM
    Kulkarni M, Pingali K, Ramanarayanan G, Walter B, Bala K and Chew L (2008). Optimistic parallelism benefits from data partitioning, ACM SIGOPS Operating Systems Review, 42:2, (233-243), Online publication date: 25-Mar-2008.
  775. ACM
    Ottoni G and August D (2008). Communication optimizations for global multi-threaded instruction scheduling, ACM SIGOPS Operating Systems Review, 42:2, (222-232), Online publication date: 25-Mar-2008.
  776. ACM
    Tuck J, Ahn W, Ceze L and Torrellas J (2008). SoftSig, ACM SIGOPS Operating Systems Review, 42:2, (145-156), Online publication date: 25-Mar-2008.
  777. ACM
    Kulkarni M, Pingali K, Ramanarayanan G, Walter B, Bala K and Chew L (2008). Optimistic parallelism benefits from data partitioning, ACM SIGARCH Computer Architecture News, 36:1, (233-243), Online publication date: 25-Mar-2008.
  778. ACM
    Ottoni G and August D (2008). Communication optimizations for global multi-threaded instruction scheduling, ACM SIGARCH Computer Architecture News, 36:1, (222-232), Online publication date: 25-Mar-2008.
  779. ACM
    Tuck J, Ahn W, Ceze L and Torrellas J (2008). SoftSig, ACM SIGARCH Computer Architecture News, 36:1, (145-156), Online publication date: 25-Mar-2008.
  780. ACM
    Jin R, Fuhry D and Alali A Cost-based query optimization for complex pattern mining on multiple databases Proceedings of the 11th international conference on Extending database technology: Advances in database technology, (380-391)
  781. ACM
    Ding B, Yu J and Qin L Finding time-dependent shortest paths over large graphs Proceedings of the 11th international conference on Extending database technology: Advances in database technology, (205-216)
  782. ACM
    Cheng J, Yu J, Lin X, Wang H and Yu P Fast computing reachability labelings for large graphs with high compression rate Proceedings of the 11th international conference on Extending database technology: Advances in database technology, (193-204)
  783. Zou L, Chen L, Zhang H, Lu Y and Lou Q Summarization graph indexing Proceedings of the 13th international conference on Database systems for advanced applications, (141-155)
  784. ACM
    He X, Shafiq B, Vaidya J and Adam N Privacy-preserving link discovery Proceedings of the 2008 ACM symposium on Applied computing, (909-915)
  785. ACM
    de la Rocha F and de Oliveira R An environment for the rapid development of embedded file systems Proceedings of the 2008 ACM symposium on Applied computing, (694-699)
  786. ACM
    Kulkarni M, Pingali K, Ramanarayanan G, Walter B, Bala K and Chew L Optimistic parallelism benefits from data partitioning Proceedings of the 13th international conference on Architectural support for programming languages and operating systems, (233-243)
  787. ACM
    Ottoni G and August D Communication optimizations for global multi-threaded instruction scheduling Proceedings of the 13th international conference on Architectural support for programming languages and operating systems, (222-232)
  788. ACM
    Tuck J, Ahn W, Ceze L and Torrellas J SoftSig Proceedings of the 13th international conference on Architectural support for programming languages and operating systems, (145-156)
  789. ACM
    Hristidis V, Hwang H and Papakonstantinou Y (2008). Authority-based keyword search in databases, ACM Transactions on Database Systems, 33:1, (1-40), Online publication date: 1-Mar-2008.
  790. ACM
    Pettie S and Ramachandran V (2008). Randomized minimum spanning tree algorithms using exponentially fewer random bits, ACM Transactions on Algorithms, 4:1, (1-27), Online publication date: 1-Mar-2008.
  791. Janowska A and Penczek W (2007). Path Compression in Timed Automata, Fundamenta Informaticae, 79:3-4, (379-399), Online publication date: 1-Feb-2008.
  792. ACM
    Egger B, Lee J and Shin H (2008). Dynamic scratchpad memory management for code in portable systems with an MMU, ACM Transactions on Embedded Computing Systems, 7:2, (1-38), Online publication date: 1-Feb-2008.
  793. Yang S (2008). Constrained-storage multistage vector quantization based on genetic algorithms, Pattern Recognition, 41:2, (689-700), Online publication date: 1-Feb-2008.
  794. Barnat J, Chaloupka J and van de Pol J (2008). Improved Distributed Algorithms for SCC Decomposition, Electronic Notes in Theoretical Computer Science (ENTCS), 198:1, (63-77), Online publication date: 1-Feb-2008.
  795. Wang K, Fang H, Xu H and Cheng X A fast incremental clock skew scheduling algorithm for slack optimization Proceedings of the 2008 Asia and South Pacific Design Automation Conference, (492-497)
  796. Baswana S and Sarkar S Fully dynamic algorithm for graph spanners with poly-logarithmic update time Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (1125-1134)
  797. Emek Y, Peleg D and Roditty L A near-linear time algorithm for computing replacement paths in planar directed graphs Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (428-435)
  798. Siirtola A and Valenta M Verifying parameterized taDOM+ lock managers Proceedings of the 34th conference on Current trends in theory and practice of computer science, (460-472)
  799. ACM
    Acar U, Ahmed A and Blume M (2008). Imperative self-adjusting computation, ACM SIGPLAN Notices, 43:1, (309-322), Online publication date: 14-Jan-2008.
  800. Bagnara R, Hill P and Zaffanella E An improved tight closure algorithm for integer octagonal constraints Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation, (8-21)
  801. ACM
    Acar U, Ahmed A and Blume M Imperative self-adjusting computation Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (309-322)
  802. Leporati A and Gutiérrez-Naranjo M (2008). Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources, Fundamenta Informaticae, 87:1, (61-77), Online publication date: 1-Jan-2008.
  803. Ciobanu G and Resios A (2008). Computational Complexity of Simple P Systems, Fundamenta Informaticae, 87:1, (49-59), Online publication date: 1-Jan-2008.
  804. Amir A, Levy A and Reuveni L (2008). The Practical Efficiency of Convolutions in Pattern Matching Algorithms, Fundamenta Informaticae, 84:1, (1-15), Online publication date: 1-Jan-2008.
  805. Ésik Z and Iván S (2008). Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics, Fundamenta Informaticae, 82:1-2, (79-103), Online publication date: 1-Jan-2008.
  806. Wang C, Joshi S and Khardon R (2008). First order decision diagrams for relational MDPs, Journal of Artificial Intelligence Research, 31:1, (431-472), Online publication date: 1-Jan-2008.
  807. Clarke J and Lapata M (2008). Global inference for sentence compression an integer linear programming approach, Journal of Artificial Intelligence Research, 31:1, (399-429), Online publication date: 1-Jan-2008.
  808. Giménez O and Jonsson A (2008). The complexity of planning problems with simple causal graphs, Journal of Artificial Intelligence Research, 31:1, (319-351), Online publication date: 1-Jan-2008.
  809. Adcock M, Chung J and Schmandt C AreWeThereYet? Proceedings of the ninth conference on Australasian user interface - Volume 76, (29-32)
  810. Sun X, Li M, Wang H and Plank A An efficient hash-based algorithm for minimal k-anonymity Proceedings of the thirty-first Australasian conference on Computer science - Volume 74, (101-107)
  811. Wainwright M and Jordan M (2008). Graphical Models, Exponential Families, and Variational Inference, Foundations and Trends® in Machine Learning, 1:1-2, (1-305), Online publication date: 1-Jan-2008.
  812. Yang Y, Wang J and Yang M (2008). A Service-Centric Multicast Architecture and Routing Protocol, IEEE Transactions on Parallel and Distributed Systems, 19:1, (35-51), Online publication date: 1-Jan-2008.
  813. Palshikar G Keyword extraction from a single document using centrality measures Proceedings of the 2nd international conference on Pattern recognition and machine intelligence, (503-510)
  814. Ajwani D and Friedrich T Average-case analysis of online topological ordering Proceedings of the 18th international conference on Algorithms and computation, (464-475)
  815. Belkhir W and Santocanale L Undirected graphs of entanglement 2 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science, (508-519)
  816. Belkhir W and Santocanale L Undirected Graphs of Entanglement 2 FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, (508-519)
  817. Awrangjeb M and Lu G Effective Corner Matching for Transformed Image Identification Advances in Multimedia Information Processing – PCM 2007, (765-774)
  818. Szöllösi L, Marosits T, Fehér G and Recski A Fast digital signature algorithm based on subgraph isomorphism Proceedings of the 6th international conference on Cryptology and network security, (34-46)
  819. Ozgul F, Bondy J and Aksoy H Mining for offender group detection and story of a police operation Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70, (189-193)
  820. ACM
    Koren Y, North S and Volinsky C (2007). Measuring and extracting proximity graphs in networks, ACM Transactions on Knowledge Discovery from Data, 1:3, (12-es), Online publication date: 1-Dec-2007.
  821. Jagannathan A and Miller E (2007). Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:12, (2195-2204), Online publication date: 1-Dec-2007.
  822. Kashima H (2007). Risk-Sensitive Learning via Minimization of Empirical Conditional Value-at-Risk, IEICE - Transactions on Information and Systems, E90-D:12, (2043-2052), Online publication date: 1-Dec-2007.
  823. Bang-Jensen J, GonçAlves D and Li GøRtz I (2007). Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Discrete Optimization, 4:3-4, (334-348), Online publication date: 1-Dec-2007.
  824. Radicioni D and Lombardo V (2007). A Constraint-based Approach for Annotating Music Scores with Gestural Information, Constraints, 12:4, (405-428), Online publication date: 1-Dec-2007.
  825. Montoya-Zegarra J, Papa J, Leite N, Da Silva Torres R and Falcão A Rotation-invariant texture recognition Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II, (193-204)
  826. Dunlop M, Gates C, Wong C and Wang C SWorD Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II, (1752-1769)
  827. Dolev S, Korach E and Uzan G Magnifying computing gaps Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems, (253-265)
  828. Zhang L, Liu Q, Zhang J, Wang H, Pan Y and Yu Y Semplore Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference, (652-665)
  829. ACM
    Kriegel H, Kröger P, Kunath P, Renz M and Schmidt T Proximity queries in large traffic networks Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems, (1-8)
  830. Cong G and Wen T Locality behavior of parallel and sequential algorithms for irregular graph problems Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems, (391-397)
  831. ACM
    Lempel R, Mass Y, Ofek-Koifman S, Sheinwald D, Petruschka Y and Sivan R Just in time indexing for up to the second search Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, (97-106)
  832. Yu P and Pan D TIP-OPC Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (847-853)
  833. Yan T and Wong M Untangling twisted nets for bus routing Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (396-400)
  834. Kong H, Yan T, Wong M and Ozdal M Optimal bus sequencing for escape routing in dense PCBs Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (390-395)
  835. ACM
    Vain J, Raiend K, Kull A and Ernits J Synthesis of test purpose directed reactive planning tester for nondeterministic systems Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering, (363-372)
  836. ACM
    Elkarablieh B, Garcia I, Suen Y and Khurshid S Assertion-based repair of complex data structures Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering, (64-73)
  837. ACM
    Elmqvist N, Tudoreanu M and Tsigas P Tour generation for exploration of 3D virtual environments Proceedings of the 2007 ACM symposium on Virtual reality software and technology, (207-210)
  838. ACM
    Fakcharoenphol J, Harrelson C and Rao S (2007). The k-traveling repairmen problem, ACM Transactions on Algorithms, 3:4, (40-es), Online publication date: 1-Nov-2007.
  839. Rusakov D (2007). Scheme inclusion verification algorithm in algebraic model of programs with constants, Programming and Computing Software, 33:6, (299-306), Online publication date: 1-Nov-2007.
  840. Cordasco G, Malewicz G and Rosenberg A (2007). Advances in IC-Scheduling Theory, IEEE Transactions on Parallel and Distributed Systems, 18:11, (1607-1617), Online publication date: 1-Nov-2007.
  841. Jiang G, Chen H and Yoshihira K (2007). Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems, IEEE Transactions on Knowledge and Data Engineering, 19:11, (1508-1523), Online publication date: 1-Nov-2007.
  842. ACM
    Pan M and Tseng Y The orphan problem in zigbee-based wireless sensor networks Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, (95-98)
  843. ACM
    Yang Y and Cardei M Movement-assisted sensor redeployment scheme for network lifetime increase Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, (13-20)
  844. Habermehl P, Iosif R, Rogalewicz A and Vojnar T Proving termination of tree manipulating programs Proceedings of the 5th international conference on Automated technology for verification and analysis, (145-161)
  845. Bouillard A, Gaujal B, Lagrange S and Thierry E Optimal routing for end-to-end guarantees Proceedings of the 2nd international conference on Performance evaluation methodologies and tools, (1-10)
  846. ACM
    Tang X and Järvi J Concept-based optimization Proceedings of the 2007 Symposium on Library-Centric Software Design, (97-108)
  847. ACM
    Elkarablieh B, Khurshid S, Vu D and McKinley K (2007). Starc, ACM SIGPLAN Notices, 42:10, (387-404), Online publication date: 21-Oct-2007.
  848. ACM
    Elkarablieh B, Khurshid S, Vu D and McKinley K Starc Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems, languages and applications, (387-404)
  849. Morimoto Y Geometrical information fusion from WWW and its related information Proceedings of the 5th international conference on Databases in networked information systems, (16-32)
  850. ACM
    Jayant C, Renzelmann M, Wen D, Krisnandi S, Ladner R and Comden D Automated tactile graphics translation Proceedings of the 9th international ACM SIGACCESS conference on Computers and accessibility, (75-82)
  851. ACM
    Chong S, Liu J, Myers A, Qi X, Vikram K, Zheng L and Zheng X (2007). Secure web applications via automatic partitioning, ACM SIGOPS Operating Systems Review, 41:6, (31-44), Online publication date: 14-Oct-2007.
  852. ACM
    Chong S, Liu J, Myers A, Qi X, Vikram K, Zheng L and Zheng X Secure web applications via automatic partitioning Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, (31-44)
  853. Muller L and Zachariasen M Fast and compact oracles for approximate distances in planar graphs Proceedings of the 15th annual European conference on Algorithms, (657-668)
  854. Franceschini G, Muthukrishnan S and Pătraşcu M Radix sorting with no extra space Proceedings of the 15th annual European conference on Algorithms, (194-205)
  855. Clifford R, Efremenko K, Porat E and Rothschild A K-mismatch with don't cares Proceedings of the 15th annual European conference on Algorithms, (151-162)
  856. ACM
    Dunfield J Refined typechecking with Stardust Proceedings of the 2007 workshop on Programming languages meets program verification, (21-32)
  857. ACM
    Conchon S and Filliâtre J A persistent union-find data structure Proceedings of the 2007 workshop on Workshop on ML, (37-46)
  858. ACM
    Pal R (2007). RKPianGraphSort, Ubiquity, 2007:October, (1-16), Online publication date: 1-Oct-2007.
  859. ACM
    Pirkelbauer P, Solodkyy Y and Stroustrup B Open multi-methods for c++ Proceedings of the 6th international conference on Generative programming and component engineering, (123-134)
  860. ACM
    Thaker S, Batory D, Kitchin D and Cook W Safe composition of product lines Proceedings of the 6th international conference on Generative programming and component engineering, (95-104)
  861. Hong B and Prasanna V (2007). Adaptive Allocation of Independent Tasks to Maximize Throughput, IEEE Transactions on Parallel and Distributed Systems, 18:10, (1420-1435), Online publication date: 1-Oct-2007.
  862. Chellappan S, Gu W, Bai X, Xuan D, Ma B and Zhang K (2007). Deploying Wireless Sensor Networks under Limited Mobility Constraints, IEEE Transactions on Mobile Computing, 6:10, (1142-1157), Online publication date: 1-Oct-2007.
  863. Haleem M, Mathur C, Chandramouli R and Subbalakshmi K (2007). Opportunistic Encryption, IEEE Transactions on Dependable and Secure Computing, 4:4, (313-324), Online publication date: 1-Oct-2007.
  864. Aydin H (2007). Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks, IEEE Transactions on Computers, 56:10, (1372-1386), Online publication date: 1-Oct-2007.
  865. Blin G, Fertin G and Vialette S (2007). Extracting constrained 2-interval subsets in 2-interval sets, Theoretical Computer Science, 385:1-3, (241-263), Online publication date: 1-Oct-2007.
  866. Khan M, Pandurangan G and Anil Kumar V (2007). A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms, Theoretical Computer Science, 385:1-3, (101-114), Online publication date: 1-Oct-2007.
  867. André Y, Caron A, Debarbieux D, Roos Y and Tison S (2007). Path constraints in semistructured data, Theoretical Computer Science, 385:1-3, (11-33), Online publication date: 1-Oct-2007.
  868. Wang B, Wei W, Kurose J, Towsley D, Pattipati K, Guo Z and Peng Z (2007). Application-layer multipath data transfer via TCP, Performance Evaluation, 64:9-12, (965-977), Online publication date: 1-Oct-2007.
  869. Couprie M, Coeurjolly D and Zrour R (2007). Discrete bisector function and Euclidean skeleton in 2D and 3D, Image and Vision Computing, 25:10, (1543-1556), Online publication date: 1-Oct-2007.
  870. Zhang W, Cao G and La Porta T (2007). Dynamic proxy tree-based data dissemination schemes for wireless sensor networks, Wireless Networks, 13:5, (583-595), Online publication date: 1-Oct-2007.
  871. ACM
    Xu R, Melhem R and Mossé D A unified practical approach to stochastic DVS scheduling Proceedings of the 7th ACM & IEEE international conference on Embedded software, (37-46)
  872. ACM
    Xiang S, Lim H, Tan K and Zhou Y Similarity-aware query allocation in sensor networks with multiple base stations Proceedings of the 4th workshop on Data management for sensor networks: in conjunction with 33rd International Conference on Very Large Data Bases, (1-6)
  873. Bansal N, Chiang F, Koudas N and Tompa F Seeking stable clusters in the blogosphere Proceedings of the 33rd international conference on Very large data bases, (806-817)
  874. Tatikonda S, Parthasarathy S and Goyder M LCS-TRIM Proceedings of the 33rd international conference on Very large data bases, (63-74)
  875. ACM
    Agarwal P and Prabhakaran B Robust blind watermarking mechanism for point sampled geometry Proceedings of the 9th workshop on Multimedia & security, (175-186)
  876. Suter F Scheduling ?-Critical Tasks in mixed-parallel applications on a national grid Proceedings of the 8th IEEE/ACM International Conference on Grid Computing, (2-9)
  877. Kwok T and Kwok Y Design and evaluation of parallel string matching algorithms for network intrusion detection systems Proceedings of the 2007 IFIP international conference on Network and parallel computing, (344-353)
  878. Wang X, Cai S and Huang M A small-world optimization algorithm based and ABC supported QoS unicast routing scheme Proceedings of the 2007 IFIP international conference on Network and parallel computing, (242-249)
  879. Barakhnin V, Nekhaeva V and Fedotov A Similarity determination for clustering textual documents Proceedings of the First international conference on Knowledge processing and data analysis, (271-279)
  880. ACM
    Li L, Yang Z, Somboonviwat K and Kitsuregawa M User-assisted similarity estimation for searching related web pages Proceedings of the eighteenth conference on Hypertext and hypermedia, (11-20)
  881. Wichulski M and Rokicki J Persistent data structures for fast point location Proceedings of the 7th international conference on Parallel processing and applied mathematics, (1333-1340)
  882. Kerdels J and Peters G A topology-independent similarity measure for high-dimensional feature spaces Proceedings of the 17th international conference on Artificial neural networks, (331-340)
  883. ACM
    Bhandari V and Vaidya N Capacity of multi-channel wireless networks with random (c, f) assignment Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, (229-238)
  884. ACM
    Uzuncaova E, Garcia D, Khurshid S and Batory D A specification-based approach to testing software product lines Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (525-528)
  885. Bailey M, Oberheide J, Andersen J, Mao Z, Jahanian F and Nazario J Automated classification and analysis of internet malware Proceedings of the 10th international conference on Recent advances in intrusion detection, (178-197)
  886. Chabini N A Heuristic for reducing dynamic power dissipation in clocked sequential designs Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation, (64-74)
  887. Lopes N and Baquero C Implementing range queries with a decentralized balanced tree over distributed hash tables Proceedings of the 1st international conference on Network-based information systems, (197-206)
  888. ACM
    Uzuncaova E, Garcia D, Khurshid S and Batory D A specification-based approach to testing software product lines The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers, (525-528)
  889. ACM
    Huang S and Nieh Y (2007). Clock skew scheduling with race conditions considered, ACM Transactions on Design Automation of Electronic Systems, 12:4, (45-es), Online publication date: 1-Sep-2007.
  890. ACM
    Staschulat J and Ernst R (2007). Scalable precision cache analysis for real-time software, ACM Transactions on Embedded Computing Systems, 6:4, (25-es), Online publication date: 1-Sep-2007.
  891. Ma F, Bajger M, Slavotinek J and Bottema M (2007). Two graph theory based methods for identifying the pectoral muscle in mammograms, Pattern Recognition, 40:9, (2592-2602), Online publication date: 1-Sep-2007.
  892. Berry V and Nicolas F (2007). Maximum agreement and compatible supertrees, Journal of Discrete Algorithms, 5:3, (564-591), Online publication date: 1-Sep-2007.
  893. Kelarev A (2007). Algorithms for computing parameters of graph-based extensions of BCH codes, Journal of Discrete Algorithms, 5:3, (553-563), Online publication date: 1-Sep-2007.
  894. Deri L (2007). High-Speed Dynamic Packet Filtering, Journal of Network and Systems Management, 15:3, (401-415), Online publication date: 1-Sep-2007.
  895. Kim K, Shim J and Lee I Cache conscious trees Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I, (189-200)
  896. ACM
    Dastidar T and Chakrabarti P (2008). A verification system for transient response of analog circuits, ACM Transactions on Design Automation of Electronic Systems, 12:3, (1-39), Online publication date: 17-Aug-2007.
  897. Roy S, Das G and Das S Computing best coverage path in the presence of obstacles in a sensor field Proceedings of the 10th international conference on Algorithms and Data Structures, (577-588)
  898. ACM
    Chang X and Yang X An efficient regularization approach for underdetermined MIMO system decoding Proceedings of the 2007 international conference on Wireless communications and mobile computing, (349-353)
  899. ACM
    Masry M, Kang D and Lipson H A freehand sketching interface for progressive construction of 3D objects ACM SIGGRAPH 2007 courses, (30-es)
  900. ACM
    Xu J and Kaplan C Image-guided maze construction ACM SIGGRAPH 2007 papers, (29-es)
  901. Janowska A and Penczek W (2007). Path Compression in Timed Automata, Fundamenta Informaticae, 79:3-4, (379-399), Online publication date: 1-Aug-2007.
  902. Khatib L, Morris P, Morris R, Rossi F, Sperduti A and Venable K (2007). Solving and learning a tractable class of soft temporal constraints: Theoretical and experimental results, AI Communications, 20:3, (181-209), Online publication date: 1-Aug-2007.
  903. Corazza A and Satta G (2007). Probabilistic Context-Free Grammars Estimated from Infinite Distributions, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:8, (1379-1393), Online publication date: 1-Aug-2007.
  904. Bortnikov E, Cidon I and Keidar I (2007). Nomadic Service Assignment, IEEE Transactions on Mobile Computing, 6:8, (915-928), Online publication date: 1-Aug-2007.
  905. Lao L, Cui J and Gerla M (2007). Tackling group-to-tree matching in large scale group communications, Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:11, (3069-3089), Online publication date: 1-Aug-2007.
  906. Elkarablieh B, Zayour Y and Khurshid S Efficiently generating structurally complex inputs with thousands of objects Proceedings of the 21st European conference on Object-Oriented Programming, (248-272)
  907. ACM
    Xu J and Kaplan C (2007). Image-guided maze construction, ACM Transactions on Graphics, 26:3, (29-es), Online publication date: 29-Jul-2007.
  908. ACM
    Frigo M Multithreaded programming in Cilk Proceedings of the 2007 international workshop on Parallel symbolic computation, (13-14)
  909. Šeda M An implementation view on job shop scheduling based on CPM Proceedings of the 11th WSEAS International Conference on Computers, (542-547)
  910. Marinescu D, Iacob P and Kiss-Iakab K A topological order for a rectangular covering problem Proceedings of the 11th WSEAS International Conference on Computers, (82-85)
  911. Lee C, Wu Y and Chen A Continuous evaluation of fastest path queries on road networks Proceedings of the 10th international conference on Advances in spatial and temporal databases, (20-37)
  912. Jääskeläinen P, Guzma V and Takala J Resource conflict detection in simulation of function unit pipelines Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation, (233-240)
  913. Vardi M Linear-time model checking Proceedings of the 12th international conference on Implementation and application of automata, (5-10)
  914. Mazumder S, Acharya K and Tahir M Network reconfiguration of distributed controlled homogenous power inverter network using composite Lyapunov function based reachability bound Proceedings of the 2007 Summer Computer Simulation Conference, (76-87)
  915. ACM
    Fischer S and Kuchen H Systematic generation of glass-box test cases for functional logic programs Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, (63-74)
  916. ACM
    Cho H, Egger B, Lee J and Shin H (2007). Dynamic data scratchpad memory management for a memory subsystem with an MMU, ACM SIGPLAN Notices, 42:7, (195-206), Online publication date: 13-Jul-2007.
  917. ACM
    Xu W and Tessier R (2007). Tetris, ACM SIGPLAN Notices, 42:7, (113-122), Online publication date: 13-Jul-2007.
  918. Iliopoulos C, Kubica M, Rahman M and Waleń T Algorithms for computing the longest parameterized common subsequence Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (265-273)
  919. Amir A, Kapah O and Porat E Deterministic length reduction Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (183-194)
  920. Clifford P and Clifford R Self-normalised distance with don't cares Proceedings of the 18th annual conference on Combinatorial Pattern Matching, (63-70)
  921. ACM
    Banerjee N and Kumar R Multiobjective network design for realistic traffic models Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1904-1911)
  922. ACM
    Vieira C and Fonseca C A unified model of optimisation problems Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1537-1537)
  923. ACM
    Jansen T and Weyland D Analysis of evolutionary algorithms for the longest common subsequence problem Proceedings of the 9th annual conference on Genetic and evolutionary computation, (939-946)
  924. Rose K, Sheffer A, Wither J, Cani M and Thibert B Developable surfaces from arbitrary sketched boundaries Proceedings of the fifth Eurographics symposium on Geometry processing, (163-172)
  925. Ganesh V and Dill D A decision procedure for bit-vectors and arrays Proceedings of the 19th international conference on Computer aided verification, (519-531)
  926. Chen G, Mischaikow K, Laramee R, Pilarczyk P and Zhang E (2007). Vector Field Editing and Periodic Orbit Extraction Using Morse Decomposition, IEEE Transactions on Visualization and Computer Graphics, 13:4, (769-785), Online publication date: 1-Jul-2007.
  927. Cordasco G, Scarano V and Rosenberg A (2007). Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories, IEEE Transactions on Parallel and Distributed Systems, 18:7, (973-982), Online publication date: 1-Jul-2007.
  928. Fredriksson K, Mäkinen V and Navarro G (2007). Rotation and lighting invariant template matching, Information and Computation, 205:7, (1096-1113), Online publication date: 1-Jul-2007.
  929. Wang C, Chang C, Zhang X and Jan J Senary Huffman compression - a reversible data hiding scheme for binary images Proceedings of the 2007 international conference on Multimedia content analysis and mining, (351-360)
  930. Zhang Y, Kordoni V and Fitzgerald E Partial parse selection for robust deep processing Proceedings of the Workshop on Deep Linguistic Processing, (128-135)
  931. Blieberger J, Burgstaller B and Mittermayr R Static detection of Livelocks in Ada multitasking programs Proceedings of the 12th international conference on Reliable software technologies, (69-83)
  932. Cardinal P, Boulianne G, Comeau M and Boisvert M Real-time correction of closed-captions Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions, (113-116)
  933. McDonald R and Satta G On the complexity of non-projective data-driven dependency parsing Proceedings of the 10th International Conference on Parsing Technologies, (121-132)
  934. Mould D Stipple placement using distance in a weighted graph Proceedings of the Third Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging, (45-52)
  935. ACM
    Kirshner S and Smyth P Infinite mixtures of trees Proceedings of the 24th international conference on Machine learning, (417-423)
  936. ACM
    Esposito R and Radicioni D CarpeDiem Proceedings of the 24th international conference on Machine learning, (257-264)
  937. ACM
    Chen L and Crampton J Inter-domain role mapping and least privilege Proceedings of the 12th ACM symposium on Access control models and technologies, (157-162)
  938. Hafeez M, Younus M, Rehman A and Mohsin A Optimal solution to matrix parenthesization problem employing parallel processing approach Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8, (235-240)
  939. Thouin F and Coates M Video-on-demand server selection and placement Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks, (18-29)
  940. ACM
    Cho H, Egger B, Lee J and Shin H Dynamic data scratchpad memory management for a memory subsystem with an MMU Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, (195-206)
  941. ACM
    Xu W and Tessier R Tetris Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, (113-122)
  942. Solnon C and Jolion J Generalized vs set median strings for histogram-based distances Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition, (404-414)
  943. Alves C, Cáceres E and Song S Efficient representations of row-sorted 1-variant matrices for parallel string applications Proceedings of the 7th international conference on Algorithms and architectures for parallel processing, (60-71)
  944. ACM
    Trißl S and Leser U Fast and practical indexing and querying of very large graphs Proceedings of the 2007 ACM SIGMOD international conference on Management of data, (845-856)
  945. Kosmopoulos D and Tzevelekou F Automated Pressure Ulcer Lesion Diagnosis Proceedings of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies, (214-226)
  946. ACM
    Fraigniaud P, Korman A and Lebhar E Local MST computation with short advice Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (154-160)
  947. Asgeirsson E and Stein C Vertex cover approximations on random graphs Proceedings of the 6th international conference on Experimental algorithms, (285-296)
  948. ACM
    Bauer L, Shafique M, Kramer S and Henkel J RISPP Proceedings of the 44th annual Design Automation Conference, (791-796)
  949. ACM
    Ozdal M Escape routing for dense pin clusters in integrated circuits Proceedings of the 44th annual Design Automation Conference, (49-54)
  950. Manna Z, Sipma H and Zhang T Verifying Balanced Trees Proceedings of the international symposium on Logical Foundations of Computer Science, (363-378)
  951. Bresina J and Morris P (2007). Mixed‐Initiative Planning in Space Mission Operations, AI Magazine, 28:2, (75-88), Online publication date: 1-Jun-2007.
  952. ACM
    Deligiannakis A, Garofalakis M and Roussopoulos N (2007). Extended wavelets for multiple measures, ACM Transactions on Database Systems, 32:2, (10-es), Online publication date: 1-Jun-2007.
  953. ACM
    Conitzer V, Sandholm T and Lang J (2007). When are elections with few candidates hard to manipulate?, Journal of the ACM, 54:3, (14-es), Online publication date: 1-Jun-2007.
  954. ACM
    Andersson A and Thorup M (2007). Dynamic ordered sets with exponential search trees, Journal of the ACM, 54:3, (13-es), Online publication date: 1-Jun-2007.
  955. Dimitrakopoulos G, Mavrokefalidis C, Galanopoulos K and Nikolos D (2007). Sorter based permutation units for media-enhanced microprocessors, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 15:6, (711-715), Online publication date: 1-Jun-2007.
  956. Corral A and Almendros-Jiménez J (2007). A performance comparison of distance-based query algorithms using R-trees in spatial databases, Information Sciences: an International Journal, 177:11, (2207-2237), Online publication date: 1-Jun-2007.
  957. Caballero R, Hermanns C and Kuchen H (2007). Algorithmic Debugging of Java Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 177, (75-89), Online publication date: 1-Jun-2007.
  958. Bengtsson F and Chen J (2007). Ranking k maximum sums, Theoretical Computer Science, 377:1-3, (229-237), Online publication date: 25-May-2007.
  959. Lin T and Lee D (2007). Randomized algorithm for the sum selection problem, Theoretical Computer Science, 377:1-3, (151-156), Online publication date: 25-May-2007.
  960. Zaraket F, Aziz A and Khurshid S Sequential Circuits for Relational Analysis Proceedings of the 29th international conference on Software Engineering, (13-22)
  961. Uzuncaova E and Khurshid S Kato Proceedings of the 29th international conference on Software Engineering, (767-770)
  962. Di S, Jin H, Li S, Tie J and Chen L Efficient time series data classification and compression in distributed monitoring Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining, (389-400)
  963. Nakano S, Uehara R and Uno T Efficient algorithms for airline problem Proceedings of the 4th international conference on Theory and applications of models of computation, (428-439)
  964. Stroggylos K and Spinellis D Refactoring--Does It Improve Software Quality? Proceedings of the 5th International Workshop on Software Quality
  965. Ren Y, Wang B, Zhang S and Zhang H A distributed energy-efficient topology control routing for mobile wireless sensor networks Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet, (132-142)
  966. Wu H, Mao F, Olman V and Xu Y An algorithm for hierarchical classification of genes of prokaryotic genomes Proceedings of the 3rd international conference on Bioinformatics research and applications, (551-563)
  967. Wu X, Ragheb T, Aziz A and Massoud Y Implementing DSP Algorithms with On-Chip Networks Proceedings of the First International Symposium on Networks-on-Chip, (307-316)
  968. Grauman K and Darrell T (2007). The Pyramid Match Kernel: Efficient Learning with Sets of Features, The Journal of Machine Learning Research, 8, (725-760), Online publication date: 1-May-2007.
  969. Yanagisawa H (2007). The material allocation problem in the steel industry, IBM Journal of Research and Development, 51:3, (363-374), Online publication date: 1-May-2007.
  970. Bachmaier C (2007). A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information, IEEE Transactions on Visualization and Computer Graphics, 13:3, (583-594), Online publication date: 1-May-2007.
  971. Hwang S and Chang K (2007). Probe Minimization by Schedule Optimization, IEEE Transactions on Knowledge and Data Engineering, 19:5, (646-662), Online publication date: 1-May-2007.
  972. Bhandari V and Vaidya N Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (785-793)
  973. Banerjee N, Corner M and Levine B An Energy-Efficient Architecture for DTN Throwboxes Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (776-784)
  974. Bhandari V and Vaidya N Reliable Broadcast in Wireless Networks with Probabilistic Failures Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (715-723)
  975. Sertac Artan N and Chao H TriBiCa Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (125-133)
  976. Yunfeng Lin , Ben Liang and Baochun Li Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (1658-1666)
  977. Djukic P and Valaee S Link Scheduling for Minimum Delay in Spatial Re-Use TDMA Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (28-36)
  978. Starobinski D, Weiyao Xiao , Xiangping Qin and Trachtenberg A Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, (955-963)
  979. Zhang H and Gildea D Factorization of synchronous context-free grammars in linear time Proceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation, (25-32)
  980. Zhu H, Zeng X, Cai W, Xue J and Zhou D A sparse grid based spectral stochastic collocation method for variations-aware capacitance extraction of interconnects under nanometer process technology Proceedings of the conference on Design, automation and test in Europe, (1514-1519)
  981. Mogal H and Bazargan K Microarchitecture floorplanning for sub-threshold leakage reduction Proceedings of the conference on Design, automation and test in Europe, (1238-1243)
  982. Safarpour S and Veneris A Abstraction and refinement techniques in automated design debugging Proceedings of the conference on Design, automation and test in Europe, (1182-1187)
  983. Lee I, Shim J, Lee S and Chun J CST-trees Proceedings of the 12th international conference on Database systems for advanced applications, (398-409)
  984. McDonald R A study of global inference algorithms in multi-document summarization Proceedings of the 29th European conference on IR research, (557-564)
  985. Jayaputera G, Loke S and Zaslavsky A (2007). Design, implementation and run-time evolution of a mission-based multiagent system, Web Intelligence and Agent Systems, 5:2, (139-159), Online publication date: 1-Apr-2007.
  986. Kim E, Yum K, Das C, Yousif M and Duato J (2007). Exploring IBA Design Space for Improved Performance, IEEE Transactions on Parallel and Distributed Systems, 18:4, (498-510), Online publication date: 1-Apr-2007.
  987. Raghavachari M and Shmueli O (2007). Efficient Revalidation of XML Documents, IEEE Transactions on Knowledge and Data Engineering, 19:4, (554-567), Online publication date: 1-Apr-2007.
  988. Nieuwenhuis R and Oliveras A (2007). Fast congruence closure and extensions, Information and Computation, 205:4, (557-580), Online publication date: 1-Apr-2007.
  989. Lee J, Chen M and Sun Y (2007). WF2Q-M, Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:6, (1403-1420), Online publication date: 1-Apr-2007.
  990. Darbon J A note on the discrete binary Mumford-Shah model Proceedings of the 3rd international conference on Computer vision/computer graphics collaboration techniques, (283-294)
  991. Malik M, Pervaiz A and Khurshid S Generating representation invariants of structurally complex data Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (34-49)
  992. Roşu G An effective algorithm for the membership problem for extended regular expressions Proceedings of the 10th international conference on Foundations of software science and computational structures, (332-345)
  993. ACM
    Gupta G and Rajopadhye S The Z-polyhedral model Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming, (237-248)
  994. ACM
    Hu Y, Xiao Z and Panda B Modeling deceptive information dissemination using a holistic approach Proceedings of the 2007 ACM symposium on Applied computing, (1591-1598)
  995. ACM
    Kheirabadi H and Zamani M An efficient net ordering algorithm for buffer insertion Proceedings of the 17th ACM Great Lakes symposium on VLSI, (521-524)
  996. ACM
    Farmahini-Farahani A, Kamal M, Fakhraie S and Safari S HW/SW partitioning using discrete particle swarm Proceedings of the 17th ACM Great Lakes symposium on VLSI, (359-364)
  997. Dice D and Shavit N Understanding Tradeoffs in Software Transactional Memory Proceedings of the International Symposium on Code Generation and Optimization, (21-33)
  998. Bouchez F, Darte A and Rastello F On the Complexity of Register Coalescing Proceedings of the International Symposium on Code Generation and Optimization, (102-114)
  999. Harada K, Sakuma J, Ono I and Kobayashi S Constraint-handling method for multi-objective function optimization Proceedings of the 4th international conference on Evolutionary multi-criterion optimization, (156-170)
  1000. Stewart K and Tragoudas S (2007). Managing the power resources of sensor networks with performance considerations, Computer Communications, 30:5, (1122-1135), Online publication date: 1-Mar-2007.
  1001. ACM
    Jacox E and Samet H (2007). Spatial join techniques, ACM Transactions on Database Systems, 32:1, (7-es), Online publication date: 1-Mar-2007.
  1002. Xiang Luo , Iyengar R and Kar K Channel Assignment for Maximum Throughput in Multi-Channel Access Point Networks Proceedings of the 2007 IEEE Wireless Communications and Networking Conference, (395-400)
  1003. Bang-Jensen J, Huang J and Ibarra L (2007). Recognizing and representing proper interval graphs in parallel using merging and sorting, Discrete Applied Mathematics, 155:4, (442-456), Online publication date: 20-Feb-2007.
  1004. ACM
    Zhu K Post-route LUT output polarity selection for timing optimization Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays, (89-96)
  1005. Vacariu L, Roman F, Timar M, Stanciu T, Banabic R and Cret O Mobile robot path-planning implementation in software and hardware Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation, (140-145)
  1006. Vacariu L, Roman F, Timar M, Stanciu T, Banabic R and Cret O Mobile robot path-planning implementation in software and hardware Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation, (140-145)
  1007. Ribeiro C, Martins S and Rosseti I (2007). Metaheuristics for optimization problems in computer communications, Computer Communications, 30:4, (656-669), Online publication date: 15-Feb-2007.
  1008. D'alberto P and Nicolau A (2007). R-Kleene, Algorithmica, 47:2, (203-213), Online publication date: 1-Feb-2007.
  1009. Chellappan S, Bai X, Ma B, Xuan D and Xu C (2007). Mobility Limited Flip-Based Sensor Networks Deployment, IEEE Transactions on Parallel and Distributed Systems, 18:2, (199-211), Online publication date: 1-Feb-2007.
  1010. Bayerl P and Neumann H (2007). A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:2, (246-260), Online publication date: 1-Feb-2007.
  1011. Soedarmadji E Worst-Case Routing Performance Evaluation of Sensor Networks Proceedings of the 2007 IEEE Sensors Applications Symposium, (1-5)
  1012. Pelc A and Peleg D (2007). Feasibility and complexity of broadcasting with random transmission failures, Theoretical Computer Science, 370:1-3, (279-292), Online publication date: 1-Feb-2007.
  1013. Chi C and Hao R (2007). Test generation for interaction detection in feature-rich communication systems, Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:2, (426-438), Online publication date: 1-Feb-2007.
  1014. Bose P and Devroye L (2007). On the stabbing number of a random Delaunay triangulation, Computational Geometry: Theory and Applications, 36:2, (89-105), Online publication date: 1-Feb-2007.
  1015. Melton H and Tempero E JooJ Proceedings of the thirtieth Australasian conference on Computer science - Volume 62, (87-95)
  1016. Clifford R and Sach B Fast Approximate Point Set Matching for Information Retrieval Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (212-223)
  1017. ACM
    Ellner S and Taha W The semantics of graphical languages Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (122-133)
  1018. Péron M and Halbwachs N An abstract domain extending difference-bound matrices with disequality constraints Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (268-282)
  1019. Vardi M Automata-theoretic model checking revisited Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (137-150)
  1020. Even-Bar E, Kearns M and Suri S A network formation game for bipartite exchange economies Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (697-706)
  1021. Minnen D, Starner T, Essa I and Isbell C Improving activity discovery with automatic neighborhood estimation Proceedings of the 20th international joint conference on Artifical intelligence, (2814-2819)
  1022. Sun X and Koenig S The fringe-saving A* search algorithm Proceedings of the 20th international joint conference on Artifical intelligence, (2391-2397)
  1023. Lang J, Pini M, Rossi F, Venable K and Walsh T Winner determination in sequential majority voting Proceedings of the 20th international joint conference on Artifical intelligence, (1372-1377)
  1024. Gupta R, Bagchi A and Sarkar S (2007). Improving Linkage of Web Pages, INFORMS Journal on Computing, 19:1, (127-136), Online publication date: 1-Jan-2007.
  1025. ACM
    Ben-Amram A and Lee C (2007). Program termination analysis in polynomial time, ACM Transactions on Programming Languages and Systems, 29:1, (1-37), Online publication date: 1-Jan-2007.
  1026. Ramanarayanan G and Bala K (2007). Constrained Texture Synthesis via Energy Minimization, IEEE Transactions on Visualization and Computer Graphics, 13:1, (167-178), Online publication date: 1-Jan-2007.
  1027. Chandrasekaran H, Li J, Delashmit W, Narasimha P, Yu C and Manry M (2007). Convergent design of piecewise linear neural networks, Neurocomputing, 70:4-6, (1022-1039), Online publication date: 1-Jan-2007.
  1028. Cong G and Sbaraglia S A study on the locality behavior of minimum spanning tree algorithms Proceedings of the 13th international conference on High Performance Computing, (583-594)
  1029. Wu B (2006). On the intercluster distance of a tree metric, Theoretical Computer Science, 369:1, (136-141), Online publication date: 15-Dec-2006.
  1030. Dechev D, Pirkelbauer P and Stroustrup B Lock-free dynamically resizable arrays Proceedings of the 10th international conference on Principles of Distributed Systems, (142-156)
  1031. Yao D, Frikken K, Atallah M and Tamassia R Point-based trust Proceedings of the 8th international conference on Information and Communications Security, (190-209)
  1032. Schellekens M, Agarwal R, Popovici E and Man K (2006). A simplified derivation of timing complexity lower bounds for sorting by comparisons, Nordic Journal of Computing, 13:4, (340-346), Online publication date: 1-Dec-2006.
  1033. Shalev-Shwartz S and Singer Y (2006). Efficient Learning of Label Ranking by Soft Projections onto Polyhedra, The Journal of Machine Learning Research, 7, (1567-1599), Online publication date: 1-Dec-2006.
  1034. ACM
    Jiao Y (2006). Maintaining stream statistics over multiscale sliding windows, ACM Transactions on Database Systems, 31:4, (1305-1334), Online publication date: 1-Dec-2006.
  1035. Mei A and Rizzi R (2006). Online Permutation Routing in Partitioned Optical Passive Star Networks, IEEE Transactions on Computers, 55:12, (1557-1571), Online publication date: 1-Dec-2006.
  1036. Ferreira L, Kaszkurewicz E and Bhaya A (2006). Support vector classifiers via gradient systems with discontinuous righthand sides, Neural Networks, 19:10, (1612-1623), Online publication date: 1-Dec-2006.
  1037. Guo J, Gramm J, Hüffner F, Niedermeier R and Wernicke S (2006). Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Journal of Computer and System Sciences, 72:8, (1386-1396), Online publication date: 1-Dec-2006.
  1038. Darbon J and Sigelle M (2006). Image Restoration with Discrete Constrained Total Variation Part I, Journal of Mathematical Imaging and Vision, 26:3, (261-276), Online publication date: 1-Dec-2006.
  1039. Kurbán M, Niebert P, Qu H and Vogler W Stronger reduction criteria for local first search Proceedings of the Third international conference on Theoretical Aspects of Computing, (108-122)
  1040. Chaieb A Proof-producing program analysis Proceedings of the Third international conference on Theoretical Aspects of Computing, (287-301)
  1041. ACM
    Desai R, Yang Q, Wu Z, Meng W and Yu C Identifying redundant search engines in a very large scale metasearch engine context Proceedings of the 8th annual ACM international workshop on Web information and data management, (51-58)
  1042. ACM
    Geerts F, Revesz P and Van den Bussche J On-line maintenance of simplified weighted graphs for efficient distance queries Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems, (203-210)
  1043. Ginat D On novices' local views of algorithmic characteristics Proceedings of the 2006 international conference on Informatics in Secondary Schools - Evolution and Perspectives: the Bridge between Using and Understanding Computers, (127-137)
  1044. Sarioz D, Kong T and Herman G History trees as descriptors of macromolecular structures Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I, (263-272)
  1045. ACM
    Tang X and Yuan X Technology migration techniques for simplified layouts with restrictive design rules Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, (655-660)
  1046. ACM
    Wei T, Mishra P, Wu K and Liang H Online task-scheduling for fault-tolerant low-energy real-time systems Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, (522-527)
  1047. ACM
    Murali S, Meloni P, Angiolini F, Atienza D, Carta S, Benini L, De Micheli G and Raffo L Designing application-specific networks on chips with floorplan information Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, (355-362)
  1048. ACM
    Lo D and Khoo S SMArTIC Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, (265-275)
  1049. Yeh P, Li J and Yuan S Tracking the changes of dynamic web pages in the existence of URL rewriting Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61, (169-176)
  1050. ACM
    Uzuncaova E and Khurshid S (2006). Program slicing for declarative models, ACM SIGSOFT Software Engineering Notes, 31:6, (1-2), Online publication date: 1-Nov-2006.
  1051. ACM
    Barbosa R and Rodrigues M Supporting guided navigation in mobile virtual environments Proceedings of the ACM symposium on Virtual reality software and technology, (220-226)
  1052. Lin C, Wang J and Zhou H (2006). Clustering for processing rate optimization, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 14:11, (1264-1275), Online publication date: 1-Nov-2006.
  1053. Eltayeb M, Dogan A and Ozguner F (2006). Concurrent Scheduling, IEEE Transactions on Parallel and Distributed Systems, 17:11, (1348-1359), Online publication date: 1-Nov-2006.
  1054. Franti P, Virmajoki O and Hautamaki V (2006). Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:11, (1875-1881), Online publication date: 1-Nov-2006.
  1055. Wu T, Tang K, Tang C and Wong T (2006). Dense Photometric Stereo, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:11, (1830-1846), Online publication date: 1-Nov-2006.
  1056. ACM
    Goyal V, Gupta S and Saxena S Query rewriting for detection of privacy violation through inferencing Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services, (1-11)
  1057. ACM
    Fogla P and Lee W Evading network anomaly detection systems Proceedings of the 13th ACM conference on Computer and communications security, (59-68)
  1058. Mendez G, Herrero P and Valladares R SIAPAS Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I, (945-954)
  1059. Tang X, Li K, Xiao D, Yang J, Liu M and Qin Y A dynamic communication contention awareness list scheduling algorithm for arbitrary heterogeneous system Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II, (1315-1324)
  1060. Jansson J and Sung W (2006). Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theoretical Computer Science, 363:1, (60-68), Online publication date: 25-Oct-2006.
  1061. Carvalho B, Oliveira L and Andrade G Fuzzy segmentation of color video shots Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery, (494-505)
  1062. ACM
    Erol B, Berkner K and Joshi S Multimedia thumbnails for documents Proceedings of the 14th ACM international conference on Multimedia, (231-240)
  1063. ACM
    Darga P and Boyapati C Efficient software model checking of data structure properties Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, (363-382)
  1064. Li G, Feng J, Ta N, Zhang Y and Zhou L SCEND Proceedings of the 7th international conference on Web Information Systems, (460-473)
  1065. ACM
    Egger B, Lee J and Shin H Scratchpad memory management for portable systems with a memory management unit Proceedings of the 6th ACM & IEEE International conference on Embedded software, (321-330)
  1066. ACM
    Egger B, Kim C, Jang C, Nam Y, Lee J and Min S A dynamic code placement technique for scratchpad memory using postpass optimization Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems, (223-233)
  1067. ACM
    Darga P and Boyapati C (2006). Efficient software model checking of data structure properties, ACM SIGPLAN Notices, 41:10, (363-382), Online publication date: 16-Oct-2006.
  1068. Cheng C, Chen K, Tien W and Chao K (2006). Improved algorithmms for the k maximum-sums problems, Theoretical Computer Science, 362:1, (162-170), Online publication date: 11-Oct-2006.
  1069. ACM
    Stuedi P and Alonso G Computing throughput capacity for realistic wireless multihop networks Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems, (191-198)
  1070. Huang X, Chang C and Chen M (2006). PeerCluster, IEEE Transactions on Parallel and Distributed Systems, 17:10, (1110-1123), Online publication date: 1-Oct-2006.
  1071. Aho I and Mäkinen E (2006). On a parallel machine scheduling problem with precedence constraints, Journal of Scheduling, 9:5, (493-495), Online publication date: 1-Oct-2006.
  1072. Rao N, Di H and Xu G Refine stereo correspondence using bayesian network and dynamic programming on a color based minimal span tree Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems, (610-619)
  1073. Xia C, Broberg J, Liu Z and Zhang L Distributed resource allocation in stream processing systems Proceedings of the 20th international conference on Distributed Computing, (489-504)
  1074. Dice D, Shalev O and Shavit N Transactional locking II Proceedings of the 20th international conference on Distributed Computing, (194-208)
  1075. Edelkamp S, Jabbar S and Lafuente A Heuristic search for the analysis of graph transition systems Proceedings of the Third international conference on Graph Transformations, (414-429)
  1076. ACM
    Das A, Dally W and Mattson P Compiling for stream processing Proceedings of the 15th international conference on Parallel architectures and compilation techniques, (33-42)
  1077. Kukkonen S and Deb K A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems Parallel Problem Solving from Nature - PPSN IX, (553-562)
  1078. Oltean M A light-based device for solving the hamiltonian path problem Proceedings of the 5th international conference on Unconventional Computation, (217-227)
  1079. Chen H, Samavati F, Sousa M and Mitchell J Sketch-based volumetric seeded region growing Proceedings of the Third Eurographics conference on Sketch-Based Interfaces and Modeling, (123-130)
  1080. Cho S Bidirectional data aggregation scheme for wireless sensor networks Proceedings of the Third international conference on Ubiquitous Intelligence and Computing, (595-604)
  1081. Steinemann D, Otaduy M and Gross M Fast arbitrary splitting of deforming objects Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation, (63-72)
  1082. Barbulescu L, Howe A, Whitley L and Roberts M (2006). Understanding algorithm performance on an oversubscribed scheduling application, Journal of Artificial Intelligence Research, 27:1, (577-615), Online publication date: 1-Sep-2006.
  1083. Fatima S, Wooldridge M and Jennings N (2006). Multi-issue negotiation with deadlines, Journal of Artificial Intelligence Research, 27:1, (381-417), Online publication date: 1-Sep-2006.
  1084. Moerkotte G and Neumann T Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products Proceedings of the 32nd international conference on Very large data bases, (930-941)
  1085. Cohen S, Fadida I, Kanza Y, Kimelfeld B and Sagiv Y Full disjunctions Proceedings of the 32nd international conference on Very large data bases, (739-750)
  1086. Denny M and Franklin M Adaptive execution of variable-accuracy functions Proceedings of the 32nd international conference on Very large data bases, (547-558)
  1087. Krysta P and Loryś K (2006). Efficient approximation algorithms for the achromatic number, Theoretical Computer Science, 361:2, (150-171), Online publication date: 1-Sep-2006.
  1088. Steffen P and Giegerich R (2006). Table design in dynamic programming, Information and Computation, 204:9, (1325-1345), Online publication date: 1-Sep-2006.
  1089. Bell A and Haverkort B (2006). Distributed disk-based algorithms for model checking very large Markov chains, Formal Methods in System Design, 29:2, (177-196), Online publication date: 1-Sep-2006.
  1090. Bemporad A and Filippi C (2006). An Algorithm for Approximate Multiparametric Convex Programming, Computational Optimization and Applications, 35:1, (87-108), Online publication date: 1-Sep-2006.
  1091. Korenblit M and Shmerling E Algorithm and software for integration over a convex polyhedron Proceedings of the Second international conference on Mathematical Software, (273-283)
  1092. Desmedt Y, Wang Y and Burmester M Revisiting colored networks and privacy preserving censorship Proceedings of the First international conference on Critical Information Infrastructures Security, (140-150)
  1093. Chen F and Roşu G Parametric and termination-sensitive control dependence Proceedings of the 13th international conference on Static Analysis, (387-404)
  1094. Kik M Sorting long sequences in a single hop radio network Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (573-583)
  1095. Gargano L and Rescigno A Optimally fast data gathering in sensor networks Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (399-411)
  1096. Baeza-Yates R, Pereira Á and Ziviani N Understanding content reuse on the web Proceedings of the 8th Knowledge discovery on the web international conference on Advances in web mining and web usage analysis, (227-246)
  1097. ACM
    Koren Y, North S and Volinsky C Measuring and extracting proximity in networks Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (245-255)
  1098. ACM
    Knobbe A and Ho E Maximally informative k-itemsets and their efficient discovery Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (237-244)
  1099. Ramzan Z and Woodruff D Fast algorithms for the free riders problem in broadcast encryption Proceedings of the 26th annual international conference on Advances in Cryptology, (308-325)
  1100. Krovetz T Message authentication on 64-bit architectures Proceedings of the 13th international conference on Selected areas in cryptography, (327-341)
  1101. Lahiri S and Musuvathi M Solving sparse linear constraints Proceedings of the Third international joint conference on Automated Reasoning, (468-482)
  1102. ACM
    Gamboa R and Cowles J Implementing a cost-aware evaluator for ACL2 expressions Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications, (71-80)
  1103. Nebel M (2006). Fast string matching by using probabilities, Theoretical Computer Science, 359:1, (329-343), Online publication date: 14-Aug-2006.
  1104. Chen C, Lan J and Tang W (2006). An efficient algorithm to find a double-loop network that realizes a given L-shape, Theoretical Computer Science, 359:1, (69-76), Online publication date: 14-Aug-2006.
  1105. Cotton S and Maler O Fast and flexible difference constraint propagation for DPLL(T) Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing, (170-183)
  1106. Kang B, Kelarev A, Sale A and Williams R A new model for classifying DNA code inspired by neural networks and FSA Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management, (187-198)
  1107. Sproston J and Donatelli S (2006). Backward Bisimulation in Markov Chain Model Checking, IEEE Transactions on Software Engineering, 32:8, (531-546), Online publication date: 1-Aug-2006.
  1108. Demetrescu C and Italiano G (2006). Fully dynamic all pairs shortest paths with real edge weights, Journal of Computer and System Sciences, 72:5, (813-837), Online publication date: 1-Aug-2006.
  1109. Huang W, Li Y, Li C and Xu R (2006). New heuristics for packing unequal circles into a circular container, Computers and Operations Research, 33:8, (2125-2142), Online publication date: 1-Aug-2006.
  1110. Lee W and Wong V (2006). E-Span and LPT for data aggregation in wireless sensor networks, Computer Communications, 29:13-14, (2506-2520), Online publication date: 1-Aug-2006.
  1111. Long S, Pieprzyk J, Wang H and Wong D (2006). Generalised Cumulative Arrays in Secret Sharing, Designs, Codes and Cryptography, 40:2, (191-209), Online publication date: 1-Aug-2006.
  1112. Aboul-Hosn K An axiomatization of arrays for kleene algebra with tests Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra, (63-77)
  1113. Tuval N and Gudes E Resolving Information Flow Conflicts in RBAC Systems 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security on Data and Applications Security XX - Volume 4127, (148-162)
  1114. Wang L, Yao C, Singhal A and Jajodia S Interactive Analysis of Attack Graphs Using Relational Queries 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security on Data and Applications Security XX - Volume 4127, (119-132)
  1115. ACM
    Gopalakrishnan P, Li X and Pileggi L Architecture-aware FPGA placement using metric embedding Proceedings of the 43rd annual Design Automation Conference, (460-465)
  1116. ACM
    Wang C, Gupta A and Ganai M Predicate learning and selective theory deduction for a difference logic solver Proceedings of the 43rd annual Design Automation Conference, (235-240)
  1117. ACM
    Fraigniaud P, Ilcinkas D and Pelc A Oracle size Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, (179-187)
  1118. Elsenhans A and Jahnel J The asymptotics of points of bounded height on diagonal cubic and quartic threefolds Proceedings of the 7th international conference on Algorithmic Number Theory, (317-332)
  1119. Nicolae C and Nicolae G BestCut Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing, (275-283)
  1120. Bramsen P, Deshpande P, Lee Y and Barzilay R Inducing temporal graphs Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing, (189-198)
  1121. Gildea D, Satta G and Zhang H Factoring synchronous grammars by sorting Proceedings of the COLING/ACL on Main conference poster sessions, (279-286)
  1122. Dang V, Dash R, Rogers A and Jennings N Overlapping coalition formation for efficient data fusion in multi-sensor networks Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (635-640)
  1123. Sankowski P Weighted bipartite matching in matrix multiplication time Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I, (274-285)
  1124. ACM
    Mierswa I and Wurst M Information preserving multi-objective feature selection for unsupervised learning Proceedings of the 8th annual conference on Genetic and evolutionary computation, (1545-1552)
  1125. Ajwani D, Friedrich T and Meyer U An O(n) algorithm for online topological ordering Proceedings of the 10th Scandinavian conference on Algorithm Theory, (53-64)
  1126. Carlson J and Eppstein D The weighted maximum-mean subtree and other bicriterion subtree problems Proceedings of the 10th Scandinavian conference on Algorithm Theory, (400-410)
  1127. Dom M, Guo J, Niedermeier R and Wernicke S Minimum membership set covering and the consecutive ones property Proceedings of the 10th Scandinavian conference on Algorithm Theory, (339-350)
  1128. Amir A, Iliopoulos C, Kapah O and Porat E Approximate matching in weighted sequences Proceedings of the 17th Annual conference on Combinatorial Pattern Matching, (365-376)
  1129. Manne F and Xin Q Optimal gossiping with unit size messages in known topology radio networks Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking, (125-134)
  1130. ACM
    Duncan C, Kobourov S and Kumar V (2006). Optimal constrained graph exploration, ACM Transactions on Algorithms, 2:3, (380-402), Online publication date: 1-Jul-2006.
  1131. ACM
    Murawski A and Ong C (2006). Fast verification of MLL proof nets via IMLL, ACM Transactions on Computational Logic, 7:3, (473-498), Online publication date: 1-Jul-2006.
  1132. Camponogara E, Zhou H and Talukdar S (2006). Altruistic agents in uncertain dynamic games, Journal of Computer and Systems Sciences International, 45:4, (536-552), Online publication date: 1-Jul-2006.
  1133. Mori G and Malik J (2006). Recovering 3D Human Body Configurations Using Shape Contexts, IEEE Transactions on Pattern Analysis and Machine Intelligence, 28:7, (1052-1062), Online publication date: 1-Jul-2006.
  1134. ACM
    Chakrabarti D and Faloutsos C (2006). Graph mining, ACM Computing Surveys, 38:1, (2-es), Online publication date: 29-Jun-2006.
  1135. ACM
    Kejariwal A, Saito H, Tian X, Girkar M, Li W, Banerjee U, Nicolau A and Polychronopoulos C Lightweight lock-free synchronization methods for multithreading Proceedings of the 20th annual international conference on Supercomputing, (361-371)
  1136. ACM
    Agrawal S, Chu E and Narasayya V Automatic physical design tuning Proceedings of the 2006 ACM SIGMOD international conference on Management of data, (683-694)
  1137. Cera M, Pezzi G, Pilla M, Maillard N and Navaux P Scheduling dynamically spawned processes in MPI-2 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing, (33-46)
  1138. ACM
    Cormode G, Korn F, Muthukrishnan S and Srivastava D Space- and time-efficient deterministic algorithms for biased quantiles over data streams Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (263-272)
  1139. ACM
    Hanneke S An analysis of graph cut size for transductive learning Proceedings of the 23rd international conference on Machine learning, (393-399)
  1140. ACM
    Davis J and Goadrich M The relationship between Precision-Recall and ROC curves Proceedings of the 23rd international conference on Machine learning, (233-240)
  1141. ACM
    Carreira-Perpiñán M Fast nonparametric clustering with Gaussian blurring mean-shift Proceedings of the 23rd international conference on Machine learning, (153-160)
  1142. Kameshwaran S and Benyoucef L Branch on price Proceedings of the Second international conference on Algorithmic Aspects in Information and Management, (375-386)
  1143. Chen Z, Fu B and Zhu B The approximability of the exemplar breakpoint distance problem Proceedings of the Second international conference on Algorithmic Aspects in Information and Management, (291-302)
  1144. Gedda M and Svensson S Fuzzy distance based hierarchical clustering calculated using the a∗ algorithm Proceedings of the 11th international conference on Combinatorial Image Analysis, (101-115)
  1145. Martínez-Gallar J, Almeida F and Giménez D Mapping in heterogeneous systems with heuristic methods Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing, (1084-1093)
  1146. Jia L, Noubir G, Rajaraman R and Sundaram R GIST Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems, (282-304)
  1147. Brodie B, Taylor D and Cytron R A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching Proceedings of the 33rd annual international symposium on Computer Architecture, (191-202)
  1148. ACM
    Zhuang X, Serrano M, Cain H and Choi J Accurate, efficient, and adaptive calling context profiling Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, (263-271)
  1149. ACM
    Zhuang X, Serrano M, Cain H and Choi J (2006). Accurate, efficient, and adaptive calling context profiling, ACM SIGPLAN Notices, 41:6, (263-271), Online publication date: 11-Jun-2006.
  1150. ACM
    Joisha P Compiler optimizations for nondeferred reference Proceedings of the 5th international symposium on Memory management, (150-161)
  1151. Babenko M Acyclic bidirected and skew-symmetric graphs Proceedings of the First international computer science conference on Theory and Applications, (23-34)
  1152. ACM
    Du S and Joshi J Supporting authorization query and inter-domain role mapping in presence of hybrid role hierarchy Proceedings of the eleventh ACM symposium on Access control models and technologies, (228-236)
  1153. Helmert M New complexity results for classical planning benchmarks Proceedings of the Sixteenth International Conference on International Conference on Automated Planning and Scheduling, (52-61)
  1154. Fidler M and Recker S (2006). Conjugate network calculus, Computer Networks: The International Journal of Computer and Telecommunications Networking, 50:8, (1026-1039), Online publication date: 6-Jun-2006.
  1155. ACM
    Hong W, Gu X, Qiu F, Jin M and Kaufman A Conformal virtual colon flattening Proceedings of the 2006 ACM symposium on Solid and physical modeling, (85-93)
  1156. ACM
    Chew L Exact computation of protein structure similarity Proceedings of the twenty-second annual symposium on Computational geometry, (468-474)
  1157. Barzilay R and Lapata M Aggregation via set partitioning for natural language generation Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (359-366)
  1158. De Lucia A, Francese R, Scanniello G and Tortora G (2006). Identifying cloned navigational patterns in web applications, Journal of Web Engineering, 5:2, (150-174), Online publication date: 1-Jun-2006.
  1159. Lobo A and Baliga G (2006). NP-completeness for all computer science undergraduates, Journal of Computing Sciences in Colleges, 21:6, (53-63), Online publication date: 1-Jun-2006.
  1160. Malewicz G, Rosenberg A and Yurkewych M (2006). Toward a Theory for Scheduling Dags in Internet-Based Computing, IEEE Transactions on Computers, 55:6, (757-768), Online publication date: 1-Jun-2006.
  1161. Kao J and Marculescu R (2006). On Optimization of E-Textile Systems Using Redundancy and Energy-Aware Routing, IEEE Transactions on Computers, 55:6, (745-756), Online publication date: 1-Jun-2006.
  1162. Chen Y and Huang T (2006). A new approach for discovering fuzzy quantitative sequential patterns in sequence databases, Fuzzy Sets and Systems, 157:12, (1641-1661), Online publication date: 1-Jun-2006.
  1163. Tong S and Chang C (2006). Harmonic DiffServ, Computer Communications, 29:10, (1780-1797), Online publication date: 1-Jun-2006.
  1164. Dujmovic V, Fellows M, Hallett M, Kitching M, Liotta G, Mccartin C, Nishimura N, Ragde P, Rosamond F, Suderman M, Whitesides S and Wood D (2006). A Fixed-Parameter Approach to 2-Layer Planarization, Algorithmica, 45:2, (159-182), Online publication date: 1-Jun-2006.
  1165. Juillerat N and Hirsbrunner B FOOD Proceedings of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06, (452-461)
  1166. ACM
    Ye C, Cheung S and Chan W Publishing and composition of atomicity-equivalent services for B2B collaboration Proceedings of the 28th international conference on Software engineering, (351-360)
  1167. Boitmanis K, Freivalds K, Lediņš P and Opmanis R Fast and simple approximation of the diameter and radius of a graph Proceedings of the 5th international conference on Experimental Algorithms, (98-108)
  1168. ACM
    Dmitriev P, Eiron N, Fontoura M and Shekita E Using annotations in enterprise search Proceedings of the 15th international conference on World Wide Web, (811-817)
  1169. Boella G, Sauro L and van der Torre L Strengthening Admissible Coalitions Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy, (195-199)
  1170. Fatima S, Wooldridge M and Jennings N On efficient procedures for multi-issue negotiation Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets, (31-45)
  1171. ACM
    Manisterski E, David E, Kraus S and Jennings N Forming efficient agent groups for completing complex tasks Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (834-841)
  1172. Lee I, Clifford R and Kim S Algorithms on extended (δ, γ)-matching Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III, (1137-1142)
  1173. Chen U, Wang C and Lin W Average schedule length and resource selection policies on computational grids Proceedings of the First international conference on Advances in Grid and Pervasive Computing, (63-72)
  1174. Flesca S, Furfaro F and Greco S (2006). Weighted path queries on semistructured databases, Information and Computation, 204:5, (679-696), Online publication date: 1-May-2006.
  1175. ACM
    Brodie B, Taylor D and Cytron R (2006). A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching, ACM SIGARCH Computer Architecture News, 34:2, (191-202), Online publication date: 1-May-2006.
  1176. Boguslavskii A and Sokolov S (2006). Detecting objects in images in real-time computer vision systems using structured geometric models, Programming and Computing Software, 32:3, (177-187), Online publication date: 1-May-2006.
  1177. Huang Z and Shen C (2006). Multibeam Antenna-Based Topology Control with Directional Power Intensity for Ad Hoc Networks, IEEE Transactions on Mobile Computing, 5:5, (508-517), Online publication date: 1-May-2006.
  1178. Lin X, Xu J, Zhang Q, Lu H, Yu J, Zhou X and Yuan Y (2006). Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams, IEEE Transactions on Knowledge and Data Engineering, 18:5, (683-698), Online publication date: 1-May-2006.
  1179. Ito Y, Nakano K and Yamagishi Y Efficient hardware algorithms for n choose k counters Proceedings of the 20th international conference on Parallel and distributed processing, (262-262)
  1180. Gibbons J Datatype-generic programming Proceedings of the 2006 international conference on Datatype-generic programming, (1-71)
  1181. ACM
    Capron G Static analysis of time bounded reactive properties of Boolean symbols Proceedings of the 2006 ACM symposium on Applied computing, (1827-1834)
  1182. ACM
    Elias S, Easwarakumar K and Chbeir R Dynamic consistency checking for temporal and spatial relations in multimedia presentations Proceedings of the 2006 ACM symposium on Applied computing, (1380-1384)
  1183. ACM
    Miura S and Sugimoto M Supporting children's rhythm learning using vibration devices CHI '06 Extended Abstracts on Human Factors in Computing Systems, (1127-1132)
  1184. Huang C, Guan C and Chuang Y A key-address mapping sort algorithm Proceedings of the 5th WSEAS international conference on Applied computer science, (352-357)
  1185. Mtenzi F and Wan Y The minimum-energy broadcast problem in symmetric wireless ad hoc networks Proceedings of the 5th WSEAS international conference on Applied computer science, (68-76)
  1186. Gutin G, Rafiey A, Yeo A and Tso M (2006). Level of repair analysis and minimum cost homomorphisms of graphs, Discrete Applied Mathematics, 154:6, (881-889), Online publication date: 15-Apr-2006.
  1187. Koivisto M (2006). Optimal 2-constraint satisfaction via sum--product algorithms, Information Processing Letters, 98:1, (24-28), Online publication date: 15-Apr-2006.
  1188. Koivisto M (2006). Optimal 2-constraint satisfaction via sum-product algorithms, Information Processing Letters, 98:1, (24-28), Online publication date: 15-Apr-2006.
  1189. Cong G, Cui B, Li Y and Zhang Z Summarizing frequent patterns using profiles Proceedings of the 11th international conference on Database Systems for Advanced Applications, (171-186)
  1190. ACM
    Liu C and Chang Y Floorplan and power/ground network co-synthesis for fast design convergence Proceedings of the 2006 international symposium on Physical design, (86-93)
  1191. ACM
    Su B, Chang Y and Hu J An optimal jumper insertion algorithm for antenna avoidance/fixing on general routing trees with obstacles Proceedings of the 2006 international symposium on Physical design, (56-63)
  1192. Chor B and Tuller T Biological networks Proceedings of the 10th annual international conference on Research in Computational Molecular Biology, (30-44)
  1193. Gu P and Vishkin U (2006). Case study of gate-level logic simulation on an extremely fine-grained chip multiprocessor, Journal of Embedded Computing, 2:2, (181-190), Online publication date: 1-Apr-2006.
  1194. Hong B and Prasanna V (2006). Maximum lifetime data sensing and extraction in energy constrained networked sensor systems, Journal of Parallel and Distributed Computing, 66:4, (566-577), Online publication date: 1-Apr-2006.
  1195. Lloyd E, Liu R and Ravi S (2006). Approximating the minimum number of maximum power users in ad hoc networks, Mobile Networks and Applications, 11:2, (129-142), Online publication date: 1-Apr-2006.
  1196. Paul B and Roy K (2006). Impact of Body Bias on Delay Fault Testing of Sub-100 nm CMOS Circuits, Journal of Electronic Testing: Theory and Applications, 22:2, (115-124), Online publication date: 1-Apr-2006.
  1197. ACM
    Ginat D and Armoni M (2006). Reversing, ACM SIGCSE Bulletin, 38:1, (469-473), Online publication date: 31-Mar-2006.
  1198. Xue J and Knoop J A fresh look at PRE as a maximum flow problem Proceedings of the 15th international conference on Compiler Construction, (139-154)
  1199. ACM
    Kahan S and Konecny P "MAMA!" Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming, (178-186)
  1200. Mitra S, Lynch N and Liberzon D Verifying average dwell time by solving optimization problems Proceedings of the 9th international conference on Hybrid Systems: computation and control, (476-490)
  1201. Ghiasi S and Huang P Probabilistic Delay Budgeting for Soft Realtime Applications Proceedings of the 7th International Symposium on Quality Electronic Design, (141-146)
  1202. Bruening D, Kiriansky V, Garnett T and Banerji S Thread-Shared Software Code Caches Proceedings of the International Symposium on Code Generation and Optimization, (28-38)
  1203. Christodoulou E, Dalamagas T and Sellis T NaviMoz Proceedings of the 2006 international conference on Current Trends in Database Technology, (801-813)
  1204. Cheng J, Yu J, Lin X, Wang H and Yu P Fast computation of reachability labeling for large graphs Proceedings of the 10th international conference on Advances in Database Technology, (961-979)
  1205. Ganai M, Talupur M and Gupta A SDSAT Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (135-150)
  1206. Habermehl P, Iosif R and Vojnar T Automata-Based verification of programs with tree updates Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (350-364)
  1207. Giesen J, Schuberth E and Stojaković M Approximate sorting Proceedings of the 7th Latin American conference on Theoretical Informatics, (524-531)
  1208. Cortes C, Mohri M, Rastogi A and Riley M Efficient computation of the relative entropy of probabilistic automata Proceedings of the 7th Latin American conference on Theoretical Informatics, (323-336)
  1209. ACM
    Ustun V, Yilmaz L and Smith J A conceptual model for agent-based simulation of physical security systems Proceedings of the 44th annual Southeast regional conference, (365-370)
  1210. ACM
    Yasmin N Incremental computation of shortest paths in semi-dynamic graphs using software components Proceedings of the 44th annual Southeast regional conference, (96-101)
  1211. ACM
    Hilaire X and Oommen J The averaged mappings problem Proceedings of the 44th annual Southeast regional conference, (24-29)
  1212. Frederickson G and Solis-Oba R (2006). Efficient algorithms for robustness in resource allocation and scheduling problems, Theoretical Computer Science, 352:1, (250-265), Online publication date: 7-Mar-2006.
  1213. Hosseinabady M, Banaiyan A, Bojnordi M and Navabi Z A concurrent testing method for NoC switches Proceedings of the conference on Design, automation and test in Europe: Proceedings, (1171-1176)
  1214. Cherroun H, Darte A and Feautrier P Scheduling under resource constraints using dis-equations Proceedings of the conference on Design, automation and test in Europe: Proceedings, (1067-1072)
  1215. ACM
    Ginat D and Armoni M Reversing Proceedings of the 37th SIGCSE technical symposium on Computer science education, (469-473)
  1216. Miné A (2006). The octagon abstract domain, Higher-Order and Symbolic Computation, 19:1, (31-100), Online publication date: 1-Mar-2006.
  1217. Goldstein D and Kobayashi K On the complexity of the “most general” firing squad synchronization problem Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (696-711)
  1218. Fortnow L, Lee T and Vereshchagin N Kolmogorov complexity with error Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (137-148)
  1219. Cheng G and Ansari N (2006). Finding a least hop(s) path subject to multiple additive constraints, Computer Communications, 29:3, (392-401), Online publication date: 1-Feb-2006.
  1220. Deng L and Wong M An exact algorithm for the statistical shortest path problem Proceedings of the 2006 Asia and South Pacific Design Automation Conference, (965-970)
  1221. Ajwani D, Dementiev R and Meyer U A computational study of external-memory BFS algorithms Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (601-610)
  1222. Restrepo M and Williamson D A simple GAP-canceling algorithm for the generalized maximum flow problem Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (534-543)
  1223. Althaus E and Naujoks R Computing steiner minimum trees in Hamming metric Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (172-181)
  1224. ACM
    Swadi K, Taha W, Kiselyov O and Pasalic E A monadic approach for avoiding code duplication when staging memoized functions Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (160-169)
  1225. Quesada L, Van Roy P, Deville Y and Collet R Using dominators for solving constrained path problems Proceedings of the 8th international conference on Practical Aspects of Declarative Languages, (73-87)
  1226. Even G On teaching fast adder designs Theoretical Computer Science, (313-347)
  1227. Dinitz Y Dinitz' algorithm Theoretical Computer Science, (218-240)
  1228. ACM
    Dix J, Kraus S and Subrahmanian V (2006). Heterogeneous temporal probabilistic agents, ACM Transactions on Computational Logic, 7:1, (151-198), Online publication date: 1-Jan-2006.
  1229. Sohn B and Bajaj C (2006). Time-Varying Contour Topology, IEEE Transactions on Visualization and Computer Graphics, 12:1, (14-25), Online publication date: 1-Jan-2006.
  1230. Zhang Z and Yang Y (2006). Optimal Scheduling in Buffered WDM Interconnects with Limited Range Wavelength Conversion Capability, IEEE Transactions on Computers, 55:1, (71-82), Online publication date: 1-Jan-2006.
  1231. Ghiasi S, Bozorgzadeh E, Nguyen K and Sarrafzadeh M (2006). Efficient Timing Budget Management for Accuracy Improvement in a Collaborative Object Tracking System, Journal of VLSI Signal Processing Systems, 42:1, (43-55), Online publication date: 1-Jan-2006.
  1232. Parameswaran V and Chellappa R (2006). View Invariance for Human Action Recognition, International Journal of Computer Vision, 66:1, (83-101), Online publication date: 1-Jan-2006.
  1233. Cohen R, Fraigniaud P, Ilcinkas D, Korman A and Peleg D Labeling schemes for tree representation Proceedings of the 7th international conference on Distributed Computing, (13-24)
  1234. Klein R, Knauer C, Narasimhan G and Smid M Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles Proceedings of the 16th international conference on Algorithms and Computation, (849-858)
  1235. Georgakopoulos G, Kavvadias D and Sioutis L Nash equilibria in all-optical networks Proceedings of the First international conference on Internet and Network Economics, (1033-1045)
  1236. Lim Y and Ahn S Improvement of the naive group key distribution approach for mobile ad hoc networks Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks, (763-772)
  1237. Patney R, Baton S and Filer N Server supported routing Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks, (21-30)
  1238. Attiya H, Hay D and Welch J Optimal clock synchronization under energy constraints in wireless ad-hoc networks Proceedings of the 9th international conference on Principles of Distributed Systems, (221-234)
  1239. Maximov A and Johansson T Fast computation of large distributions and its cryptographic applications Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (313-332)
  1240. Brickell J and Shmatikov V Privacy-Preserving graph algorithms in the semi-honest model Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (236-252)
  1241. Yang H, Govindarajan R, Gao G and Hu Z (2005). Improving power efficiency with compiler-assisted cache replacement, Journal of Embedded Computing, 1:4, (487-499), Online publication date: 1-Dec-2005.
  1242. Guillon C, Rastello F, Bidault T and Bouchez F (2005). Procedure placement using temporal-ordering information: Dealing with code size expansion, Journal of Embedded Computing, 1:4, (437-459), Online publication date: 1-Dec-2005.
  1243. epek O and Sung S (2005). A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines, Computers and Operations Research, 32:12, (3265-3271), Online publication date: 1-Dec-2005.
  1244. Assiter K (2005). Accessibility of Analysis of Algorithms, Journal of Computing Sciences in Colleges, 21:2, (185-194), Online publication date: 1-Dec-2005.
  1245. Lin C and Zhou H (2005). Wire retiming as fixpoint computation, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 13:12, (1340-1348), Online publication date: 1-Dec-2005.
  1246. Jin R, Vaidyanathan K, Yang G and Agrawal G (2005). Communication and Memory Optimal Parallel Data Cube Construction, IEEE Transactions on Parallel and Distributed Systems, 16:12, (1105-1119), Online publication date: 1-Dec-2005.
  1247. Meunier P, Findler R, Steckler P and Wand M (2005). Selectors Make Set-Based Analysis Too Hard, Higher-Order and Symbolic Computation, 18:3-4, (245-269), Online publication date: 1-Dec-2005.
  1248. Liu F, Lu X and Peng Y An efficient heuristic algorithm for constructing delay- and degree-bounded application-level multicast tree Proceedings of the 4th international conference on Grid and Cooperative Computing, (1131-1142)
  1249. Mikic-Rakic M, Malek S and Medvidovic N Improving availability in large, distributed component-based systems via redeployment Proceedings of the Third international working conference on Component Deployment, (83-98)
  1250. Keogh E, Lin J and Fu A HOT SAX Proceedings of the Fifth IEEE International Conference on Data Mining, (226-233)
  1251. Lugiez D, Niebert P and Zennou S (2005). A partial order semantics approach to the clock explosion problem of timed automata, Theoretical Computer Science, 345:1, (27-59), Online publication date: 21-Nov-2005.
  1252. ACM
    Ragno R, Burges C and Herley C Inferring similarity between music objects with application to playlist generation Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval, (73-80)
  1253. ACM
    Gu N, Yang J and Zhang Q Consistency maintenance based on the mark & retrace technique in groupware systems Proceedings of the 2005 international ACM SIGGROUP conference on Supporting group work, (264-273)
  1254. ACM
    Ávila B and Lins R A fast orientation and skew detection algorithm for monochromatic document images Proceedings of the 2005 ACM symposium on Document engineering, (118-126)
  1255. Kantabutra S, Jindaluang W and Techa-angkoon P It’s elementary, my dear watson Proceedings of the Third international conference on Parallel and Distributed Processing and Applications, (252-262)
  1256. Kim H, Guibas L and Shin S (2005). Efficient Collision Detection among Moving Spheres with Unknown Trajectories, Algorithmica, 43:3, (195-210), Online publication date: 1-Nov-2005.
  1257. ACM
    Banerjee A and Naumann D (2005). Ownership confinement ensures representation independence for object-oriented programs, Journal of the ACM, 52:6, (894-960), Online publication date: 1-Nov-2005.
  1258. Moore S and Siller C (2005). Availability of end-to-end ideal QoS in IP packet networks, Computer Communications, 28:18, (2047-2057), Online publication date: 1-Nov-2005.
  1259. Kostenko V and Gur'Yanov E (2005). An Algorithm for Scheduling Exchanges over a Bus with Centralized Control and an Analysis of Its Efficiency, Programming and Computing Software, 31:6, (340-346), Online publication date: 1-Nov-2005.
  1260. Plaskota L and Wasilkowski G (2005). Adaption allows efficient integration of functions with unknown singularities, Numerische Mathematik, 102:1, (123-144), Online publication date: 1-Nov-2005.
  1261. Patel R and Mastorakis N Locating mobile agents in a wide distributed system Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering, (96-109)
  1262. ACM
    Kumar S and Crowley P Segmented hash Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems, (91-103)
  1263. Bein D, Datta A and Villain V Snap-Stabilizing optimal binary search tree Proceedings of the 7th international conference on Self-Stabilizing Systems, (1-17)
  1264. Callejo-Rodríguez M, Andrés-Colás J, García-de-Blas G, Ramón-Salguero F and Enríquez-Gabeiras J A decentralized traffic management approach for ambient networks environments Proceedings of the 16th IFIP/IEEE Ambient Networks international conference on Distributed Systems: operations and Management, (145-156)
  1265. Feng J, Ouyang Z, Su F and Cai A An exact ridge matching algorithm for fingerprint verification Proceedings of the 2005 international conference on Advances in Biometric Person Authentication, (103-110)
  1266. Park C, Lee M and Kim D New computation paradigm for modular exponentiation using a graph model Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications, (170-179)
  1267. ACM
    Gil J and Maman I Micro patterns in Java code Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (97-116)
  1268. Avants B, Epstein C and Gee J Geodesic image interpolation Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision, (247-258)
  1269. Peyré G and Cohen L Heuristically driven front propagation for geodesic paths extraction Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision, (173-185)
  1270. Amador J (2005). Sequential clustering by statistical methodology, Pattern Recognition Letters, 26:14, (2152-2163), Online publication date: 15-Oct-2005.
  1271. ACM
    Gil J and Maman I (2005). Micro patterns in Java code, ACM SIGPLAN Notices, 40:10, (97-116), Online publication date: 12-Oct-2005.
  1272. Anderegg L, Cieliebak M and Prencipe G Efficient algorithms for detecting regular point configurations Proceedings of the 9th Italian conference on Theoretical Computer Science, (23-35)
  1273. ACM
    Tseng Y, Wang Y and Cheng K An integrated mobile surveillance and wireless sensor (iMouse) system and its detection delay analysis Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems, (178-181)
  1274. Weinbach Y and Elber R (2005). Revisiting and parallelizing SHAKE, Journal of Computational Physics, 209:1, (193-206), Online publication date: 10-Oct-2005.
  1275. McDonald R, Pereira F, Ribarov K and Hajič J Non-projective dependency parsing using spanning tree algorithms Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, (523-530)
  1276. Taskar B, Lacoste-Julien S and Klein D A discriminative matching approach to word alignment Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, (73-80)
  1277. Doerr B, Friedrich T, Klein C and Osbild R Rounding of sequences and matrices, with applications Proceedings of the Third international conference on Approximation and Online Algorithms, (96-109)
  1278. Sankowski P Shortest paths in matrix multiplication time Proceedings of the 13th annual European conference on Algorithms, (770-778)
  1279. Ausiello G, Franciosa P and Italiano G Small stretch spanners on dynamic graphs Proceedings of the 13th annual European conference on Algorithms, (532-543)
  1280. Alfieri A, van de Velde S and Woeginger G Roll cutting in the curtain industry Proceedings of the 13th annual European conference on Algorithms, (283-292)
  1281. Ward D and Somenzi F Automatic generation of hints for symbolic traversal Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (207-221)
  1282. Lasker K, Dror O, Nussinov R and Wolfson H Discovery of protein substructures in EM maps Proceedings of the 5th International conference on Algorithms in Bioinformatics, (423-434)
  1283. Ghiasi S Efficient Implementation Selection via Time Budgeting Complexity Analysis and Leakage Optimization Case Study Proceedings of the 2005 International Conference on Computer Design, (127-129)
  1284. Sistla A and Zhou M Combining static analysis and model checking for systems employing commutative functions Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems, (68-82)
  1285. ACM
    Song H, Dharmapurikar S, Turner J and Lockwood J (2005). Fast hash table lookup using extended bloom filter, ACM SIGCOMM Computer Communication Review, 35:4, (181-192), Online publication date: 1-Oct-2005.
  1286. Pinar A and Hendrickson B (2005). Improving Load Balance with Flexibly Assignable Tasks, IEEE Transactions on Parallel and Distributed Systems, 16:10, (956-965), Online publication date: 1-Oct-2005.
  1287. Shi Y, Song Y and Zhang A (2005). A Shrinking-Based Clustering Approach for Multidimensional Data, IEEE Transactions on Knowledge and Data Engineering, 17:10, (1389-1403), Online publication date: 1-Oct-2005.
  1288. Bagnara R, Hill P, Ricci E and Zaffanella E (2005). Precise widening operators for convex polyhedra, Science of Computer Programming, 58:1-2, (28-56), Online publication date: 1-Oct-2005.
  1289. ACM
    Yeh T and Reinman G Fast and fair Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems, (237-248)
  1290. Lahiri S and Musuvathi M An efficient decision procedure for UTVPI constraints Proceedings of the 5th international conference on Frontiers of Combining Systems, (168-183)
  1291. Kasperski A and Zieliński P A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids Proceedings of the 6th international conference on Fuzzy Logic and Applications, (46-52)
  1292. Baader F, Karabaev E, Lutz C and Theißen M A new n-ary existential quantifier in description logics Proceedings of the 28th annual German conference on Advances in Artificial Intelligence, (18-33)
  1293. Guo H Mode-directed fixed point computation Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning, (253-265)
  1294. Elber G Global curve analysis via a dimensionality lifting scheme Proceedings of the 11th IMA international conference on Mathematics of Surfaces, (184-200)
  1295. Sandnes F and Sinnen O (2005). A new strategy for multiprocessor scheduling of cyclic task graphs, International Journal of High Performance Computing and Networking, 3:1, (62-71), Online publication date: 1-Sep-2005.
  1296. Oltean M (2005). Evolving Evolutionary Algorithms Using Linear Genetic Programming, Evolutionary Computation, 13:3, (387-410), Online publication date: 1-Sep-2005.
  1297. Besta M and Stomp F (2005). A complete mechanization of correctness of a string-preprocessing algorithm, Formal Methods in System Design, 27:1-2, (5-27), Online publication date: 1-Sep-2005.
  1298. Bargeron D, Viola P and Simard P Boosting-based Transductive Learning for Text Detection Proceedings of the Eighth International Conference on Document Analysis and Recognition, (1166-1171)
  1299. Chellapilla K, Simard P and Nickolov R Fast Optical Character Recognition through Glyph Hashing for Document Conversion Proceedings of the Eighth International Conference on Document Analysis and Recognition, (829-834)
  1300. Tao Y, Cheng R, Xiao X, Ngai W, Kao B and Prabhakar S Indexing multi-dimensional uncertain data with arbitrary probability density functions Proceedings of the 31st international conference on Very large data bases, (922-933)
  1301. Jin L, Li C, Koudas N and Tung A Indexing mixed types for approximate retrieval Proceedings of the 31st international conference on Very large data bases, (793-804)
  1302. Chen L, Gupta A and Kurul M Stack-based algorithms for pattern matching on DAGs Proceedings of the 31st international conference on Very large data bases, (493-504)
  1303. Mandhani B and Suciu D Query caching and view selection for XML databases Proceedings of the 31st international conference on Very large data bases, (469-480)
  1304. Bădică C and Bădică A Logic wrappers and XSLT transformations for tuples extraction from HTML Proceedings of the Third international conference on Database and XML Technologies, (177-191)
  1305. ACM
    Song H, Dharmapurikar S, Turner J and Lockwood J Fast hash table lookup using extended bloom filter Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, (181-192)
  1306. Madou M, Anckaert B, Moseley P, Debray S, De Sutter B and De Bosschere K Software protection through dynamic code mutation Proceedings of the 6th international conference on Information Security Applications, (194-206)
  1307. Musuvathi M and Dill D An incremental heap canonicalization algorithm Proceedings of the 12th international conference on Model Checking Software, (28-42)
  1308. Khurshid S, García I and Suen Y Repairing structurally complex data Proceedings of the 12th international conference on Model Checking Software, (123-138)
  1309. Li F, Cheng D, Hadjieleftheriou M, Kollios G and Teng S On trip planning queries in spatial databases Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases, (273-290)
  1310. Wang Y, Liu Z and Zhou L Automatic 3d motion synthesis with time-striding hidden markov model Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics, (558-567)
  1311. Ono A and Nakano S Constant time generation of linear extensions Proceedings of the 15th international conference on Fundamentals of Computation Theory, (445-453)
  1312. Dawyndt P, Vancanneyt M, De Meyer H and Swings J (2005). Knowledge Accumulation and Resolution of Data Inconsistencies during the Integration of Microbial Information Sources, IEEE Transactions on Knowledge and Data Engineering, 17:8, (1111-1126), Online publication date: 1-Aug-2005.
  1313. Senellart P Identifying websites with flow simulation Proceedings of the 5th international conference on Web Engineering, (124-129)
  1314. ACM
    Robu V, Somefun D and La Poutré J Modeling complex multi-issue negotiations using utility graphs Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (280-287)
  1315. ACM
    Gasieniec L, Peleg D and Xin Q Faster communication in known topology radio networks Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, (129-137)
  1316. Dimopoulos M and Linardis P Search space pruning techniques in ATPG for VLSI circuits Proceedings of the 9th International Conference on Circuits, (1-6)
  1317. Franceschini G and Grossi R Optimal in-place sorting of vectors and records Proceedings of the 32nd international conference on Automata, Languages and Programming, (90-102)
  1318. Agmon N, Kaminka G and Kraus S Team member reallocation via tree pruning Proceedings of the 20th national conference on Artificial intelligence - Volume 1, (35-40)
  1319. Lahiri S, Ball T and Cook B Predicate abstraction via symbolic decision procedures Proceedings of the 17th international conference on Computer Aided Verification, (24-38)
  1320. Bonet B and Geffner H (2005). mGPT, Journal of Artificial Intelligence Research, 24:1, (933-944), Online publication date: 1-Jul-2005.
  1321. ACM
    Xiang H, Tang X and Wong M (2005). An algorithm for integrated pin assignment and buffer planning, ACM Transactions on Design Automation of Electronic Systems, 10:3, (561-572), Online publication date: 1-Jul-2005.
  1322. Keselman Y and Dickinson S (2005). Generic Model Abstraction from Examples, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:7, (1141-1156), Online publication date: 1-Jul-2005.
  1323. Elfeky M, Aref W and Elmagarmid A (2005). Periodicity Detection in Time Series Databases, IEEE Transactions on Knowledge and Data Engineering, 17:7, (875-887), Online publication date: 1-Jul-2005.
  1324. Zhao C, Dey S and Bai X (2005). Soft-Spot Analysis, IEEE Design & Test, 22:4, (362-375), Online publication date: 1-Jul-2005.
  1325. Dai Q and Wu J (2005). Computation of Minimal Uniform Transmission Range in Ad Hoc Wireless Networks, Cluster Computing, 8:2-3, (127-133), Online publication date: 1-Jul-2005.
  1326. Wang L and Olariu S (2005). Cluster Maintenance in Mobile Ad-hoc Networks, Cluster Computing, 8:2-3, (111-118), Online publication date: 1-Jul-2005.
  1327. ACM
    Jansen T and Schellbach U Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice Proceedings of the 7th annual conference on Genetic and evolutionary computation, (841-848)
  1328. Fomin F, Mazoit F and Todinca I Computing branchwidth via efficient triangulations and blocks Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science, (374-384)
  1329. Korach E and Razgon M Optimal hypergraph tree-realization Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science, (261-270)
  1330. Gutin G, Rafiey A, Yeo A and Tso M Level of repair analysis and minimum cost homomorphisms of graphs Proceedings of the First international conference on Algorithmic Applications in Management, (427-439)
  1331. ACM
    Wang H, Parthasarathy S, Ghoting A, Tatikonda S, Buehrer G, Kurc T and Saltz J Design of a next generation sampling service for large scale data analysis applications Proceedings of the 19th annual international conference on Supercomputing, (91-100)
  1332. van Hee K, Serebrenik A, Sidorova N and Voorhoeve M Soundness of resource-constrained workflow nets Proceedings of the 26th international conference on Applications and Theory of Petri Nets, (250-267)
  1333. Fraundorfer F, Winter M and Bischof H MSCC Proceedings of the 14th Scandinavian conference on Image Analysis, (45-54)
  1334. Marinov D, Khurshid S, Bugrara S, Zhang L and Rinard M Optimizations for compiling declarative models into boolean formulas Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing, (187-202)
  1335. Clifford P, Clifford R and Iliopoulos C Faster algorithms for δ,γ-matching and related problems Proceedings of the 16th annual conference on Combinatorial Pattern Matching, (68-78)
  1336. Manea F Timed accepting hybrid networks of evolutionary processors Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II, (122-132)
  1337. ACM
    Lee J, Oh J and Hwang S STRG-Index Proceedings of the 2005 ACM SIGMOD international conference on Management of data, (718-729)
  1338. ACM
    Ganguly S, Garofalakis M, Kumar A and Rastogi R Join-distinct aggregate estimation over update streams Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (259-270)
  1339. ACM
    Hachenberger P and Kettner L Boolean operations on 3D selective Nef complexes Proceedings of the 2005 ACM symposium on Solid and physical modeling, (163-174)
  1340. ACM
    Raman E and August D Recursive data structure profiling Proceedings of the 2005 workshop on Memory system performance, (5-14)
  1341. ACM
    Casanovas P, Casellas N, Vallbé J, Poblet M, Ramos F, Gorroñogoitia J, Contreras J, Blázquez M and Benjamins R Iuriservice II Proceedings of the 10th international conference on Artificial intelligence and law, (188-194)
  1342. McMahan H and Gordon G Fast exact planning in Markov decision processes Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, (151-160)
  1343. Bresina J, Jónsson A, Morris P and Rajan K Activity planning for the Mars Exploration Rovers Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, (40-49)
  1344. Deb S and Woodward M (2005). A new distributed QoS routing algorithm based on Fano's method, Computer Networks: The International Journal of Computer and Telecommunications Networking, 48:2, (155-174), Online publication date: 1-Jun-2005.
  1345. Sinnen O and Sousa L (2005). Communication Contention in Task Scheduling, IEEE Transactions on Parallel and Distributed Systems, 16:6, (503-515), Online publication date: 1-Jun-2005.
  1346. Bejerano Y, Breitbart Y, Orda A, Rastogi R and Sprintson A (2005). Algorithms for computing QoS paths with restoration, IEEE/ACM Transactions on Networking, 13:3, (648-661), Online publication date: 1-Jun-2005.
  1347. Lim H, Hou J and Choi C (2005). Constructing internet coordinate system based on delay measurement, IEEE/ACM Transactions on Networking, 13:3, (513-525), Online publication date: 1-Jun-2005.
  1348. Manoj B, Ananthapadmanabha R and Siva Ram Murthy C (2005). Multi-hop cellular networks, Journal of Parallel and Distributed Computing, 65:6, (767-791), Online publication date: 1-Jun-2005.
  1349. Vyugin M and V'yugin V (2005). Predictive complexity and information, Journal of Computer and System Sciences, 70:4, (539-554), Online publication date: 1-Jun-2005.
  1350. Ozdal M, Wong M and Honsinger P Optimal routing algorithms for pin clusters in high-density multichip modules Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (767-774)
  1351. Ozdal M, Wong M and Honsinger P An escape routing framework for dense boards with high-speed design constraints Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (759-766)
  1352. Fang J, Lin I, Yuh P, Chang Y and Wang J A routing algorithm for flip-chip design Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (753-758)
  1353. Lin C, Wang J and Zhou H Clustering for processing rate optimization Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (189-195)
  1354. Leung K SPIDER Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (33-38)
  1355. Colucci S, Di Noia T, Di Sciascio E, Donini F and Ragone A Semantic-Based automated composition of distributed learning objects for personalized e-learning Proceedings of the Second European conference on The Semantic Web: research and Applications, (633-648)
  1356. ACM
    Orda A and Yassour B Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, (426-437)
  1357. Subramani K and Desovski D On the empirical efficiency of the vertex contraction algorithm for detecting negative cost cyles in networks Proceedings of the 5th international conference on Computational Science - Volume Part I, (180-187)
  1358. ACM
    Voinea L, Telea A and van Wijk J CVSscan Proceedings of the 2005 ACM symposium on Software visualization, (47-56)
  1359. El-Sonbaty Y and Belal N Algorithms for updating Huffman codes Proceedings of the 7th WSEAS International Conference on Applied Mathematics, (1-8)
  1360. Westra J and Groeneveld P Post-Placement Pin Optimiztion Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design, (238-243)
  1361. ACM
    Maguitman A, Menczer F, Roinestad H and Vespignani A Algorithmic detection of semantic similarity Proceedings of the 14th international conference on World Wide Web, (107-116)
  1362. ACM
    Gupta R, Puri A and Ramamritham K Executing incoherency bounded continuous queries at web data aggregators Proceedings of the 14th international conference on World Wide Web, (54-65)
  1363. Lin P and Lee T A fast 2d shape interpolation technique Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III, (1050-1059)
  1364. ACM
    Thomason B and Chase C Partially ordered epochs for thread-level speculation Proceedings of the 2nd conference on Computing frontiers, (299-306)
  1365. Callahan S, Ikits M, Comba J and Silva C (2005). Hardware-Assisted Visibility Sorting for Unstructured Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, 11:3, (285-295), Online publication date: 1-May-2005.
  1366. Zhu X, Wu X, Elmagarmid A, Feng Z and Wu L (2005). Video Data Mining, IEEE Transactions on Knowledge and Data Engineering, 17:5, (665-677), Online publication date: 1-May-2005.
  1367. Kaplan H and Verbin E (2005). Sorting signed permutations by reversals, revisited, Journal of Computer and System Sciences, 70:3, (321-341), Online publication date: 1-May-2005.
  1368. Liang W and Shen X (2005). Finding multiple routing paths in wide-area WDM networks, Computer Communications, 28:7, (811-818), Online publication date: 1-May-2005.
  1369. Couprie M, Najman L and Bertrand G (2005). Quasi-Linear Algorithms for the Topological Watershed, Journal of Mathematical Imaging and Vision, 22:2-3, (231-249), Online publication date: 1-May-2005.
  1370. Hartline J, Hong E, Mohr A, Pentney W and Rocke E (2005). Characterizing History Independent Data Structures, Algorithmica, 42:1, (57-74), Online publication date: 1-May-2005.
  1371. 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)
  1372. Stump A and Tan L The algebra of equality proofs Proceedings of the 16th international conference on Term Rewriting and Applications, (469-483)
  1373. Nieuwenhuis R and Oliveras A Proof-producing congruence closure Proceedings of the 16th international conference on Term Rewriting and Applications, (453-468)
  1374. Su M and Chi C Architecture and Performance of Application Networking in Pervasive Content Delivery Proceedings of the 21st International Conference on Data Engineering, (656-667)
  1375. Lin X, Yuan Y, Wang W and Lu H Stabbing the Sky Proceedings of the 21st International Conference on Data Engineering, (502-513)
  1376. Dasgupta K, Ghosal S, Jain R, Sharma U and Verma A QoSMig Proceedings of the 21st International Conference on Data Engineering, (816-827)
  1377. Shestak V, Chong E, Maciejewski A, Siegel H, Benmohamed L, Wang I and Daley R Resource Allocation for Periodic Applications in a Shipboard Environment Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
  1378. Beaumont O, Marchal L and Robert Y Broadcast Trees for Heterogeneous Platforms Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
  1379. ACM
    Westra J and Groeneveld P Is probabilistic congestion estimation worthwhile? Proceedings of the 2005 international workshop on System level interconnect prediction, (99-106)
  1380. Scheutz M and Schermerhorn P (2005). Many is more, Web Intelligence and Agent Systems, 3:2, (97-116), Online publication date: 1-Apr-2005.
  1381. Peng W and Chen M (2005). Shared Data Allocation in a Mobile Computing System, IEEE Transactions on Parallel and Distributed Systems, 16:4, (374-384), Online publication date: 1-Apr-2005.
  1382. Beaumont O, Legrand A, Marchal L and Robert Y (2005). Pipelining Broadcasts on Heterogeneous Platforms, IEEE Transactions on Parallel and Distributed Systems, 16:4, (300-313), Online publication date: 1-Apr-2005.
  1383. Wang S, Kubota T, Siskind J and Wang J (2005). Salient Closed Boundary Extraction with Ratio Contour, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:4, (546-561), Online publication date: 1-Apr-2005.
  1384. Baron D and Bresler Y (2005). Antisequential Suffix Sorting for BWT-Based Data Compression, IEEE Transactions on Computers, 54:4, (385-397), Online publication date: 1-Apr-2005.
  1385. Subramani K (2005). Periodic Linear Programming with applications to real-time scheduling, Mathematical Structures in Computer Science, 15:2, (383-406), Online publication date: 1-Apr-2005.
  1386. Bar-Yehuda R, Even G and Shahar S (2005). On approximating a geometric prize-collecting traveling salesman problem with time windows, Journal of Algorithms, 55:1, (76-92), Online publication date: 1-Apr-2005.
  1387. Subramani K (2005). An Analysis of Totally Clairvoyant Scheduling, Journal of Scheduling, 8:2, (113-133), Online publication date: 1-Apr-2005.
  1388. Chi C and Hao R Test generation for interaction detection in feature-rich communication systems Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems, (242-257)
  1389. Yang S, Hsieh J, Lan B and Chung J Composition and evaluation of trustworthy Web Services Proceedings of the IEEE EEE05 international workshop on Business services networks, (5-5)
  1390. Xiang H, Liu I and Wong M Wire Planning with Bounded Over-the-Block Wires Proceedings of the 6th International Symposium on Quality of Electronic Design, (622-627)
  1391. ACM
    SaiRanga P and Baskiyar S A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems Proceedings of the 43rd annual Southeast regional conference - Volume 1, (63-68)
  1392. ACM
    Colucci S, Noia T, Sciascio E, Donini F, Piscitelli G and Coppi S Knowledge based approach to semantic composition of teams in an organization Proceedings of the 2005 ACM symposium on Applied computing, (1314-1319)
  1393. ACM
    Spohn M and Garcia-Luna-Aceves J A solution for the location problem in arbitrary computer networks using generic dominating sets Proceedings of the 2005 ACM symposium on Applied computing, (739-743)
  1394. ACM
    Morimoto Y Optimized transitive association rule Proceedings of the 2005 ACM symposium on Applied computing, (543-544)
  1395. Basseur M, Seynhaeve F and Talbi E Path relinking in pareto multi-objective genetic algorithms Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization, (120-134)
  1396. Gadkari A and Ramesh S Automated Synthesis of Assertion Monitors using Visual Specifications Proceedings of the conference on Design, Automation and Test in Europe - Volume 1, (390-395)
  1397. Mukhopadhyay S, Bhunia S and Roy K Modeling and Analysis of Loading Effect in Leakage of Nano-Scaled Bulk-CMOS Logic Circuits Proceedings of the conference on Design, Automation and Test in Europe - Volume 1, (224-229)
  1398. Ghosh A and Givargis T LORD Proceedings of the conference on Design, Automation and Test in Europe - Volume 1, (190-195)
  1399. Kao J and Marculescu R Energy-Aware Routing for E-Textile Applications Proceedings of the conference on Design, Automation and Test in Europe - Volume 1, (184-189)
  1400. Thomas C, Howie C and Smith L (2005). A New Singly Connected Network Classifier based on Mutual Information, Intelligent Data Analysis, 9:2, (189-205), Online publication date: 1-Mar-2005.
  1401. Medjahed B and Bouguettaya A (2005). A dynamic foundational architecture for semantic web services, Distributed and Parallel Databases, 17:2, (179-206), Online publication date: 1-Mar-2005.
  1402. Dahllöf V, Jonsson P and Wahlström M (2005). Counting models for 2SAT and 3SAT formulae, Theoretical Computer Science, 332:1-3, (265-291), Online publication date: 28-Feb-2005.
  1403. Brandenburg F and Skodinis K (2005). Finite graph automata for linear and boundary graph languages, Theoretical Computer Science, 332:1-3, (199-232), Online publication date: 28-Feb-2005.
  1404. ACM
    Okasaki C Alternatives to two classic data structures Proceedings of the 36th SIGCSE technical symposium on Computer science education, (162-165)
  1405. ACM
    Okasaki C (2005). Alternatives to two classic data structures, ACM SIGCSE Bulletin, 37:1, (162-165), Online publication date: 23-Feb-2005.
  1406. Struth G Knuth-Bendix completion as a data structure Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra, (225-236)
  1407. Kehden B, Neumann F and Berghammer R Relational implementation of simple parallel evolutionary algorithms Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra, (161-172)
  1408. Laoutaris N, Zissimopoulos V and Stavrakakis I (2005). On the optimization of storage capacity allocation for content distribution, Computer Networks: The International Journal of Computer and Telecommunications Networking, 47:3, (409-428), Online publication date: 1-Feb-2005.
  1409. Fiat A, Levy M, Matoušek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U and Welzl E Online conflict-free coloring for intervals Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (545-554)
  1410. Goldberg A and Harrelson C Computing the shortest path Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (156-165)
  1411. ACM
    Lam W and Koh C Process variation robust clock tree routing Proceedings of the 2005 Asia and South Pacific Design Automation Conference, (606-611)
  1412. ACM
    Wang Y, Hong X, Jing T, Yang Y, Hu X and Yan G The polygonal contraction heuristic for rectilinear Steiner tree construction Proceedings of the 2005 Asia and South Pacific Design Automation Conference, (1-6)
  1413. McConnell R and de Montgolfier F (2005). Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, 145:2, (198-209), Online publication date: 15-Jan-2005.
  1414. Kashiwagi K, Higami Y and Kobayashi S Improvement of the processors operating ratio in task scheduling using the deadline method Enhanced methods in computer security, biometric and artificial intelligence systems, (387-394)
  1415. Morris J Algorithm animation Proceedings of the 7th Australasian conference on Computing education - Volume 42, (15-20)
  1416. Malkin M and Venkatesan R Comparison of texts streams in the presence of mild adversaries Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44, (179-186)
  1417. Memon A, Nagarajan A and Xie Q (2005). Automating regression testing for evolving GUI software, Journal of Software Maintenance and Evolution: Research and Practice, 17:1, (27-64), Online publication date: 1-Jan-2005.
  1418. ACM
    Ross R, Subrahmanian V and Grant J (2005). Aggregate operators in probabilistic databases, Journal of the ACM, 52:1, (54-101), Online publication date: 1-Jan-2005.
  1419. Cheung C, Yu J and Lu H (2005). Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory, IEEE Transactions on Knowledge and Data Engineering, 17:1, (90-105), Online publication date: 1-Jan-2005.
  1420. Euh J, Chittamuru J and Burleson W (2005). Power-Aware 3D Computer Graphics Rendering, Journal of VLSI Signal Processing Systems, 39:1-2, (15-33), Online publication date: 1-Jan-2005.
  1421. Dumas M, Aldred L, Governatori G and Ter Hofstede A (2005). Probabilistic Automated Bidding in Multiple Auctions, Electronic Commerce Research, 5:1, (25-49), Online publication date: 1-Jan-2005.
  1422. Cicirello V and Smith S (2005). Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics, Journal of Heuristics, 11:1, (5-34), Online publication date: 1-Jan-2005.
  1423. Chatterjee K, Dasgupta P and Chakrabarti P Complexity of compositional model checking of computation tree logic on simple structures Proceedings of the 6th international conference on Distributed Computing, (102-113)
  1424. Shi Q and JaJa J Techniques for indexing and querying temporal observations for a collection of objects Proceedings of the 15th international conference on Algorithms and Computation, (822-834)
  1425. Jansson J and Sung W The maximum agreement of two nested phylogenetic networks Proceedings of the 15th international conference on Algorithms and Computation, (581-593)
  1426. Nandy S, Carter L and Ferrante J A-FAST Proceedings of the 11th international conference on High Performance Computing, (363-374)
  1427. ACM
    Green T, Gupta A, Miklau G, Onizuka M and Suciu D (2004). Processing XML streams with deterministic automata and stream indexes, ACM Transactions on Database Systems, 29:4, (752-788), Online publication date: 12-Dec-2004.
  1428. ACM
    Balmin A, Papakonstantinou Y and Vianu V (2004). Incremental validation of XML documents, ACM Transactions on Database Systems, 29:4, (710-751), Online publication date: 12-Dec-2004.
  1429. Tošić P and Agha G Maximal clique based distributed coalition formation for task allocation in large-scale multi-agent systems Proceedings of the First international conference on Massively Multi-Agent Systems, (104-120)
  1430. Sandnes F and Sinnen O Stochastic DFS for multiprocessor scheduling of cyclic taskgraphs Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies, (354-362)
  1431. Hsu C and Feng W Effective dynamic voltage scaling through CPU-Boundedness detection Proceedings of the 4th international conference on Power-Aware Computer Systems, (135-149)
  1432. Shobaki G and Wilken K Optimal Superblock Scheduling Using Enumeration Proceedings of the 37th annual IEEE/ACM International Symposium on Microarchitecture, (283-293)
  1433. ACM
    Bar-Yehuda R, Bendel K, Freund A and Rawitz D (2004). Local ratio, ACM Computing Surveys, 36:4, (422-463), Online publication date: 1-Dec-2004.
  1434. Cheng M, Cardei M, Sun J, Cheng X, Wang L, Xu Y and Du D (2004). Topology Control of Ad Hoc Wireless Networks for Energy Efficiency, IEEE Transactions on Computers, 53:12, (1629-1635), Online publication date: 1-Dec-2004.
  1435. Johnson M, Zomaya A and Kraetzl M (2004). Modeling external network behavior by using internal measurements, Journal of Parallel and Distributed Computing, 64:12, (1345-1359), Online publication date: 1-Dec-2004.
  1436. Allauzen C and Mohri M (2004). An optimal pre-determinization algorithm for weighted transducers, Theoretical Computer Science, 328:1-2, (3-18), Online publication date: 29-Nov-2004.
  1437. ACM
    Taghva K, Nartker T and Borsack J Information access in the presence of OCR errors Proceedings of the 1st ACM workshop on Hardcopy document processing, (1-8)
  1438. Ozdal M and Wong M Simultaneous escape routing and layer assignment for dense PCBs Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (822-829)
  1439. Chu C FLUTE Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (696-701)
  1440. Ghiasi S, Bozorgzadeh E, Choudhuri S and Sarrafzadeh M A unified theory of timing budget management Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (653-659)
  1441. Chen R and Zhou H Clock schedule verification under process variations Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (619-625)
  1442. Swany M Improving Throughput for Grid Applications with Network Logistics Proceedings of the 2004 ACM/IEEE conference on Supercomputing
  1443. Altingovde I and Ulusoy O (2004). Exploiting Interclass Rules for Focused Crawling, IEEE Intelligent Systems, 19:6, (66-73), Online publication date: 1-Nov-2004.
  1444. Shatnawi A, Ghanim J and Ahmad M (2004). High level synthesis of integrated heterogeneous pipelined processing elements for DSP applications, Computers and Electrical Engineering, 30:8, (543-562), Online publication date: 1-Nov-2004.
  1445. ACM
    Doan T, Demurjian S, Ting T and Ketterl A MAC and UML for secure software design Proceedings of the 2004 ACM workshop on Formal methods in security engineering, (75-85)
  1446. ACM
    Schweller R, Gupta A, Parsons E and Chen Y Reversible sketches for efficient and accurate change detection over network data streams Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, (207-212)
  1447. Ziegler M and Brattka V (2004). Computability in linear algebra, Theoretical Computer Science, 326:1-3, (187-211), Online publication date: 20-Oct-2004.
  1448. Toygar Ö and Acan A Selection of optimal dimensionality reduction methods for face recognition using genetic algorithms Proceedings of the Third international conference on Advances in Information Systems, (472-481)
  1449. ACM
    Taylor A, Donovan B, Foley-Fisher Z and Strohecker C Time, voice, and joyce Proceedings of the 1st ACM workshop on Story representation, mechanism and context, (67-70)
  1450. Daescu O, Mi N, Shin C and Wolff A Farthest-Point queries with geometric and combinatorial constraints Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry, (62-75)
  1451. Hazelhurst S An efficient implementation of the d2 distance function for EST clustering Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries, (229-233)
  1452. Nohl D (2004). Solving the pharaoh's golden staircase problem through dynamic programming, Journal of Computing Sciences in Colleges, 20:1, (54-60), Online publication date: 1-Oct-2004.
  1453. Krone J (2004). Keeping pointers or references under control, Journal of Computing Sciences in Colleges, 20:1, (42-53), Online publication date: 1-Oct-2004.
  1454. Van Mieghem P and Kuipers F (2004). Concepts of exact QoS routing algorithms, IEEE/ACM Transactions on Networking, 12:5, (851-864), Online publication date: 1-Oct-2004.
  1455. Khurshid S and Marinov D (2004). TestEra, Automated Software Engineering, 11:4, (403-434), Online publication date: 1-Oct-2004.
  1456. ACM
    Gulati A and Varman P Scheduling with QoS in parallel I/O systems Proceedings of the international workshop on Storage network architecture and parallel I/Os, (1-8)
  1457. Wu B (2004). An improved algorithm for the k-source maximum eccentricity spanning trees, Discrete Applied Mathematics, 143:1-3, (342-350), Online publication date: 30-Sep-2004.
  1458. Wu B (2004). Approximation algorithms for the optimal p-source communication spanning tree, Discrete Applied Mathematics, 143:1-3, (31-42), Online publication date: 30-Sep-2004.
  1459. ACM
    Xu R, Xi C, Melhem R and Moss D Practical PACE for embedded systems Proceedings of the 4th ACM international conference on Embedded software, (54-63)
  1460. ACM
    Guillon C, Rastello F, Bidault T and Bouchez F Procedure placement using temporal-ordering information Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems, (268-279)
  1461. D'Alberto P and Nicolau A JuliusC Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing, (117-131)
  1462. Wu-Hen-Chang A, Le Viet D, Batori G, Gecse R and Csopaki G High-level restructuring of TTCN-3 test data Proceedings of the 4th international conference on Formal Approaches to Software Testing, (180-194)
  1463. Taghdiri M Inferring Specifications to Detect Errors in Code Proceedings of the 19th IEEE international conference on Automated software engineering, (144-153)
  1464. ACM
    Ginat D (2004). Do senior CS students capitalize on recursion?, ACM SIGCSE Bulletin, 36:3, (82-86), Online publication date: 1-Sep-2004.
  1465. ACM
    Ginat D (2004). Embedding instructive assertions in program design, ACM SIGCSE Bulletin, 36:3, (62-66), Online publication date: 1-Sep-2004.
  1466. Park J, Penner M and Prasanna V (2004). Optimizing Graph Algorithms for Improved Cache Performance, IEEE Transactions on Parallel and Distributed Systems, 15:9, (769-782), Online publication date: 1-Sep-2004.
  1467. Niggemeyer D and Rudnick E (2004). Automatic Generation of Diagnostic Memory Tests Based on Fault Decomposition and Output Tracing, IEEE Transactions on Computers, 53:9, (1134-1146), Online publication date: 1-Sep-2004.
  1468. Felzenszwalb P and Huttenlocher D (2004). Efficient Graph-Based Image Segmentation, International Journal of Computer Vision, 59:2, (167-181), Online publication date: 1-Sep-2004.
  1469. Lee J (2004). A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities, Geoinformatica, 8:3, (237-264), Online publication date: 1-Sep-2004.
  1470. Markovskii A (2004). Solution of Fuzzy Equations with Max-Product Composition in Inverse Control and Decision Making Problems, Automation and Remote Control, 65:9, (1486-1495), Online publication date: 1-Sep-2004.
  1471. Gajer P, Goodrich M and Kobourov S (2004). A multi-dimensional approach to force-directed layouts of large graphs, Computational Geometry: Theory and Applications, 29:1, (3-18), Online publication date: 1-Sep-2004.
  1472. Fontoura M, Shekita E, Zien J, Rajagopalan S and Neumann A High performance index build algorithms for intranet search engines Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (1122-1133)
  1473. Hore B, Mehrotra S and Tsudik G A privacy-preserving index for range queries Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (720-731)
  1474. Theobald M, Weikum G and Schenkel R Top-k query evaluation with probabilistic guarantees Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (648-659)
  1475. Balmin A, Hristidis V and Papakonstantinou Y Objectrank Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (564-575)
  1476. ACM
    Valente P (2004). Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler, ACM SIGCOMM Computer Communication Review, 34:4, (269-280), Online publication date: 30-Aug-2004.
  1477. ACM
    Valente P Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, (269-280)
  1478. Reitsma P and Pollard N Evaluating motion graphs for character navigation Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation, (89-98)
  1479. Lin C and Och F ORANGE Proceedings of the 20th international conference on Computational Linguistics, (501-es)
  1480. Holdsworth J (2004). Graph traversal and graph transformation, Theoretical Computer Science, 321:2-3, (215-231), Online publication date: 16-Aug-2004.
  1481. ACM
    McGuffin M and schraefel m A comparison of hyperstructures Proceedings of the fifteenth ACM conference on Hypertext and hypermedia, (153-162)
  1482. Tam V, Ho J and Kwan A Applying an improved heuristic based optimiser to solve a set of challenging university timetabling problems Proceedings of the 8th Pacific Rim International Conference on Trends in Artificial Intelligence, (164-172)
  1483. Gerbessiotis A and Lee S (2004). Remote memory access: A case for portable, efficient and library independent parallel programming, Scientific Programming, 12:3, (169-183), Online publication date: 1-Aug-2004.
  1484. Lee C, Huang C, Yang L and Rajasekaran S (2004). Distributed Path-Based Inference in Semantic Networks, The Journal of Supercomputing, 29:2, (211-227), Online publication date: 1-Aug-2004.
  1485. Vasconcelos W, Robertson D, Sierra C, Esteva M, Sabater J and Wooldridge M (2004). Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming, Annals of Mathematics and Artificial Intelligence, 41:2-4, (135-169), Online publication date: 1-Aug-2004.
  1486. Hou T, Yang C and Chen K (2004). Adaptive message scheduling for supporting causal ordering in wide-area group communications, Journal of Systems and Software, 72:3, (321-333), Online publication date: 1-Aug-2004.
  1487. Edelkamp S, Leue S and Lluch-Lafuente A (2004). Partial-order reduction and trail improvement in directed model checking, International Journal on Software Tools for Technology Transfer (STTT), 6:4, (277-301), Online publication date: 1-Aug-2004.
  1488. Mittal N and Garg V (2004). Finding missing synchronization in a distributed computation using controlled re-execution, Distributed Computing, 17:2, (107-130), Online publication date: 1-Aug-2004.
  1489. ACM
    Gao J and Zhang L Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (189-196)
  1490. Kanthak S and Ney H FSA Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (510-es)
  1491. Althaus E, Karamanis N and Koller A Computing locally coherent discourses Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (399-es)
  1492. Pang B and Lee L A sentimental education Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, (271-es)
  1493. Gal Y and Pfeffer A Reasoning about Rationality and Beliefs Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2, (774-781)
  1494. van Otterloo S, van der Hoek W and Wooldridge M Preferences in Game Logics Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, (152-159)
  1495. ACM
    Visser W, Pǎsǎreanu C and Khurshid S Test input generation with java PathFinder Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, (97-107)
  1496. ACM
    Nachmanson L, Veanes M, Schulte W, Tillmann N and Grieskamp W Optimal strategies for testing nondeterministic systems Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis, (55-64)
  1497. ACM
    Carr N and Hart J Two algorithms for fast reclustering of dynamic meshed surfaces Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, (224-234)
  1498. ACM
    Carlsson G, Zomorodian A, Collins A and Guibas L Persistence barcodes for shapes Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing, (124-135)
  1499. Kirshner S, Smyth P and Robertson A Conditional Chow-Liu tree structures for modeling discrete-valued vector time series Proceedings of the 20th conference on Uncertainty in artificial intelligence, (317-324)
  1500. Cole-Mclaughlin K, Edelsbrunner H, Harer J, Natarajan V and Pascucci V (2004). Loops in Reeb Graphs of 2-Manifolds, Discrete & Computational Geometry, 32:2, (231-244), Online publication date: 1-Jul-2004.
  1501. ACM
    Visser W, Pǎsǎreanu C and Khurshid S (2004). Test input generation with java PathFinder, ACM SIGSOFT Software Engineering Notes, 29:4, (97-107), Online publication date: 1-Jul-2004.
  1502. ACM
    Nachmanson L, Veanes M, Schulte W, Tillmann N and Grieskamp W (2004). Optimal strategies for testing nondeterministic systems, ACM SIGSOFT Software Engineering Notes, 29:4, (55-64), Online publication date: 1-Jul-2004.
  1503. Woon Y, Ng W and Lim E (2004). A Support-Ordered Trie for Fast Frequent Itemset Discovery, IEEE Transactions on Knowledge and Data Engineering, 16:7, (875-879), Online publication date: 1-Jul-2004.
  1504. Oliveira J, Yu S and Georganas N (2004). Synchronized World Embedding in Virtual Environments, IEEE Computer Graphics and Applications, 24:4, (73-83), Online publication date: 1-Jul-2004.
  1505. Godskesen J (2004). Connectivity Testing, Formal Methods in System Design, 25:1, (5-38), Online publication date: 1-Jul-2004.
  1506. Sivignon I, Dupont F and Chassery J (2004). Digital intersections, Graphical Models, 66:4, (226-244), Online publication date: 1-Jul-2004.
  1507. ACM
    Ginat D Do senior CS students capitalize on recursion? Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (82-86)
  1508. ACM
    Ginat D Embedding instructive assertions in program design Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (62-66)
  1509. ACM
    Beaver J, Morsillo N, Pruhs K, Chrysanthis P and Liberatore V Scalable dissemination Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004, (31-36)
  1510. ACM
    Hershberger J and Suri S Adaptive sampling for geometric problems over data streams Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (252-262)
  1511. ACM
    Gupta S, Kopparty S and Ravishankar C Roads, codes, and spatiotemporal queries Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (115-124)
  1512. Béal M, Bergeron A, Corteel S and Raffinot M (2004). An algorithmic view of gene teams, Theoretical Computer Science, 320:2-3, (395-418), Online publication date: 14-Jun-2004.
  1513. ACM
    Cohen M and Gudes E Diagonally Subgraphs Pattern Mining Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, (51-58)
  1514. ACM
    Azar Y and Richter Y The zero-one principle for switching networks Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, (64-71)
  1515. ACM
    Pfaff B Performance analysis of BSTs in system software Proceedings of the joint international conference on Measurement and modeling of computer systems, (410-411)
  1516. ACM
    Marin G and Mellor-Crummey J Cross-architecture performance predictions for scientific applications using parameterized models Proceedings of the joint international conference on Measurement and modeling of computer systems, (2-13)
  1517. Freytag M and Shapiro V B-rep SE Proceedings of the ninth ACM symposium on Solid modeling and applications, (157-168)
  1518. ACM
    Zhuang X and Pande S (2004). Balancing register allocation across threads for a multithreaded network processor, ACM SIGPLAN Notices, 39:6, (289-300), Online publication date: 9-Jun-2004.
  1519. ACM
    Venet A and Brat G (2004). Precise and efficient static array bound checking for large embedded C programs, ACM SIGPLAN Notices, 39:6, (231-242), Online publication date: 9-Jun-2004.
  1520. ACM
    Zhuang X and Pande S Balancing register allocation across threads for a multithreaded network processor Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, (289-300)
  1521. ACM
    Venet A and Brat G Precise and efficient static array bound checking for large embedded C programs Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, (231-242)
  1522. ACM
    Nookala V and Sapatnekar S A method for correcting the functionality of a wire-pipelined circuit Proceedings of the 41st annual Design Automation Conference, (570-575)
  1523. ACM
    Li W, Reddy S and Pomeranz I On test generation for transition faults with minimized peak power dissipation Proceedings of the 41st annual Design Automation Conference, (504-509)
  1524. ACM
    Huang L and Wong M Optical proximity correction (OPC) Proceedings of the 41st annual Design Automation Conference, (186-191)
  1525. ACM
    Bhattacharya S, Jangkrajarng N, Hartono R and Shi C Correct-by-construction layout-centric retargeting of large analog designs Proceedings of the 41st annual Design Automation Conference, (139-144)
  1526. Muscettola N Incremental maximum flows for fast envelope computation Proceedings of the Fourteenth International Conference on International Conference on Automated Planning and Scheduling, (260-268)
  1527. Collins A, Zomorodian A, Carlsson G and Guibas L A barcode shape descriptor for curve point cloud data Proceedings of the First Eurographics conference on Point-Based Graphics, (181-191)
  1528. ACM
    Pfaff B (2004). Performance analysis of BSTs in system software, ACM SIGMETRICS Performance Evaluation Review, 32:1, (410-411), Online publication date: 1-Jun-2004.
  1529. ACM
    Marin G and Mellor-Crummey J (2004). Cross-architecture performance predictions for scientific applications using parameterized models, ACM SIGMETRICS Performance Evaluation Review, 32:1, (2-13), Online publication date: 1-Jun-2004.
  1530. Wang W, Raghunathan A, Lakshminarayana G and Jha N (2004). Input space adaptive design, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 12:6, (590-602), Online publication date: 1-Jun-2004.
  1531. Michael M (2004). Hazard Pointers, IEEE Transactions on Parallel and Distributed Systems, 15:6, (491-504), Online publication date: 1-Jun-2004.
  1532. Legrand A, Renard H, Robert Y and Vivien F (2004). Mapping and Load-Balancing Iterative Computations, IEEE Transactions on Parallel and Distributed Systems, 15:6, (546-558), Online publication date: 1-Jun-2004.
  1533. Liu B, Lombardi F, Park N and Choi M (2004). Testing Layered Interconnection Networks, IEEE Transactions on Computers, 53:6, (710-722), Online publication date: 1-Jun-2004.
  1534. Chang W, Guo M and Ho M (2004). Towards solution of the set-splitting problem on gel-based DNA computing, Future Generation Computer Systems, 20:5, (875-885), Online publication date: 1-Jun-2004.
  1535. van Oostrum R and Veltkamp R (2004). Parametric search made practical, Computational Geometry: Theory and Applications, 28:2-3, (75-88), Online publication date: 1-Jun-2004.
  1536. ACM
    Burkhart M, von Rickenbach P, Wattenhofer R and Zollinger A Does topology control reduce interference? Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing, (9-19)
  1537. ACM
    Babaioff M, Nisan N and Pavlov E Mechanisms for a spatially distributed market Proceedings of the 5th ACM conference on Electronic commerce, (9-20)
  1538. McGrail R and McGrail T (2004). A grading dilemma or the abyss between sorting and the knapsack problem, Journal of Computing Sciences in Colleges, 19:5, (97-107), Online publication date: 1-May-2004.
  1539. Duale A and Uyar M (2004). A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models, IEEE Transactions on Computers, 53:5, (614-627), Online publication date: 1-May-2004.
  1540. ACM
    Wang J and Zhou H Minimal period retiming under process variations Proceedings of the 14th ACM Great Lakes symposium on VLSI, (131-135)
  1541. ACM
    Basu P and Redi J Effect of overhearing transmissions on energy efficiency in dense sensor networks Proceedings of the 3rd international symposium on Information processing in sensor networks, (196-204)
  1542. ACM
    Xiang H, Chao K and Wong M An ECO algorithm for eliminating crosstalk violations Proceedings of the 2004 international symposium on Physical design, (41-46)
  1543. Abudiab M, Starek M, Lumampao R and Nguyen A (2004). Utilization of GIS and graph theory for determination of optimal mailing route, Journal of Computing Sciences in Colleges, 19:4, (273-278), Online publication date: 1-Apr-2004.
  1544. ACM
    Grant B, Philipose M, Mock M, Chambers C and Eggers S (2004). A retrospective on, ACM SIGPLAN Notices, 39:4, (656-669), Online publication date: 1-Apr-2004.
  1545. Wu C, Chiu Y and Cheng K (2004). Error-Tolerant Sign Retrieval Using Visual Features and Maximum A Posteriori Estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:4, (495-508), Online publication date: 1-Apr-2004.
  1546. Raphael B, Liu L and Varghese G (2004). A Uniform Projection Method for Motif Discovery in DNA Sequences, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:2, (91-94), Online publication date: 1-Apr-2004.
  1547. Ho C and Stockmeyer L (2004). A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers, IEEE Transactions on Computers, 53:4, (427-439), Online publication date: 1-Apr-2004.
  1548. Yao J and Veeravalli B (2004). Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs, Cluster Computing, 7:2, (191-207), Online publication date: 1-Apr-2004.
  1549. Wang H and Pieprzyk J (2004). Shared generation of pseudo-random functions, Journal of Complexity, 20:2-3, (458-472), Online publication date: 1-Apr-2004.
  1550. Iyer S and Saxena B (2004). Improved genetic algorithm for the permutation flowshop scheduling problem, Computers and Operations Research, 31:4, (593-606), Online publication date: 1-Apr-2004.
  1551. Krishnamurthy R, Chakaravarthy V, Kaushik R and Naughton J Recursive XML Schemas, Recursive XML Queries, and Relational Storage Proceedings of the 20th International Conference on Data Engineering
  1552. ACM
    Pevzner P, Tang H and Tesler G De novo repeat classification and fragment assembly Proceedings of the eighth annual international conference on Research in computational molecular biology, (213-222)
  1553. ACM
    Li J and Jiang T An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming Proceedings of the eighth annual international conference on Resaerch in computational molecular biology, (20-29)
  1554. Poon W, Lo K and Feng J Hierarchical Network Architecture for Layered Video Streaming Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7, (164-169)
  1555. Gülpinar N, Gutin G, Mitra G and Zverovitch A (2004). Extracting pure network submatrices in linear programs using signed graphs, Discrete Applied Mathematics, 137:3, (359-372), Online publication date: 15-Mar-2004.
  1556. ACM
    Buchholz S and Buchholz T Replica placement in adaptive content distribution networks Proceedings of the 2004 ACM symposium on Applied computing, (1705-1710)
  1557. ACM
    Carvalho A, Oliveira A, Freitas A and Sagot M A parallel algorithm for the extraction of structured motifs Proceedings of the 2004 ACM symposium on Applied computing, (147-153)
  1558. ACM
    Kessler C A practical access to the theory of parallel algorithms Proceedings of the 35th SIGCSE technical symposium on Computer science education, (397-401)
  1559. Edelkamp S, Leue S and Lluch-Lafuente A (2004). Directed explicit-state model checking in the validation of communication protocols, International Journal on Software Tools for Technology Transfer (STTT), 5:2-3, (247-267), Online publication date: 1-Mar-2004.
  1560. ACM
    Kessler C (2004). A practical access to the theory of parallel algorithms, ACM SIGCSE Bulletin, 36:1, (397-401), Online publication date: 1-Mar-2004.
  1561. Wei J (2004). Markov Edit Distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:3, (311-321), Online publication date: 1-Mar-2004.
  1562. Cannon A and Cowen L (2004). Approximation Algorithms for the Class Cover Problem, Annals of Mathematics and Artificial Intelligence, 40:3-4, (215-223), Online publication date: 1-Mar-2004.
  1563. Agbaria A, Attiya H, Friedman R and Vitenberg R (2004). Quantifying rollback propagation in distributed checkpointing, Journal of Parallel and Distributed Computing, 64:3, (370-384), Online publication date: 1-Mar-2004.
  1564. ACM
    Baker Z and Prasanna V Time and area efficient pattern matching on FPGAs Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays, (223-232)
  1565. Lin C and Zhou H Wire Retiming for System-on-Chip by Fixpoint Computation Proceedings of the conference on Design, automation and test in Europe - Volume 2
  1566. da Fonseca G, de Figueiredo C and Carvalho P (2004). Kinetic hanger, Information Processing Letters, 89:3, (151-157), Online publication date: 14-Feb-2004.
  1567. Yuh P, Yang C, Chang Y and Chen H Temporal floorplanning using 3D-subTCG Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (725-730)
  1568. Zhu Q, Zhou H, Jing T, Hong X and Yang Y Efficient octilinear Steiner tree construction based on spanning graphs Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (687-690)
  1569. Müller-Olm M (2004). Precise interprocedural dependence analysis of parallel programs, Theoretical Computer Science, 311:1-3, (325-388), Online publication date: 23-Jan-2004.
  1570. Awerbuch B and Scheideler C The hyperring Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (318-327)
  1571. Emek Y and Peleg D Approximating Minimum Max-Stretch spanning Trees on unweighted graphs Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (261-270)
  1572. Subrahmanian V, Kraus S and Zhang Y Distributed algorithms for dynamic survivability of multiagent systems Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems, (1-15)
  1573. Felner A, Stern R, Ben-Yair A, Kraus S and Netanyahu N (2004). PHA*, Journal of Artificial Intelligence Research, 21:1, (631-670), Online publication date: 1-Jan-2004.
  1574. Boutilier C, Brafman R, Domshlak C, Hoos H and Poole D (2004). CP-nets, Journal of Artificial Intelligence Research, 21:1, (135-191), Online publication date: 1-Jan-2004.
  1575. DeHon A Law of large numbers system design Nano, quantum and molecular computing, (213-241)
  1576. Qiu Z and Lu M Dynamic DNA computing model Biocomputing, (73-90)
  1577. ACM
    Chen C and Cheng C (2004). From discrepancy to declustering, Journal of the ACM, 51:1, (46-73), Online publication date: 1-Jan-2004.
  1578. Falcão A, Stolfi J and de Alencar Lotufo R (2004). The Image Foresting Transform, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:1, (19-29), Online publication date: 1-Jan-2004.
  1579. Santi P and Chessa S (2004). Reducing the Number of Sequential Diagnosis Iterations in Hypercubes, IEEE Transactions on Computers, 53:1, (89-92), Online publication date: 1-Jan-2004.
  1580. Filippi C (2004). An Algorithm for Approximate Multiparametric Linear Programming, Journal of Optimization Theory and Applications, 120:1, (73-95), Online publication date: 1-Jan-2004.
  1581. Barbulescu L, Watson J, Whitley L and Howe A (2004). Scheduling Space–Ground Communications for the Air Force Satellite Control Network, Journal of Scheduling, 7:1, (7-34), Online publication date: 1-Jan-2004.
  1582. Dovier A, Piazza C and Pontelli E (2004). Disunification in ACI1 Theories, Constraints, 9:1, (35-91), Online publication date: 1-Jan-2004.
  1583. Gudmundsson J, Haverkort H, Park S, Shin C and Wolff A (2004). Facility location and the geometric minimum-diameter spanning tree, Computational Geometry: Theory and Applications, 27:1, (87-106), Online publication date: 1-Jan-2004.
  1584. Lavi R and Nisan N (2004). Competitive analysis of incentive compatible on-line auctions, Theoretical Computer Science, 310:1-3, (159-180), Online publication date: 1-Jan-2004.
  1585. Demestichas P, Stavroulaki V, Tountopoulos V, Theologou M and Mitrou N (2004). Service provider oriented management systems over open cellular network infrastructures, Journal of Systems and Software, 69:1-2, (1-14), Online publication date: 1-Jan-2004.
  1586. Ganapathy S and Hill R Agent models II Proceedings of the 35th conference on Winter simulation: driving innovation, (999-1003)
  1587. Aggour K, Guhde R, Simmons M and Simon M Simulation and verification II Proceedings of the 35th conference on Winter simulation: driving innovation, (932-940)
  1588. Bause F and Eickhoff M Simulation output analysis Proceedings of the 35th conference on Winter simulation: driving innovation, (414-421)
  1589. Jiménez D Fast Path-Based Neural Branch Prediction Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
  1590. Oflazer K (2003). Dependency Parsing with an Extended Finite-State Approach, Computational Linguistics, 29:4, (515-544), Online publication date: 1-Dec-2003.
  1591. Kwok S and Yang C (2003). Copyright Protection Schemes for On-Line Media Distribution E-Services, International Journal of Electronic Commerce, 8:2, (119-138), Online publication date: 1-Dec-2003.
  1592. Ghosh S (2003). Triggering Creativity in Science and Engineering, Journal of Intelligent and Robotic Systems, 38:3-4, (255-275), Online publication date: 1-Dec-2003.
  1593. Tsamardinos I and Pollack M (2003). Efficient solution techniques for disjunctive temporal reasoning problems, Artificial Intelligence, 151:1-2, (43-89), Online publication date: 1-Dec-2003.
  1594. Shimony S and Domshlak C (2003). Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks, Artificial Intelligence, 151:1-2, (213-225), Online publication date: 1-Dec-2003.
  1595. Bakic´ A, Mutka M and Rover D (2003). An on-line performance visualization technology, Software—Practice & Experience, 33:15, (1447-1469), Online publication date: 1-Dec-2003.
  1596. ACM
    Ding Y and Li Z A Compiler Analysis of Interprocedural Data Communication Proceedings of the 2003 ACM/IEEE conference on Supercomputing
  1597. Ravindran K, Kuehlmann A and Sentovich E Multi-Domain Clock Skew Scheduling Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  1598. Ozdal M and Wong M Length-Matching Routing for High-Speed Printed Circuit Boards Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  1599. Agnihotri A, YILDIZ M, Khatkhate A, Mathur A, Ono S and Madden P Fractional Cut Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  1600. Chu C, Young E, Tong D and Dechu S Retiming with Interconnect and Gate Delay Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  1601. Lin C and Zhou H Retiming for Wire Pipelining in System-On-Chip Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  1602. ACM
    Jespersen S, Pedersen T and Thorhauge J Evaluating the markov assumption for web usage mining Proceedings of the 5th ACM international workshop on Web information and data management, (82-89)
  1603. ACM
    Onizuka M Light-weight xPath processing of XML stream with deterministic automata Proceedings of the twelfth international conference on Information and knowledge management, (342-349)
  1604. ACM
    Yang H, Chaisorn L, Zhao Y, Neo S and Chua T VideoQA Proceedings of the eleventh ACM international conference on Multimedia, (632-641)
  1605. ACM
    Menon V, Pingali K and Mateev N (2003). Fractal symbolic analysis, ACM Transactions on Programming Languages and Systems, 25:6, (776-813), Online publication date: 1-Nov-2003.
  1606. Veeravalli B (2003). Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence, IEEE Transactions on Knowledge and Data Engineering, 15:6, (1487-1497), Online publication date: 1-Nov-2003.
  1607. Pavlov D, Mannila H and Smyth P (2003). Beyond Independence, IEEE Transactions on Knowledge and Data Engineering, 15:6, (1409-1421), Online publication date: 1-Nov-2003.
  1608. ACM
    Huang H and Wu S An approach to certificate path discovery in mobile Ad Hoc networks Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, (41-52)
  1609. ACM
    Mohanty S and Prasanna V A hierarchical approach for energy efficient application design using heterogeneous embedded systems Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems, (243-254)
  1610. ACM
    Lim H, Hou J and Choi C Constructing internet coordinate system based on delay measurement Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, (129-142)
  1611. ACM
    Ganapathy V, Jha S, Chandler D, Melski D and Vitek D Buffer overrun detection using linear programming and static analysis Proceedings of the 10th ACM conference on Computer and communications security, (345-354)
  1612. ACM
    Damiani E, Vimercati S, Jajodia S, Paraboschi S and Samarati P Balancing confidentiality and efficiency in untrusted relational DBMSs Proceedings of the 10th ACM conference on Computer and communications security, (93-102)
  1613. ACM
    Lau T, Domingos P and Weld D Learning programs from traces using version space algebra Proceedings of the 2nd international conference on Knowledge capture, (36-43)
  1614. Szymczak A and Vanderhyde J Extraction of Topologically Simple Isosurfaces from Volume Datasets Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
  1615. Lou W, Liu W and Fang Y SPREAD Proceedings of the 2003 IEEE conference on Military communications - Volume II, (808-813)
  1616. Zhu M and Chugg K Iterative message passing techniques for rapid code acquisition Proceedings of the 2003 IEEE conference on Military communications - Volume I, (434-439)
  1617. Barnat J, Brim L and Chaloupka J Parallel breadth-first search LTL model-checking Proceedings of the 18th IEEE International Conference on Automated Software Engineering, (106-115)
  1618. ACM
    Sollins K (2003). Designing for scale and differentiation, ACM SIGCOMM Computer Communication Review, 33:4, (267-276), Online publication date: 1-Oct-2003.
  1619. ACM
    Liu Y and Stoller S (2003). Optimizing Ackermann's function by incrementalization, ACM SIGPLAN Notices, 38:10, (85-91), Online publication date: 1-Oct-2003.
  1620. Kim J and Lee S (2003). Transitive Mesh Space of a Progressive Mesh, IEEE Transactions on Visualization and Computer Graphics, 9:4, (463-480), Online publication date: 1-Oct-2003.
  1621. Dobra A, Karr A and Sanil A (2003). Preserving confidentiality of high-dimensional tabulated data, Statistics and Computing, 13:4, (363-370), Online publication date: 1-Oct-2003.
  1622. Fern A and Givan R (2003). Online Ensemble Learning, Machine Language, 53:1-2, (71-109), Online publication date: 1-Oct-2003.
  1623. Wang S and Armstrong M (2003). A quadtree approach to domain decomposition for spatial interpolation in grid computing environments, Parallel Computing, 29:10, (1481-1504), Online publication date: 1-Oct-2003.
  1624. Frigioni D, Marchetti-Spaccamela A and Nanni U (2003). Fully dynamic shortest paths in digraphs with arbitrary arc weights, Journal of Algorithms, 49:1, (86-113), Online publication date: 1-Oct-2003.
  1625. Chen D, Daescu O, Hu X and Xu J (2003). Finding an optimal path without growing the tree, Journal of Algorithms, 49:1, (13-41), Online publication date: 1-Oct-2003.
  1626. ACM
    Kozat U and Tassiulas L Throughput capacity of random ad hoc networks with infrastructure support Proceedings of the 9th annual international conference on Mobile computing and networking, (55-65)
  1627. Papadias D, Zhang J, Mamoulis N and Tao Y Query processing in spatial network databases Proceedings of the 29th international conference on Very large data bases - Volume 29, (802-813)
  1628. Guha S, Gunopoulos D, Koudas N, Srivastava D and Vlachos M Efficient approximation of optimization queries under parametric aggregation constraints Proceedings of the 29th international conference on Very large data bases - Volume 29, (778-789)
  1629. Shi Y, Song Y and Zhang A A shrinking-based approach for multi-dimensional data analysis Proceedings of the 29th international conference on Very large data bases - Volume 29, (440-451)
  1630. ACM
    Jacox E and Samet H (2003). Iterative spatial join, ACM Transactions on Database Systems, 28:3, (230-256), Online publication date: 1-Sep-2003.
  1631. Yu D and Zhang A (2003). ClusterTree, IEEE Transactions on Knowledge and Data Engineering, 15:5, (1316-1337), Online publication date: 1-Sep-2003.
  1632. Caprara A, Monaci M and Toth P (2003). Models and algorithms for a staff scheduling problem, Mathematical Programming: Series A and B, 98:1-3, (445-476), Online publication date: 1-Sep-2003.
  1633. ACM
    Sollins K Designing for scale and differentiation Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, (267-276)
  1634. ACM
    Chaver D, Piñuel L, Prieto M, Tirado F and Huang M Branch prediction on demand Proceedings of the 2003 international symposium on Low power electronics and design, (390-395)
  1635. ACM
    Jamjoom H and Shin K Persistent dropping Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, (287-298)
  1636. Khatib L, Morris P, Morris R and Venable K Tractable Pareto optimization of temporal preferences Proceedings of the 18th international joint conference on Artificial intelligence, (1289-1294)
  1637. Gerevini A Incremental tractable reasoning about qualitative temporal constraints Proceedings of the 18th international joint conference on Artificial intelligence, (1283-1288)
  1638. Kraus S, Subrahmanian V and Tas N Probabilistically survivable MASs Proceedings of the 18th international joint conference on Artificial intelligence, (789-795)
  1639. Brown M, Burschka D and Hager G (2003). Advances in Computational Stereo, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:8, (993-1008), Online publication date: 1-Aug-2003.
  1640. Lu B, Xu Y, Zhu B and Du D (2003). On a Minimum Linear Classification Problem, Journal of Global Optimization, 26:4, (435-441), Online publication date: 1-Aug-2003.
  1641. Jensen J and Heusdens R (2003). Schemes for optimal frequency-differential encoding of sinusoidal model parameters, Signal Processing, 83:8, (1721-1735), Online publication date: 1-Aug-2003.
  1642. Wu X, Chen D, Mason J and Schmid S Pairwise data clustering and applications Proceedings of the 9th annual international conference on Computing and combinatorics, (455-466)
  1643. Iwama K, Kawachi A and Yamashita S Quantum sampling for balanced allocations Proceedings of the 9th annual international conference on Computing and combinatorics, (304-318)
  1644. Kutz M The complexity of Boolean matrix root computation Proceedings of the 9th annual international conference on Computing and combinatorics, (212-221)
  1645. Zhou X, Matsuo Y and Nishizeki T List total colorings of series-parallel graphs Proceedings of the 9th annual international conference on Computing and combinatorics, (172-181)
  1646. Zhang H and He X On even triangulations of 2-connected embedded graphs Proceedings of the 9th annual international conference on Computing and combinatorics, (139-148)
  1647. Allauzen C and Mohri M An efficient pre-determinization algorithm Proceedings of the 8th international conference on Implementation and application of automata, (83-95)
  1648. ACM
    Hunsberger L Distributing the control of a temporal network among multiple agents Proceedings of the second international joint conference on Autonomous agents and multiagent systems, (899-906)
  1649. ACM
    Nicolescu M and Mataric M Natural methods for robot task learning Proceedings of the second international joint conference on Autonomous agents and multiagent systems, (241-248)
  1650. ACM
    Herlihy M, Luchangco V, Moir M and Scherer W Software transactional memory for dynamic-sized data structures Proceedings of the twenty-second annual symposium on Principles of distributed computing, (92-101)
  1651. Métivier Y, Saheb N and Zemmari A (2003). Analysis of a randomized rendezvous algorithm, Information and Computation, 184:1, (109-128), Online publication date: 10-Jul-2003.
  1652. Korenblit M and Levit V On algebraic expressions of series-parallel and Fibonacci graphs Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science, (215-224)
  1653. Wang G, Chua T and Wang Y Extracting key semantic terms from Chinese speech query for web searches Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1, (248-255)
  1654. Song Y, Goncalves L and Perona P (2003). Unsupervised Learning of Human Motion, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:7, (814-827), Online publication date: 1-Jul-2003.
  1655. Lähdesmäki H, Shmulevich I and Yli-Harja O (2003). On Learning Gene Regulatory Networks Under the Boolean Network Model, Machine Language, 52:1-2, (147-167), Online publication date: 1-Jul-2003.
  1656. Cohen I, Sebe N, Garg A, Chen L and Huang T (2003). Facial expression recognition from video sequences, Computer Vision and Image Understanding, 91:1-2, (160-187), Online publication date: 1-Jul-2003.
  1657. Koenig S, Tovey C and Smirnov Y (2003). Performance bounds for planning in unknown terrain, Artificial Intelligence, 147:1-2, (253-279), Online publication date: 1-Jul-2003.
  1658. Raman R and Rao S Succinct dynamic dictionaries and trees Proceedings of the 30th international conference on Automata, languages and programming, (357-368)
  1659. ACM
    Fang X, Lee J and Midkiff S Automatic fence insertion for shared memory multiprocessing Proceedings of the 17th annual international conference on Supercomputing, (285-294)
  1660. Heaney M Charles Proceedings of the 8th Ada-Europe international conference on Reliable software technologies, (271-282)
  1661. Korovin K and Voronkov A (2003). Orienting rewrite rules with the Knuth--Bendix order, Information and Computation, 183:2, (165-186), Online publication date: 15-Jun-2003.
  1662. Shi Z, Milios E and Zincir-Heywood N Post-supervised template induction for dynamic web sources Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence, (268-282)
  1663. Bagnara R, Hill P, Ricci E and Zaffanella E Precise widening operators for convex polyhedra Proceedings of the 10th international conference on Static analysis, (337-354)
  1664. Avants B and Gee J Continuous curve matching with scale-space curvature and extrema-based scale selection Proceedings of the 4th international conference on Scale space methods in computer vision, (798-813)
  1665. Eker S Associative-commutative rewriting on large terms Proceedings of the 14th international conference on Rewriting techniques and applications, (14-29)
  1666. ACM
    Ganguly S, Garofalakis M and Rastogi R Processing set expressions over continuous update streams Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (265-276)
  1667. ACM
    Joisha P and Banerjee P Static array storage optimization in MATLAB Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, (258-268)
  1668. ACM
    Klauck H Quantum time-space tradeoffs for sorting Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (69-76)
  1669. ACM
    Cole-McLaughlin K, Edelsbrunner H, Harer J, Natarajan V and Pascucci V Loops in reeb graphs of 2-manifolds Proceedings of the nineteenth annual symposium on Computational geometry, (344-350)
  1670. ACM
    Chan T Euclidean bounded-degree spanning tree ratios Proceedings of the nineteenth annual symposium on Computational geometry, (11-19)
  1671. ACM
    Liu Y and Stoller S Optimizing Ackermann's function by incrementalization Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (85-91)
  1672. Abrial J, Cansell D and Méry D Formal derivation of spanning trees algorithms Proceedings of the 3rd international conference on Formal specification and development in Z and B, (457-476)
  1673. Lu Q, Huang Y and Shekhar S Evacuation planning Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics, (111-125)
  1674. Tomás A, Bajuelos A and Marques F Approximation algorithms to minimum vertex cover problems on polygons and terrains Proceedings of the 1st international conference on Computational science: PartI, (869-878)
  1675. Mohr J and Li X Computational challenges in multiple wavetable interpolation synthesis Proceedings of the 1st international conference on Computational science: PartI, (447-456)
  1676. Knüpfer A A new data compression technique for event based program traces Proceedings of the 2003 international conference on Computational science: PartIII, (956-965)
  1677. Bang Y, Choo H and Mun Y Reliability problem on all pairs quickest paths Proceedings of the 2003 international conference on Computational science, (518-523)
  1678. ACM
    Ma Y, Hong X, Dong S, Chen S, Cai Y, Cheng C and Gu J Dynamic global buffer planning optimization based on detail block locating and congestion analysis Proceedings of the 40th annual Design Automation Conference, (806-811)
  1679. ACM
    Shi W and Li Z An O(nlogn) time algorithm for optimal buffer insertion Proceedings of the 40th annual Design Automation Conference, (580-585)
  1680. ACM
    Li D, Xie Q and Chou P Scalable modeling and optimization of mode transitions based on decoupled power management architecture Proceedings of the 40th annual Design Automation Conference, (119-124)
  1681. Mulder S and Wunsch D (2003). Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks, Neural Networks, 16:5-6, (827-832), Online publication date: 1-Jun-2003.
  1682. Li H, Srihari R, Niu C and Li W InfoXtract location normalization Proceedings of the HLT-NAACL 2003 workshop on Analysis of geographic references - Volume 1, (39-44)
  1683. Gurevych I, Malaka R, Porzel R and Zorn H Semantic coherence scoring using an ontology Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1, (9-16)
  1684. Althaus E, Polzin T and Daneshmand S Improving linear programming approaches for the steiner tree problem Proceedings of the 2nd international conference on Experimental and efficient algorithms, (1-14)
  1685. ACM
    Lempel R and Moran S Predictive caching and prefetching of query results in search engines Proceedings of the 12th international conference on World Wide Web, (19-28)
  1686. Kranakis E, Santoro N, Sawchuk C and Krizanc D Mobile Agent Rendezvous in a Ring Proceedings of the 23rd International Conference on Distributed Computing Systems
  1687. Zhuang X and Pande S Compiler Scheduling of Mobile Agents for Minimizing Overheads Proceedings of the 23rd International Conference on Distributed Computing Systems
  1688. Herlihy M and Tirthapura S Self-Stabilizing Smoothing and Counting Proceedings of the 23rd International Conference on Distributed Computing Systems
  1689. Lee T, Lin P and Yang T A hybrid scheme for interactive rendering a virtual environment Proceedings of the 2003 international conference on Computational science and its applications: PartIII, (285-294)
  1690. Halman N (2003). A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane, Information Processing Letters, 86:3, (121-128), Online publication date: 16-May-2003.
  1691. ACM
    Joisha P and Banerjee P (2003). Static array storage optimization in MATLAB, ACM SIGPLAN Notices, 38:5, (258-268), Online publication date: 9-May-2003.
  1692. Lee E and Park J Cryptanalysis of the public-key encryption based on braid groups Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques, (477-490)
  1693. Noble J (2003). Recurses!, Computing in Science and Engineering, 5:3, (76-81), Online publication date: 1-May-2003.
  1694. Goel A, Sajid K, Zhou H, Aziz A and Singhal V (2003). BDD Based Procedures for a Theory of Equality with Uninterpreted Functions, Formal Methods in System Design, 22:3, (205-224), Online publication date: 1-May-2003.
  1695. Goldwasser M and Kerbikov B (2003). Admission control with immediate notification, Journal of Scheduling, 6:3, (269-285), Online publication date: 1-May-2003.
  1696. Bose P, van Kreveld M, Maheshwari A, Morin P and Morrison J (2003). Translating a regular grid over a point set, Computational Geometry: Theory and Applications, 25:1-2, (21-34), Online publication date: 1-May-2003.
  1697. Moukrim A (2003). Scheduling unitary task systems with zero-one communication delays for quasi-interval orders, Discrete Applied Mathematics, 127:3, (461-476), Online publication date: 1-May-2003.
  1698. Bermond J, Bond J, Peleg D and Perennes S (2003). The power of small coalitions in graphs, Discrete Applied Mathematics, 127:3, (399-414), Online publication date: 1-May-2003.
  1699. Liu C, Zhang M, Zheng M and Chen Y Step-by-step regression Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining, (437-448)
  1700. Huang Q, Lu C and Roman G Mobicast Proceedings of the 2nd international conference on Information processing in sensor networks, (442-457)
  1701. Klarlund N and Riley M Word n-grams for cluster keyboards Proceedings of the 2003 EACL Workshop on Language Modeling for Text Entry Methods, (51-58)
  1702. Goodrich M, Tamassia R, Triandopoulos N and Cohen R Authenticated data structures for graph and geometric searching Proceedings of the 2003 RSA conference on The cryptographers' track, (295-313)
  1703. ACM
    Ben-Dor A, Hartman T, Schwikowski B, Sharan R and Yakhini Z Towards optimally multiplexed applications of universal DNA tag systems Proceedings of the seventh annual international conference on Research in computational molecular biology, (48-56)
  1704. ACM
    Bejerano G Efficient exact value computation and applications to biosequence analysis Proceedings of the seventh annual international conference on Research in computational molecular biology, (38-47)
  1705. Kandemir M, Irwin M, Chen G and Ramanujam J Address register assignment for reducing code size Proceedings of the 12th international conference on Compiler construction, (273-289)
  1706. Andersson C Register allocation by optimal graph coloring Proceedings of the 12th international conference on Compiler construction, (33-45)
  1707. Vaziri M and Jackson D Checking properties of heap-manipulating procedures with a constraint solver Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (505-520)
  1708. Kubica M A temporal approach to specification and verification of pointer data-structures Proceedings of the 6th international conference on Fundamental approaches to software engineering, (231-245)
  1709. ACM
    Zhou H Efficient Steiner tree construction based on spanning graphs Proceedings of the 2003 international symposium on Physical design, (152-157)
  1710. Yang M Discriminant isometric mapping for face recognition Proceedings of the 3rd international conference on Computer vision systems, (470-480)
  1711. ACM
    Demestichas P, Oikonomou A, Vivier G and Theologou M (2003). Management of wireless home networking technologies in the context of composite radio environments, ACM SIGMOBILE Mobile Computing and Communications Review, 7:2, (33-44), Online publication date: 1-Apr-2003.
  1712. Mahamud S, Williams L, Thornber K and Xu K (2003). Segmentation of Multiple Salient Closed Contours from Real Images, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:4, (433-444), Online publication date: 1-Apr-2003.
  1713. VanderMeer D, Datta A, Dutta K, Ramamritham K and Navathe S (2003). Mobile User Recovery in the Context of Internet Transactions, IEEE Transactions on Mobile Computing, 2:2, (132-146), Online publication date: 1-Apr-2003.
  1714. King O (2003). A mass formula for unimodular lattices with no roots, Mathematics of Computation, 72:242, (839-863), Online publication date: 1-Apr-2003.
  1715. Hadad M, Kraus S, Gal Y and Lin R (2003). Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment, Annals of Mathematics and Artificial Intelligence, 37:4, (331-379), Online publication date: 1-Apr-2003.
  1716. Corrêa R, Gomes F, Oliveira C and Pardalos P (2003). A parallel implementation of an asynchronous team to the point-to-point connection problem, Parallel Computing, 29:4, (447-466), Online publication date: 1-Apr-2003.
  1717. Singh M and Prasanna V Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
  1718. Cai Q and Xue J Optimal and efficient speculation-based partial redundancy elimination Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, (91-102)
  1719. ACM
    Chandran S and Kiran N Image retrieval with embedded region relationships Proceedings of the 2003 ACM symposium on Applied computing, (760-764)
  1720. Cheng W and Pedram M Chromatic Encoding Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
  1721. Högstedt K, Carter L and Ferrante J (2003). On the Parallel Execution Time of Tiled Loops, IEEE Transactions on Parallel and Distributed Systems, 14:3, (307-321), Online publication date: 1-Mar-2003.
  1722. Moon B, Fernando Vega Lopez I and Immanuel V (2003). Efficient Algorithms for Large-Scale Temporal Aggregation, IEEE Transactions on Knowledge and Data Engineering, 15:3, (744-759), Online publication date: 1-Mar-2003.
  1723. Fu C, Bodine J and Conte T (2003). Modeling Value Speculation, IEEE Transactions on Computers, 52:3, (277-292), Online publication date: 1-Mar-2003.
  1724. Liu Y and Stoller S (2003). Dynamic Programming via Static Incrementalization, Higher-Order and Symbolic Computation, 16:1-2, (37-62), Online publication date: 1-Mar-2003.
  1725. ACM
    Ginat D The greedy trap and learning from mistakes Proceedings of the 34th SIGCSE technical symposium on Computer science education, (11-15)
  1726. ACM
    Almási G, Caşcaval C and Padua D (2002). Calculating stack distances efficiently, ACM SIGPLAN Notices, 38:2 supplement, (37-43), Online publication date: 15-Feb-2003.
  1727. ACM
    Hirzel M, Henkel J, Diwan A and Hind M (2002). Understanding the connectivity of heap objects, ACM SIGPLAN Notices, 38:2 supplement, (36-49), Online publication date: 15-Feb-2003.
  1728. ACM
    Lin J, Chuang J, Lin C and Chen C Consistent parametrization by quinary subdivision for remeshing and mesh metamorphosis Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia, (151-158)
  1729. Heitsch H and Römisch W (2003). Scenario Reduction Algorithms in Stochastic Programming, Computational Optimization and Applications, 24:2-3, (187-206), Online publication date: 1-Feb-2003.
  1730. Kleinberg J, Papadimitriou C and Raghavan P (2003). Auditing Boolean attributes, Journal of Computer and System Sciences, 66:1, (244-253), Online publication date: 1-Feb-2003.
  1731. ACM
    Tan S and Shi C Efficient DDD-based term generation algorithm for analog circuit behavioral modeling Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (789-794)
  1732. ACM
    Balasa F, Maruvada S and Krishnamoorthy K Using red-black interval trees in device-level analog placement with symmetry constraints Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (777-782)
  1733. ACM
    Jiang I, Chang Y, Jou J and Chao K Simultaneous floorplanning and buffer block planning Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (431-434)
  1734. ACM
    Chen H, Huang L, Liu I, Lai M and Wong D Floorplanning with power supply noise avoidance Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (427-430)
  1735. ACM
    Wong K and Young E Fast buffer planning and congestion optimization in interconnect-driven floorplanning Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (411-416)
  1736. ACM
    Acar U, Blelloch G and Harper R (2003). Selective memoization, ACM SIGPLAN Notices, 38:1, (14-25), Online publication date: 15-Jan-2003.
  1737. ACM
    Acar U, Blelloch G and Harper R Selective memoization Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (14-25)
  1738. Gentilini R, Piazza C and Policriti A Computing strongly connected components in a linear number of symbolic steps Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (573-582)
  1739. Fix J The set-associative cache performance of search trees Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (565-572)
  1740. Thorup M Quick and good facility location Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (178-185)
  1741. ACM
    Popescu A, Etzioni O and Kautz H Towards a theory of natural language interfaces to databases Proceedings of the 8th international conference on Intelligent user interfaces, (149-157)
  1742. ACM
    Ginat D (2003). The greedy trap and learning from mistakes, ACM SIGCSE Bulletin, 35:1, (11-15), Online publication date: 11-Jan-2003.
  1743. Mehta V, Dave K, Agrawal V and Bushnell M A Fault-Independent Transitive Closure Algorithm for Redundancy Identification Proceedings of the 16th International Conference on VLSI Design
  1744. Chattopadhyay S and Choudhary N Genetic Algorithm based Approach for Low Power Combinational Circuit Testing Proceedings of the 16th International Conference on VLSI Design
  1745. Hwang H and Tsai T (2003). An asymptotic theory for recurrence relations based on minimization and maximization, Theoretical Computer Science, 290:3, (1475-1501), Online publication date: 3-Jan-2003.
  1746. Chen X and Wu J Multicasting techniques in mobile ad hoc networks The handbook of ad hoc wireless networks, (25-40)
  1747. Min R and Chandrakasan A Energy-efficient communication for high density networks Ambient intelligence, (295-314)
  1748. Edelkamp S and Schrödl S Route planning and map inference with global positioning traces Computer Science in Perspective, (128-151)
  1749. Bieri H Teaching algorithms and data structures Computer Science in Perspective, (39-48)
  1750. Lee I, Park K, Choi Y and Chung S (2003). A Simple and Scalable Algorithm for the IP Address Lookup Problem, Fundamenta Informaticae, 56:1-2, (181-190), Online publication date: 1-Jan-2003.
  1751. Malkhi D Dynamic lookup networks Future directions in distributed computing, (93-96)
  1752. Wegner P and Reilly E Tree Encyclopedia of Computer Science, (1792-1795)
  1753. Herman G Algorithms, theory of Encyclopedia of Computer Science, (51-53)
  1754. Hopcroft J and Rus D Algorithms, analysis of Encyclopedia of Computer Science, (42-45)
  1755. Korfhage R Algorithm Encyclopedia of Computer Science, (36-38)
  1756. Li X (2003). A fast and efficient topological coding algorithm for compound images, EURASIP Journal on Advances in Signal Processing, 2003, (1181-1187), Online publication date: 1-Jan-2003.
  1757. Gong Y (2003). Summarizing audiovisual contents of a video program, EURASIP Journal on Advances in Signal Processing, 2003, (160-169), Online publication date: 1-Jan-2003.
  1758. Lee H and Fortes J (2003). Generation of Injective and Reversible Modular Mappings, IEEE Transactions on Parallel and Distributed Systems, 14:1, (1-12), Online publication date: 1-Jan-2003.
  1759. Geiger D, Liu T and Kohn R (2003). Representation and Self-Similarity of Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 25:1, (86-99), Online publication date: 1-Jan-2003.
  1760. Peng W and Chen M (2003). Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System, IEEE Transactions on Knowledge and Data Engineering, 15:1, (70-85), Online publication date: 1-Jan-2003.
  1761. Shieh W, Chen T, Shann J and Chung C (2003). Inverted file compression through document identifier reassignment, Information Processing and Management: an International Journal, 39:1, (117-131), Online publication date: 1-Jan-2003.
  1762. Stomp F (2003). Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm, Theoretical Computer Science, 290:1, (59-78), Online publication date: 1-Jan-2003.
  1763. ACM
    Castro M, Druschel P, Ganesh A, Rowstron A and Wallach D (2002). Secure routing for structured peer-to-peer overlay networks, ACM SIGOPS Operating Systems Review, 36:SI, (299-314), Online publication date: 31-Dec-2003.
  1764. Castro M, Druschel P, Ganesh A, Rowstron A and Wallach D Secure routing for structured peer-to-peer overlay networks Proceedings of the 5th symposium on Operating systems design and implementation (Copyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading), (299-314)
  1765. ACM
    Dasdan A Efficient algorithms for debugging timing constraint violations Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems, (50-56)
  1766. Heckendorn R (2002). Embedded landscapes, Evolutionary Computation, 10:4, (345-369), Online publication date: 1-Dec-2002.
  1767. ACM
    Suraweera F (2002). Enhancing the quality of learning and understanding of first-year mathematics for computer science related majors, ACM SIGCSE Bulletin, 34:4, (117-120), Online publication date: 1-Dec-2002.
  1768. ACM
    Lewis J (2002). A reliable test for inclusion of a point in a polygon, ACM SIGCSE Bulletin, 34:4, (81-84), Online publication date: 1-Dec-2002.
  1769. Gil J and Kimmel R (2002). Efficient Dilation, Erosion, Opening, and Closing Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:12, (1606-1617), Online publication date: 1-Dec-2002.
  1770. Oki E, Jing Z, Rojas-Cessa R and Chao H (2002). Concurrent round-robin-based dispatching schemes for Clos-network switches, IEEE/ACM Transactions on Networking, 10:6, (830-844), Online publication date: 1-Dec-2002.
  1771. Schmiedle F, Drechsler N, Große D and Drechsler R (2002). Heuristic Learning Based on Genetic Programming, Genetic Programming and Evolvable Machines, 3:4, (363-388), Online publication date: 1-Dec-2002.
  1772. Winter S (2002). Modeling Costs of Turns in Route Planning, Geoinformatica, 6:4, (345-361), Online publication date: 1-Dec-2002.
  1773. ACM
    Boyapati C, Lee R and Rinard M (2002). Ownership types for safe programming, ACM SIGPLAN Notices, 37:11, (211-230), Online publication date: 17-Nov-2002.
  1774. ACM
    Tian R, Yu R, Tang X and Wong D On mask layout partitioning for electron projection lithography Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, (514-518)
  1775. ACM
    Nallapati R and Allan J Capturing term dependencies using a language model based on sentence trees Proceedings of the eleventh international conference on Information and knowledge management, (383-390)
  1776. ACM
    Boyapati C, Lee R and Rinard M Ownership types for safe programming Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (211-230)
  1777. ACM
    Wang J and Nahrstedt K (2002). Hop-by-hop routing algorithms for premium traffic, ACM SIGCOMM Computer Communication Review, 32:5, (73-88), Online publication date: 1-Nov-2002.
  1778. Pelillo M (2002). Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:11, (1535-1541), Online publication date: 1-Nov-2002.
  1779. Shekhar S, Lu C, Chawla S and Ravada S (2002). Efficient Join-Index-Based Spatial-Join Processing, IEEE Transactions on Knowledge and Data Engineering, 14:6, (1400-1421), Online publication date: 1-Nov-2002.
  1780. Lim J and Hurson A (2002). Transaction Processing in Mobile, Heterogeneous Database Systems, IEEE Transactions on Knowledge and Data Engineering, 14:6, (1330-1346), Online publication date: 1-Nov-2002.
  1781. Chowdhary A and Gupta R (2002). A Methodology for Synthesis of Data Path Circuitse, IEEE Design & Test, 19:6, (90-100), Online publication date: 1-Nov-2002.
  1782. Andersson A, Carlsson P and Ygge F (2002). Resource Allocation with Wobbly Functions, Computational Optimization and Applications, 23:2, (171-200), Online publication date: 1-Nov-2002.
  1783. Jonsson J and Shin K (2002). Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems, Real-Time Systems, 23:3, (239-271), Online publication date: 1-Nov-2002.
  1784. Edelsbrunner , Letscher and Zomorodian (2002). Topological Persistence and Simplification, Discrete & Computational Geometry, 28:4, (511-533), Online publication date: 1-Nov-2002.
  1785. Sheffer A and Hart J Seamster Proceedings of the conference on Visualization '02, (291-298)
  1786. Pascucci V and Cole-McLaughlin K Efficient computation of the topology of level sets Proceedings of the conference on Visualization '02, (187-194)
  1787. Hitchcock J (2002). MAX3SAT is exponentially hard to approximate if NP has positive dimension, Theoretical Computer Science, 289:1, (861-869), Online publication date: 23-Oct-2002.
  1788. Xiong Z, Chen Y, Wang R and Huang T Improved Information Maximization based Face and Facial Feature Detection from Real-time Video and Application in a Multi-Modal Person Identification System Proceedings of the 4th IEEE International Conference on Multimodal Interfaces
  1789. Vyugin M and V'yugin V (2002). On complexity of easy predictable sequences, Information and Computation, 178:1, (241-252), Online publication date: 10-Oct-2002.
  1790. Lee I, Park K, Choi Y and Chung S (2002). A simple and scalable algorithm for the IP address lookup problem, Fundamenta Informaticae, 56:1,2, (181-190), Online publication date: 1-Oct-2002.
  1791. ACM
    Mahajan R, Wetherall D and Anderson T (2002). Understanding BGP misconfiguration, ACM SIGCOMM Computer Communication Review, 32:4, (3-16), Online publication date: 1-Oct-2002.
  1792. Antoniol G, Canfora G, Casazza G, De Lucia A and Merlo E (2002). Recovering Traceability Links between Code and Documentation, IEEE Transactions on Software Engineering, 28:10, (970-983), Online publication date: 1-Oct-2002.
  1793. Yee W, Navathe S, Omiecinski E and Jermaine C (2002). Efficient Data Allocation over Multiple Channels at Broadcast Servers, IEEE Transactions on Computers, 51:10, (1231-1236), Online publication date: 1-Oct-2002.
  1794. Prabhakar S, Xia Y, Kalashnikov D, Aref W and Hambrusch S (2002). Query Indexing and Velocity Constrained Indexing, IEEE Transactions on Computers, 51:10, (1124-1140), Online publication date: 1-Oct-2002.
  1795. Bookstein A, Kulyukin V and Raita T (2002). Generalized Hamming Distance, Information Retrieval, 5:4, (353-375), Online publication date: 1-Oct-2002.
  1796. Laber E, Milidiú R and Pessoa A (2002). A strategy for searching with different access costs, Theoretical Computer Science, 287:2, (571-584), Online publication date: 28-Sep-2002.
  1797. ACM
    Scaglione A and Servetto S On the interdependence of routing and data compression in multi-hop sensor networks Proceedings of the 8th annual international conference on Mobile computing and networking, (140-147)
  1798. Larsen S, Witchel E and Amarasinghe S Increasing and Detecting Memory Address Congruence Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques, (18-29)
  1799. Zhuang X, Pande S and Greenland J A Framework for Parallelizing Load/Stores on Embedded Processors Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques
  1800. Berghammer R A generic program for minimal subsets with applications Proceedings of the 12th international conference on Logic based program synthesis and transformation, (144-157)
  1801. ACM
    Futamura Y, Konishi Z and Glück R Automatic generation of efficient string matching algorithms by generalized partial computation Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation, (1-8)
  1802. Sacha J, Goodenday L and Cios K (2002). Bayesian learning for cardiac SPECT image interpretation, Artificial Intelligence in Medicine, 26:1-2, (109-143), Online publication date: 1-Sep-2002.
  1803. Ilinkin I, Janardan R, Majhi J, Schwerdt J, Smid M and Sriram R (2002). A decomposition-based approach to layered manufacturing, Computational Geometry: Theory and Applications, 23:2, (117-151), Online publication date: 1-Sep-2002.
  1804. Li H, Srihari R, Niu C and Li W Location normalization for information extraction Proceedings of the 19th international conference on Computational linguistics - Volume 1, (1-7)
  1805. Paul M, Sumita E and Yamamoto S Corpus-based generation of numeral classifier using phrase alignment Proceedings of the 19th international conference on Computational linguistics - Volume 1, (1-7)
  1806. Shah S, Ramamritham K and Shenoy P Maintaining coherency of dynamic data in cooperating repositories Proceedings of the 28th international conference on Very Large Data Bases, (526-537)
  1807. ACM
    Mahajan R, Wetherall D and Anderson T Understanding BGP misconfiguration Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, (3-16)
  1808. Yang J, Wang W, Xia Y and Yu P Accelerating Approximate Subsequence Search on Large Protein Sequence Databases Proceedings of the IEEE Computer Society Conference on Bioinformatics
  1809. ACM
    Pinar A and Hendrickson B Exploiting flexibly assignable work to improve load balance Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (155-163)
  1810. ACM
    Vishkin U Two techniques for reconciling algorithm parallelism with memory constraints Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (95-98)
  1811. ACM
    Michael M High performance dynamic lock-free hash tables and list-based sets Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (73-82)
  1812. Hauskrecht M and Singliar T Monte-Carlo optimizations for resource allocation problems in stochastic network systems Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence, (305-312)
  1813. Aho I (2002). New polynomial-time instances to various knapsack-type problems, Fundamenta Informaticae, 53:3-4, (199-228), Online publication date: 1-Aug-2002.
  1814. Bach F and Jordan M Tree-dependent component analysis Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence, (36-44)
  1815. Sobrinho J (2002). Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet, IEEE/ACM Transactions on Networking, 10:4, (541-550), Online publication date: 1-Aug-2002.
  1816. Cavallaro J (2002). Architectures for Heterogeneous Multi-Tier Networks, Wireless Personal Communications: An International Journal, 22:2, (285-296), Online publication date: 1-Aug-2002.
  1817. King V and Sagert G (2002). A fully dynamic algorithm for maintaining the transitive closure, Journal of Computer and System Sciences, 65:1, (150-167), Online publication date: 1-Aug-2002.
  1818. Brito C and Pearl J A graphical criterion for the identification of causal effects in linear models Eighteenth national conference on Artificial intelligence, (533-538)
  1819. Broxvall M A method for metric temporal reasoning Eighteenth national conference on Artificial intelligence, (513-518)
  1820. Liu Y, Koenig S and Furcy D Speeding up the calculation of heuristics for heuristic search-based planning Eighteenth national conference on Artificial intelligence, (484-491)
  1821. Hunsberger L Algorithms for a temporal decoupling problem in multi-agent planning Eighteenth national conference on Artificial intelligence, (468-475)
  1822. Conitzer V and Sandholm T Complexity of manipulating elections with few candidates Eighteenth national conference on Artificial intelligence, (314-319)
  1823. Yang M Extended isomap for pattern classification Eighteenth national conference on Artificial intelligence, (224-229)
  1824. ACM
    Sequeira K and Zaki M ADMIT Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, (386-395)
  1825. ACM
    Li Y, Wang T and Shum H Motion texture Proceedings of the 29th annual conference on Computer graphics and interactive techniques, (465-472)
  1826. ACM
    Boyapati C, Khurshid S and Marinov D Korat Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, (123-133)
  1827. ACM
    Greenwald M Two-handed emulation Proceedings of the twenty-first annual symposium on Principles of distributed computing, (260-269)
  1828. ACM
    Michael M Safe memory reclamation for dynamic lock-free objects using atomic reads and writes Proceedings of the twenty-first annual symposium on Principles of distributed computing, (21-30)
  1829. ACM
    Dix J, Kraus S and Subrahmanian V Agents dealing with time and uncertainty Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (912-919)
  1830. ACM
    Vasconcelos W, Sabater J, Sierra C and Querol J Skeleton-based agent development for electronic institutions Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2, (696-703)
  1831. Körner H On minimizing cover automata for finite languages in O(n log n) time Proceedings of the 7th international conference on Implementation and application of automata, (117-127)
  1832. Czyzowicz J, Fraczak W, Pelc A and Rytter W Prime decompositions of regular prefix codes Proceedings of the 7th international conference on Implementation and application of automata, (85-94)
  1833. Mohri M Edit-distance of weighted automata Proceedings of the 7th international conference on Implementation and application of automata, (1-23)
  1834. Staniford S, Hoagland J and McAlerney J (2002). Practical automated detection of stealthy portscans, Journal of Computer Security, 10:1-2, (105-136), Online publication date: 1-Jul-2002.
  1835. ACM
    Boyapati C, Khurshid S and Marinov D (2002). Korat, ACM SIGSOFT Software Engineering Notes, 27:4, (123-133), Online publication date: 1-Jul-2002.
  1836. Kollios G and Tsotras V (2002). Hashing Methods for Temporal Data, IEEE Transactions on Knowledge and Data Engineering, 14:4, (902-919), Online publication date: 1-Jul-2002.
  1837. Caruso A, Chessa S, Maestrini P and Santi P (2002). Evaluation of a Diagnosis Algorithm for Regular Structures, IEEE Transactions on Computers, 51:7, (850-865), Online publication date: 1-Jul-2002.
  1838. Givan R, Chong E and Chang H (2002). Scheduling Multiclass Packet Streams to Minimize Weighted Loss, Queueing Systems: Theory and Applications, 41:3, (241-270), Online publication date: 1-Jul-2002.
  1839. Chern H, Hwang H and Tsai T (2002). An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms, Journal of Algorithms, 44:1, (177-225), Online publication date: 1-Jul-2002.
  1840. Jha S, Sheyner O and Wing J Two Formal Analys s of Attack Graphs Proceedings of the 15th IEEE workshop on Computer Security Foundations
  1841. Boroday S, Groz R, Petrenko A and Quemener Y Techniques for abstracting SDL specifications Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC, (141-157)
  1842. ACM
    Krishnamurthy G, Granston E and Stotzer E Affinity-based cluster assignment for unrolled loops Proceedings of the 16th international conference on Supercomputing, (107-116)
  1843. ACM
    Hirzel M, Henkel J, Diwan A and Hind M Understanding the connectivity of heap objects Proceedings of the 3rd international symposium on Memory management, (36-49)
  1844. ACM
    Budimlic Z, Cooper K, Harvey T, Kennedy K, Oberg T and Reeves S Fast copy coalescing and live-range identification Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation, (25-32)
  1845. ACM
    Almási G, Caşcaval C and Padua D Calculating stack distances efficiently Proceedings of the 2002 workshop on Memory system performance, (37-43)
  1846. ACM
    Lin J and Chang Y TCG-S Proceedings of the 39th annual Design Automation Conference, (842-847)
  1847. ACM
    Shenoy N and Nicholls W An efficient routing database Proceedings of the 39th annual Design Automation Conference, (590-595)
  1848. ACM
    Xiang H, Wong D and Tang X An algorithm for integrated pin assignment and buffer planning Proceedings of the 39th annual Design Automation Conference, (584-589)
  1849. ACM
    Kirkpatrick D and Speckmann B Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons Proceedings of the eighteenth annual symposium on Computational geometry, (179-188)
  1850. ACM
    Chew L and Kedem K Finding the consensus shape for a protein family Proceedings of the eighteenth annual symposium on Computational geometry, (64-73)
  1851. ACM
    van Oostrum R and Veltkamp R Parametric search made practical Proceedings of the eighteenth annual symposium on Computational geometry, (1-9)
  1852. ACM
    Chang K and Hwang S Minimal probing Proceedings of the 2002 ACM SIGMOD international conference on Management of data, (346-357)
  1853. ACM
    Gooch B, Coombe G and Shirley P Artistic Vision Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering, (83-ff)
  1854. Muhammad K and Roy K (2002). Reduced computational redundancy implementation of DSP algorithms using computation sharing vector scaling, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 10:3, (292-300), Online publication date: 1-Jun-2002.
  1855. Strijk T and Kreveld M (2002). Practical Extensions of Point Labeling in the Slider Model*, Geoinformatica, 6:2, (181-197), Online publication date: 1-Jun-2002.
  1856. Aho I (2002). New polynomial-time instances to various knapsack-type problems, Fundamenta Informaticae, 53:3,4, (199-228), Online publication date: 30-May-2002.
  1857. ACM
    Jamil H and Zhou R SQL Proceedings of the Working Conference on Advanced Visual Interfaces, (251-256)
  1858. Xu J and Chen H Using shortest path algorithms to identify criminal associations Proceedings of the 2002 annual national conference on Digital government research, (1-7)
  1859. ACM
    Chan T Dynamic subgraph connectivity with geometric applications Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (7-13)
  1860. ACM
    Budimlic Z, Cooper K, Harvey T, Kennedy K, Oberg T and Reeves S (2002). Fast copy coalescing and live-range identification, ACM SIGPLAN Notices, 37:5, (25-32), Online publication date: 17-May-2002.
  1861. Teo Y, Ng Y and Onggo B Conservative simulation using distributed-shared memory Proceedings of the sixteenth workshop on Parallel and distributed simulation, (3-10)
  1862. ACM
    Dumas M, Aldred L, Governatori G, Hofstede A and Russell N A probabilistic approach to automated bidding in alternative auctions Proceedings of the 11th international conference on World Wide Web, (99-108)
  1863. ACM
    Dasdan A A strongly polynomial-time algorithm for over-constraint resolution Proceedings of the tenth international symposium on Hardware/software codesign, (127-132)
  1864. Lin S, Chen M, Ho J and Huang Y (2002). ACIRD, IEEE Transactions on Knowledge and Data Engineering, 14:3, (599-614), Online publication date: 1-May-2002.
  1865. Mertens S (2002). Computational Complexity for Physicists, Computing in Science and Engineering, 4:3, (31-47), Online publication date: 1-May-2002.
  1866. Kostenko V (2002). The Problem of Schedule Construction in the Joint Design of Hardware and Software, Programming and Computing Software, 28:3, (162-173), Online publication date: 1-May-2002.
  1867. Bettini C, Wang X and Jajodia S (2002). Temporal Reasoning in Workflow Systems, Distributed and Parallel Databases, 11:3, (269-306), Online publication date: 1-May-2002.
  1868. Ottosson G, Thorsteinsson E and Hooker J (2002). Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers, Annals of Mathematics and Artificial Intelligence, 34:4, (271-290), Online publication date: 21-Apr-2002.
  1869. ACM
    Rash S and Gusfield D String barcoding Proceedings of the sixth annual international conference on Computational biology, (254-261)
  1870. ACM
    Amato N, Dill K and Song G Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures Proceedings of the sixth annual international conference on Computational biology, (2-11)
  1871. Park J, Penner M and Prasanna V Optimizing Graph Algorithms for Improved Cache Performance Proceedings of the 16th International Parallel and Distributed Processing Symposium
  1872. Gaeke B, Husbands P, Li X, Oliker L, Yelick K and Biswas R Memory-Intensive Benchmarks Proceedings of the 16th International Parallel and Distributed Processing Symposium
  1873. Varoglu Y and Avresky D Survivable Computer Networks in the Presence of Partitioning Proceedings of the 16th International Parallel and Distributed Processing Symposium
  1874. ACM
    Zhang T and Sapatnekar S Optimized pin assignment for lower routing congestion after floorplanning phase Proceedings of the 2002 international workshop on System-level interconnect prediction, (17-21)
  1875. Mohr A Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem Proceedings of the Data Compression Conference
  1876. Barros J and Servetto S Sequencing Multiple Descriptions Proceedings of the Data Compression Conference
  1877. ACM
    Zhao M and Sapatnekar S (2002). Technology mapping algorithms for domino logic, ACM Transactions on Design Automation of Electronic Systems, 7:2, (306-335), Online publication date: 1-Apr-2002.
  1878. ACM
    Dasgupta P, Pan P, Nandy S and Bhattacharya B (2002). Monotone bipartitioning problem in a planar point set with applications to VLSI, ACM Transactions on Design Automation of Electronic Systems, 7:2, (231-248), Online publication date: 1-Apr-2002.
  1879. Auletta V, Das S, De Vivo A, Pinotti M and Scarano V (2002). Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems, IEEE Transactions on Parallel and Distributed Systems, 13:4, (399-412), Online publication date: 1-Apr-2002.
  1880. Borwein P and Hare K (2002). Some computations on the spectra of Pisot and Salem numbers, Mathematics of Computation, 71:238, (767-780), Online publication date: 1-Apr-2002.
  1881. Malkhi D, Margo O and Pavlov E E-voting without 'cryptography' Proceedings of the 6th international conference on Financial cryptography, (1-15)
  1882. ACM
    Ginat D (2002). On varying perspectives of problem decomposition, ACM SIGCSE Bulletin, 34:1, (331-335), Online publication date: 1-Mar-2002.
  1883. ACM
    Bucci P, Heym W, Long T and Weide B (2002). Algorithms and object-oriented programming, ACM SIGCSE Bulletin, 34:1, (302-306), Online publication date: 1-Mar-2002.
  1884. ACM
    Stern L and Naish L (2002). Visual representations for recursive algorithms, ACM SIGCSE Bulletin, 34:1, (196-200), Online publication date: 1-Mar-2002.
  1885. ACM
    Chang F and Wang C (2002). Architectural tradeoff in implementing RSA processors, ACM SIGARCH Computer Architecture News, 30:1, (5-11), Online publication date: 1-Mar-2002.
  1886. ACM
    Liu Y and Stoller S (2002). Program optimization using indexed and recursive data structures, ACM SIGPLAN Notices, 37:3, (108-118), Online publication date: 1-Mar-2002.
  1887. Dogan A and Özgüner F (2002). Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing, IEEE Transactions on Parallel and Distributed Systems, 13:3, (308-323), Online publication date: 1-Mar-2002.
  1888. Topcuouglu H, Hariri S and Wu M (2002). Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing, IEEE Transactions on Parallel and Distributed Systems, 13:3, (260-274), Online publication date: 1-Mar-2002.
  1889. Ruggieri S (2002). Efficient C4.5, IEEE Transactions on Knowledge and Data Engineering, 14:2, (438-444), Online publication date: 1-Mar-2002.
  1890. Dasgupta P, Chakrabarti P, Dey A, Ghose S and Bibel W (2002). Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques, IEEE Transactions on Knowledge and Data Engineering, 14:2, (353-368), Online publication date: 1-Mar-2002.
  1891. Yang W (2002). A Classification of Noncircular Attribute Grammars Based on the Look-Ahead Behavior, IEEE Transactions on Software Engineering, 28:3, (210-227), Online publication date: 1-Mar-2002.
  1892. Tam V and Ma K (2002). Optimizing Personal Computer Configurationswith Heuristic-Based Search Methods, Artificial Intelligence Review, 17:2, (129-140), Online publication date: 1-Mar-2002.
  1893. Futamura Y, Konishi Z and Glück R (2002). Program transformation system based on generalized partial computation, New Generation Computing, 20:1, (75-99), Online publication date: 1-Mar-2002.
  1894. ACM
    Ginat D On varying perspectives of problem decomposition Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (331-335)
  1895. ACM
    Bucci P, Heym W, Long T and Weide B Algorithms and object-oriented programming Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (302-306)
  1896. ACM
    Stern L and Naish L Visual representations for recursive algorithms Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (196-200)
  1897. Johnson M, Somasekhar D, Chiou L and Roy K (2002). Leakage control with efficient use of transistor stacks in single threshold CMOS, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 10:1, (1-5), Online publication date: 1-Feb-2002.
  1898. Varadarajan S, Ngo H and Srivastava J (2002). Error spreading, IEEE/ACM Transactions on Networking, 10:1, (139-152), Online publication date: 1-Feb-2002.
  1899. Lorenz D and Orda A (2002). Optimal partition of QoS requirements on unicast paths and multicast trees, IEEE/ACM Transactions on Networking, 10:1, (102-114), Online publication date: 1-Feb-2002.
  1900. Gau R, Haas Z and Krishnamachari B (2002). On multicast flow control for heterogeneous receivers, IEEE/ACM Transactions on Networking, 10:1, (86-101), Online publication date: 1-Feb-2002.
  1901. Reisslein M, Ross K and Rajagopal S (2002). A framework for guaranteeing statistical QoS, IEEE/ACM Transactions on Networking, 10:1, (27-42), Online publication date: 1-Feb-2002.
  1902. ACM
    Liu Y and Stoller S Program optimization using indexed and recursive data structures Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (108-118)
  1903. Wang W, Raghunathan A, Lakshminarayana G and Jha N Input Space Adaptive Embedded Software Synthesis Proceedings of the 2002 Asia and South Pacific Design Automation Conference
  1904. Borodin A, Nielsen M and Rackoff C (Incremental) priority algorithms Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (752-761)
  1905. Pettie S and Ramachandran V Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (713-722)
  1906. Pettie S and Ramachandran V Computing shortest paths with comparisons and additions Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (267-276)
  1907. Cheng S and Vigneron A Motorcycle graphs and straight skeletons Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (156-165)
  1908. Gabow H An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (84-93)
  1909. Vitter J External memory algorithms Handbook of massive data sets, (359-416)
  1910. Arge L External memory data structures Handbook of massive data sets, (313-357)
  1911. Bird R, Gibbons J and Mu S Algebraic methods for optimization problems Algebraic and coalgebraic methods in the mathematics of program construction, (281-308)
  1912. Heinz S and Zobel J (2002). Performance of data structures for small sets of strings, Australian Computer Science Communications, 24:1, (87-94), Online publication date: 1-Jan-2002.
  1913. Heinz S and Zobel J Performance of data structures for small sets of strings Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4, (87-94)
  1914. Chandrachoodan N, Bhattacharyya S and Liu K (2002). High-level synthesis of DSP applications using adaptive negative cycle detection, EURASIP Journal on Advances in Signal Processing, 2002:1, (893-907), Online publication date: 1-Jan-2002.
  1915. Formica A (2002). Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas, IEEE Transactions on Knowledge and Data Engineering, 14:1, (123-139), Online publication date: 1-Jan-2002.
  1916. Yoo B and Das C (2002). A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers, IEEE Transactions on Computers, 51:1, (46-60), Online publication date: 1-Jan-2002.
  1917. Fahle T, Junker U, Karisch S, Kohl N, Sellmann M and Vaaben B (2002). Constraint Programming Based Column Generation for Crew Assignment, Journal of Heuristics, 8:1, (59-81), Online publication date: 1-Jan-2002.
  1918. Bistarelli S, Montanari U and Rossi F (2002). Soft Constraint Logic Programming and Generalized Shortest Path Problems, Journal of Heuristics, 8:1, (25-41), Online publication date: 1-Jan-2002.
  1919. Gamboa R (2002). The Correctness of the Fast Fourier Transform, Formal Methods in System Design, 20:1, (91-106), Online publication date: 1-Jan-2002.
  1920. ACM
    Rahman N and Raman R (2001). Adapting Radix Sort to the Memory Hierarchy, ACM Journal of Experimental Algorithmics, 6, (7-es), Online publication date: 31-Dec-2002.
  1921. ACM
    Liberatore V (2001). Caching and Scheduling for Broadcast Disk Systems, ACM Journal of Experimental Algorithmics, 6, (5-es), Online publication date: 31-Dec-2002.
  1922. Roth V and Peters J A Scalable and Secure Global Tracking Service for Mobile Agents Proceedings of the 5th International Conference on Mobile Agents, (169-181)
  1923. Bollobás B, Das G, Gunopulos D and Mannila H (2001). Time-series similarity problems and well-separated geometric sets, Nordic Journal of Computing, 8:4, (409-423), Online publication date: 1-Dec-2001.
  1924. Milburn G, Ralph T, White A, Knill E and Laflamme R (2001). Efficient linear optics quantum coputation, Quantum Information & Computation, 1:4, (13-19), Online publication date: 1-Dec-2001.
  1925. ACM
    Suraweera F (2001). Getting the most from an algorithms design course, ACM SIGCSE Bulletin, 33:4, (71-74), Online publication date: 1-Dec-2001.
  1926. ACM
    Ginat D (2001). Starting top-down, refining bottom-up, sharpening by zoom-in, ACM SIGCSE Bulletin, 33:4, (28-31), Online publication date: 1-Dec-2001.
  1927. ACM
    Stappert F, Ermedahl A and Engblom J Efficient longest executable path search for programs with complex flows and pipeline effects Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems, (132-140)
  1928. ACM
    Petzold I, Gerhard Gröger G and Lutz Plümer L Network planning using geomorphology Proceedings of the 9th ACM international symposium on Advances in geographic information systems, (167-172)
  1929. ACM
    Chan E and Zhang N Finding shortest paths in large network systems Proceedings of the 9th ACM international symposium on Advances in geographic information systems, (160-166)
  1930. ACM
    Bresson E, Chevassut O, Pointcheval D and Quisquater J Provably authenticated group Diffie-Hellman key exchange Proceedings of the 8th ACM conference on Computer and Communications Security, (255-264)
  1931. Alba-Pinto C, Mesman B and Jess J Constraint satisfaction for relative location assignment and scheduling Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (384-390)
  1932. Xiang H, Tang X and Wong D An algorithm for simultaneous pin assignment and routing Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (232-238)
  1933. Verma V and Dutt S A search-based bump-and-refit approach to incremental routing for ECO applications in FPGAs Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (144-152)
  1934. Kudlugi M, Selvidge C and Tessier R Static scheduling of multi-domain memories for functional verification Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (2-9)
  1935. ACM
    Boyapati C and Rinard M (2001). A parameterized type system for race-free Java programs, ACM SIGPLAN Notices, 36:11, (56-69), Online publication date: 1-Nov-2001.
  1936. Rozenberg G Gene assembly in ciliates A half-century of automata theory, (93-130)
  1937. ACM
    Boyapati C and Rinard M A parameterized type system for race-free Java programs Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (56-69)
  1938. ACM
    Meguerdichian S, Slijepcevic S, Karayan V and Potkonjak M Localized algorithms in wireless ad-hoc networks Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, (106-116)
  1939. ACM
    Wu P and Manjunath B Adaptive nearest neighbor search for relevance feedback in large image databases Proceedings of the ninth ACM international conference on Multimedia, (89-97)
  1940. Jiang Y, Sapatnekar S and Bamji C (2001). Technology mapping for high-performance static CMOS and pass transistor logic designs, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 9:5, (577-589), Online publication date: 1-Oct-2001.
  1941. ACM
    Chabini N and Savaria Y Methods for optimizing register placement in synchronous circuits derived using software pipelining techniques Proceedings of the 14th international symposium on Systems synthesis, (209-214)
  1942. Dellnitz M and Preis R Congestion and almost invariant sets in dynamical systems Proceedings of the 2nd international conference on Symbolic and numerical scientific computation, (183-209)
  1943. Hunt E, Atkinson M and Irving R A Database Index to Large Biological Sequences Proceedings of the 27th International Conference on Very Large Data Bases, (139-148)
  1944. ACM
    Khuri S and Holzapfel K (2001). EVEGA, ACM SIGCSE Bulletin, 33:3, (101-104), Online publication date: 1-Sep-2001.
  1945. ACM
    Ginat D (2001). Metacognitive awareness utilized for learning control elements in algorithmic problem solving, ACM SIGCSE Bulletin, 33:3, (81-84), Online publication date: 1-Sep-2001.
  1946. Wang B, Ku S and Shil K (2001). Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems, IEEE Transactions on Parallel and Distributed Systems, 12:9, (888-898), Online publication date: 1-Sep-2001.
  1947. Kollios G, Tsotras V, Gunopulos D, Delis A and Hadjieleftheriou M (2001). Indexing Animated Objects Using Spatiotemporal Access Methods, IEEE Transactions on Knowledge and Data Engineering, 13:5, (758-777), Online publication date: 1-Sep-2001.
  1948. Liu C, Gong W and Krishna C (2001). Rational Interpolation Examples in Performance Analysis, IEEE Transactions on Computers, 50:9, (997-1003), Online publication date: 1-Sep-2001.
  1949. Park J, Kanitkar V and Delis A (2001). Logically Clustered Architectures for Networked Databases, Distributed and Parallel Databases, 10:2, (161-198), Online publication date: 1-Sep-2001.
  1950. ACM
    Ding C, He X and Zha H A spectral method to separate disconnected and nearly-disconnected web graph components Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, (275-280)
  1951. Gillispie S and Perlman M Enumerating Markov equivalence classes of acyclic digraph dels Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence, (171-177)
  1952. Amir E Efficient approximation for triangulation of minimum treewidth Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence, (7-15)
  1953. Kremer U, Hicks J and Rehg J A compilation framework for power and energy management on mobile computers Proceedings of the 14th international conference on Languages and compilers for parallel computing, (115-131)
  1954. ACM
    Bertino E, Bonatti P and Ferrari E (2001). TRBAC, ACM Transactions on Information and System Security, 4:3, (191-233), Online publication date: 1-Aug-2001.
  1955. ACM
    Unnikrishnan L, Stoller S and Liu Y Automatic Accurate Live Memory Analysis for Garbage-Collected Languages Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems, (102-111)
  1956. ACM
    Unnikrishnan L, Stoller S and Liu Y Automatic Accurate Live Memory Analysis for Garbage-Collected Languages Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems, (102-111)
  1957. ACM
    Unnikrishnan L, Stoller S and Liu Y (2001). Automatic Accurate Live Memory Analysis for Garbage-Collected Languages, ACM SIGPLAN Notices, 36:8, (102-111), Online publication date: 1-Aug-2001.
  1958. Tang C, Medioni G and Lee M (2001). N-Dimensional Tensor Voting and Application to Epipolar Geometry Estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:8, (829-844), Online publication date: 1-Aug-2001.
  1959. Chen S, Fuchs W and Chung J (2001). Reversible Debugging Using Program Instrumentation, IEEE Transactions on Software Engineering, 27:8, (715-727), Online publication date: 1-Aug-2001.
  1960. Lee J and Padua D (2001). Hiding Relaxed Memory Consistency with a Compiler, IEEE Transactions on Computers, 50:8, (824-833), Online publication date: 1-Aug-2001.
  1961. Buy U and Sloan R (2001). Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset, Automated Software Engineering, 8:3-4, (227-273), Online publication date: 1-Aug-2001.
  1962. ACM
    Meguerdichian S, Koushanfar F, Qu G and Potkonjak M Exposure in wireless Ad-Hoc sensor networks Proceedings of the 7th annual international conference on Mobile computing and networking, (139-150)
  1963. Koller D and Milch B Structured models for multi-agent interactions Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, (233-248)
  1964. Sumita E Example-based machine translation using DP-matching between word sequences Proceedings of the workshop on Data-driven methods in machine translation - Volume 14, (1-8)
  1965. Schmid H and Rooth M Parse forest computation of expected governors Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, (466-473)
  1966. ACM
    Kesselman A, Lotker Z, Mansour Y, Patt-Shamir B, Schieber B and Sviridenko M Buffer overflow management in QoS switches Proceedings of the thirty-third annual ACM symposium on Theory of computing, (520-529)
  1967. ACM
    Thorup M and Zwick U Approximate distance oracles Proceedings of the thirty-third annual ACM symposium on Theory of computing, (183-192)
  1968. ACM
    Mclendon W, Hendrickson B, Plimpton S and Rauchwerger L Finding strongly connected components in parallel in particle transport sweeps Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (328-329)
  1969. ACM
    Rajaraman R, Richa A, Vöcking B and Vuppuluri G A data tracking scheme for general networks Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (247-254)
  1970. ACM
    Fatourou P Low-contention depth-first scheduling of parallel computations with write-once synchronization variables Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (189-198)
  1971. ACM
    Lee M, Kim Y, Park K and Cho Y Efficient parallel exponentiation in GF(2n) using normal basis representations Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (179-188)
  1972. Tokuda N and Chen L (2001). An Online Tutoring System for Language Translation, IEEE MultiMedia, 8:3, (46-55), Online publication date: 1-Jul-2001.
  1973. ACM
    Khuri S and Holzapfel K EVEGA Proceedings of the 6th annual conference on Innovation and technology in computer science education, (101-104)
  1974. ACM
    Ginat D Metacognitive awareness utilized for learning control elements in algorithmic problem solving Proceedings of the 6th annual conference on Innovation and technology in computer science education, (81-84)
  1975. ACM
    Can Yildiz M and Madden P Improved cut sequences for partitioning based placement Proceedings of the 38th annual Design Automation Conference, (776-779)
  1976. ACM
    Kudlugi M, Selvidge C and Tessier R Static schedluing of multiple asynchronous domains for functional verification Proceedings of the 38th annual Design Automation Conference, (647-652)
  1977. ACM
    Møller A and Schwartzbach M The pointer assertion logic engine Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, (221-231)
  1978. ACM
    Wu P, Cohen A, Hoeflinger J and Padua D Monotonic evolution Proceedings of the 15th international conference on Supercomputing, (78-91)
  1979. Jha S, Tan K and Maxion R Markov Chains, Classifiers, and Intrusion Detection Proceedings of the 14th IEEE workshop on Computer Security Foundations
  1980. Babb J, Tessier R, Dahl M, Hanono S, Hoki D and Agarwal A Logic emulation with virtual wires Readings in hardware/software co-design, (625-642)
  1981. Mesman B, Timmer A, van Meerbergen J and Jess J Constraint analysis for DSP code generation Readings in hardware/software co-design, (485-498)
  1982. Chou P, Ortega R and Borriello G Interface co-synthesis techniques for embedded systems Readings in hardware/software co-design, (358-365)
  1983. Yen T and Wolf W Performance estimation for real-time distributed embedded systems Readings in hardware/software co-design, (195-206)
  1984. ACM
    Vitter J (2001). External memory algorithms and data structures, ACM Computing Surveys, 33:2, (209-271), Online publication date: 1-Jun-2001.
  1985. ACM
    Zilles C and Sohi G Execution-based prediction using speculative slices Proceedings of the 28th annual international symposium on Computer architecture, (2-13)
  1986. ACM
    González-Banos H A randomized art-gallery algorithm for sensor placement Proceedings of the seventeenth annual symposium on Computational geometry, (232-240)
  1987. ACM
    Afrati F, Li C and Ullman J (2001). Generating efficient plans for queries using views, ACM SIGMOD Record, 30:2, (319-330), Online publication date: 1-Jun-2001.
  1988. ACM
    Deshpande A, Garofalakis M and Rastogi R (2001). Independence is good, ACM SIGMOD Record, 30:2, (199-210), Online publication date: 1-Jun-2001.
  1989. Kalpakis K, Dasgupta K and Wolfson O (2001). Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs, IEEE Transactions on Parallel and Distributed Systems, 12:6, (628-637), Online publication date: 1-Jun-2001.
  1990. Jin J, Kurniawati R, Xu G and Bai X (2001). Using Browsing to Improve Content-Based Image Retrieval, Journal of Visual Communication and Image Representation, 12:2, (123-135), Online publication date: 1-Jun-2001.
  1991. ACM
    Sitaraman M, Kulczycki G, Krone J, Ogden W and Reddy A Performance specification of software components Proceedings of the 2001 symposium on Software reusability: putting software reuse in context, (3-10)
  1992. Stoller S and Liu Y Transformations for model checking distributed Java programs Proceedings of the 8th international SPIN workshop on Model checking of software, (192-199)
  1993. Edelkamp S, Lafuente A and Leue S Directed explicit model checking with HSF-SPIN Proceedings of the 8th international SPIN workshop on Model checking of software, (57-79)
  1994. ACM
    Zilles C and Sohi G (2001). Execution-based prediction using speculative slices, ACM SIGARCH Computer Architecture News, 29:2, (2-13), Online publication date: 1-May-2001.
  1995. ACM
    Møller A and Schwartzbach M (2001). The pointer assertion logic engine, ACM SIGPLAN Notices, 36:5, (221-231), Online publication date: 1-May-2001.
  1996. ACM
    Sitaraman M, Kulczycki G, Krone J, Ogden W and Reddy A (2001). Performance specification of software components, ACM SIGSOFT Software Engineering Notes, 26:3, (3-10), Online publication date: 1-May-2001.
  1997. ACM
    Yao Z, Gupta S and Nau D A geometric algorithm for selecting optimal set of cutters for multi-part milling Proceedings of the sixth ACM symposium on Solid modeling and applications, (130-139)
  1998. ACM
    Afrati F, Li C and Ullman J Generating efficient plans for queries using views Proceedings of the 2001 ACM SIGMOD international conference on Management of data, (319-330)
  1999. ACM
    Deshpande A, Garofalakis M and Rastogi R Independence is good Proceedings of the 2001 ACM SIGMOD international conference on Management of data, (199-210)
  2000. ACM
    Dalvi N, Sanghai S, Roy P and Sudarshan S Pipelining in multi-query optimization Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (59-70)
  2001. Hou Y, Wang C, Ku C and Hsu L (2001). Optimal Processor Mapping for Linear-Complement Communication on Hypercubes, IEEE Transactions on Parallel and Distributed Systems, 12:5, (514-527), Online publication date: 1-May-2001.
  2002. Ahanger G and Little T (2001). Data Semantics for Improving Retrieval Performance of Digital News Video Systems, IEEE Transactions on Knowledge and Data Engineering, 13:3, (352-360), Online publication date: 1-May-2001.
  2003. Herman G and Carvalho B (2001). Multiseeded Segmentation Using Fuzzy Connectedness, IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:5, (460-474), Online publication date: 1-May-2001.
  2004. Saab Y (2001). A Fast and Effective Algorithm for the Feedback Arc Set Problem, Journal of Heuristics, 7:3, (235-250), Online publication date: 1-May-2001.
  2005. ACM
    Efrat A, Hoffman F, Kriegel K, Schultz C and Wenk C Geometric algorithms for the analysis of 2D-electrophoresis gels Proceedings of the fifth annual international conference on Computational biology, (114-123)
  2006. ACM
    Chen T, Jaffe J and Church G Algorithms for identifying protein cross-links via tandem mass spectrometry Proceedings of the fifth annual international conference on Computational biology, (95-102)
  2007. ACM
    Chen T Gene-finding via tandem mass spectrometry Proceedings of the fifth annual international conference on Computational biology, (87-94)
  2008. Distributed Query Processing in the Internet Proceedings of the The 21st International Conference on Distributed Computing Systems
  2009. ACM
    Sulimma K and Kunz W An exact algorithm for solving difficult detailed routing problems Proceedings of the 2001 international symposium on Physical design, (198-203)
  2010. ACM
    Lou J, Krishnamoorthy S and Sheng H Estimating routing congestion using probabilistic analysis Proceedings of the 2001 international symposium on Physical design, (112-117)
  2011. Guéziec A, Taubin G, Lazarus F and Horn B (2001). Cutting and Stitching, IEEE Transactions on Visualization and Computer Graphics, 7:2, (136-151), Online publication date: 1-Apr-2001.
  2012. Guibas L, Hershberger J, Suri S and Zhang L (2001). Kinetic Connectivity for Unit Disks, Discrete & Computational Geometry, 25:4, (591-610), Online publication date: 1-Apr-2001.
  2013. Gärtner B and Welzl E (2001). A Simple Sampling Lemma, Discrete & Computational Geometry, 25:4, (569-590), Online publication date: 1-Apr-2001.
  2014. Golin M and Na H Optimal Prefix-Free Codes that end in a Specified Pattern and Similar Problems Proceedings of the Data Compression Conference
  2015. Franceschet M and Montanari A (2001). A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus, Annals of Mathematics and Artificial Intelligence, 30:1-4, (93-118), Online publication date: 23-Mar-2001.
  2016. Potipiti T, Sornlertlamvanich V and Thanadkran K Towards an intelligent multilingual keyboard system Proceedings of the first international conference on Human language technology research, (1-4)
  2017. Barzilay R, Elhadad N and McKeown K Sentence ordering in multidocument summarization Proceedings of the first international conference on Human language technology research, (1-7)
  2018. Huang Z and Malik S Managing dynamic reconfiguration overhead in systems-on-a-chip design using reconfigurable datapaths and optimized interconnection networks Proceedings of the conference on Design, automation and test in Europe
  2019. Smith S and Safford D (2001). Practical server privacy with secure coprocessors, IBM Systems Journal, 40:3, (683-695), Online publication date: 1-Mar-2001.
  2020. ACM
    Kreinovich V (2001). Itanium's new basic operation of fused multiply-add, ACM SIGACT News, 32:1, (115-117), Online publication date: 1-Mar-2001.
  2021. ACM
    Dooly D, Goldman S and Scott S (2001). On-line analysis of the TCP acknowledgment delay problem, Journal of the ACM, 48:2, (243-273), Online publication date: 1-Mar-2001.
  2022. ACM
    Roura S (2001). Improved master theorems for divide-and-conquer recurrences, Journal of the ACM, 48:2, (170-205), Online publication date: 1-Mar-2001.
  2023. ACM
    Gil J (2001). Subtyping arithmetical types, ACM SIGPLAN Notices, 36:3, (276-289), Online publication date: 1-Mar-2001.
  2024. ACM
    Hwang Y and Rine D Algorithms to detect chained-inference faults in information distribution systems Proceedings of the 2001 ACM symposium on Applied computing, (679-685)
  2025. ACM
    Fernandes C, Tavares R, Munteanu C and Rosa A Using assortative mating in genetic algorithms for vector quantization problems Proceedings of the 2001 ACM symposium on Applied computing, (361-365)
  2026. ACM
    Crivellari F and Melucci M Automatic generation of hypertextbook Webs Proceedings of the 2001 ACM symposium on Applied computing, (253-257)
  2027. ACM
    Goodrich M and Tamassia R (2001). Teaching internet algorithmics, ACM SIGCSE Bulletin, 33:1, (129-133), Online publication date: 1-Mar-2001.
  2028. ACM
    Boroni C, Goosey F, Grinder M and Ross R (2001). Engaging students with active learning resources, ACM SIGCSE Bulletin, 33:1, (65-69), Online publication date: 1-Mar-2001.
  2029. ACM
    Li X, Woon T, Tan T and Huang Z Decomposing polygon meshes for interactive applications Proceedings of the 2001 symposium on Interactive 3D graphics, (35-42)
  2030. O'Connor M and Gomez C (2001). The iFlow Address Processor, IEEE Micro, 21:2, (16-23), Online publication date: 1-Mar-2001.
  2031. Atallah M (2001). On Estimating the Large Entries of a Convolution, IEEE Transactions on Computers, 50:3, (193-196), Online publication date: 1-Mar-2001.
  2032. Shackleford B, Snider G, Carter R, Okushi E, Yasuda M, Seo K and Yasuura H (2001). A High-Performance, Pipelined, FPGA-Based Genetic Algorithm Machine, Genetic Programming and Evolvable Machines, 2:1, (33-60), Online publication date: 1-Mar-2001.
  2033. Holley R, Malitz J and Malitz S (2001). An approach to hierarchical clustering via level surfaces and convexity, Discrete & Computational Geometry, 25:2, (221-233), Online publication date: 1-Mar-2001.
  2034. ACM
    Goodrich M and Tamassia R Teaching internet algorithmics Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (129-133)
  2035. ACM
    Boroni C, Goosey F, Grinder M and Ross R Engaging students with active learning resources Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (65-69)
  2036. Berengolts A and Lindenbaum M (2001). On the Performance of Connected Components Grouping, International Journal of Computer Vision, 41:3, (195-216), Online publication date: 1-Feb-2001.
  2037. Lee C, Kin J, Potkonjak M and Mangione-Smith W (2001). Exploring Hypermedia Processor Design Space, Journal of VLSI Signal Processing Systems, 27:1-2, (171-186), Online publication date: 1-Feb-2001.
  2038. ACM
    Zhou H, Shenoy N and Nicholls W Efficient minimum spanning tree construction without Delaunay triangulation Proceedings of the 2001 Asia and South Pacific Design Automation Conference, (192-197)
  2039. Liddell M and Moffat A Length-restricted coding using modified probability distributions Proceedings of the 24th Australasian conference on Computer science, (117-124)
  2040. Isal R and Moffat A Word-based block-sorting text compression Proceedings of the 24th Australasian conference on Computer science, (92-99)
  2041. Duncan C, Kobourov S and Kumar V Optimal constrained graph exploration Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (807-814)
  2042. Doerr B Lattice approximation and linear discrepency of totally unimodular matrices Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (119-125)
  2043. Shackleford B, Okushi E, Yasuda M, Koizumi H, Seo K, Iwamoto T and Yasuura H High-performance hardware design and implementation of genetic algorithms Hardware implementation of intelligent systems, (53-87)
  2044. Liddell M and Moffat A (2001). Length-restricted coding using modified probability distributions, Australian Computer Science Communications, 23:1, (117-124), Online publication date: 1-Jan-2001.
  2045. Isal R and Moffat A (2001). Word-based block-sorting text compression, Australian Computer Science Communications, 23:1, (92-99), Online publication date: 1-Jan-2001.
  2046. ACM
    Shi S, Turner J and Waldvogel M Dimensioning server access bandwidth and multicast routing in overlay networks Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video, (83-91)
  2047. ACM
    Chan T (2001). Dynamic planar convex hull operations in near-logarithmic amortized time, Journal of the ACM, 48:1, (1-12), Online publication date: 1-Jan-2001.
  2048. ACM
    Gil J Subtyping arithmetical types Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (276-289)
  2049. Guéziec A (2001). 'Meshsweeper', IEEE Transactions on Visualization and Computer Graphics, 7:1, (47-61), Online publication date: 1-Jan-2001.
  2050. Bose P, Houle M and Toussaint G (2001). Every Set of Disjoint Line Segments Admits a Binary Tree, Discrete & Computational Geometry, 26:3, (387-410), Online publication date: 1-Jan-2001.
  2051. ACM
    Sanders P (2000). Fast priority queues for cached memory, ACM Journal of Experimental Algorithmics, 5, (7-es), Online publication date: 31-Dec-2001.
  2052. Liu Y (2000). Efficiency by Incrementalization, Higher-Order and Symbolic Computation, 13:4, (289-313), Online publication date: 1-Dec-2000.
  2053. Gmytrasiewicz P and Durfee E (2000). Rational Coordination in Multi-Agent Environments, Autonomous Agents and Multi-Agent Systems, 3:4, (319-350), Online publication date: 1-Dec-2000.
  2054. Menzies T The Complexity of TRMCS-like Spiral Specification Proceedings of the 10th International Workshop on Software Specification and Design
  2055. Zhao S, Roy K and Koh C Frequency domain analysis of switching noise on power supply network Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (487-492)
  2056. Tsao C and Koh C UST/DME Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (400-405)
  2057. Koushanfar F, Kirovski D and Potkonjak M Symbolic debugging scheme for optimized hardware and software Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (40-43)
  2058. Costa J, Devadas S and Monteiro J Observability analysis of embedded software for coverage-directed validation Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (27-32)
  2059. Caumanns J (2000). Bottom-Up Generation of Hypermedia Documents, Multimedia Tools and Applications, 12:2-3, (109-128), Online publication date: 1-Nov-2000.
  2060. ACM
    Liu S and Huang Z Interactive 3D modeling using only one image Proceedings of the ACM symposium on Virtual reality software and technology, (49-54)
  2061. ACM
    Lavi R and Nisan N Competitive analysis of incentive compatible on-line auctions Proceedings of the 2nd ACM conference on Electronic commerce, (233-241)
  2062. Lever C Linux Kernel hash table behavior Proceedings of the 4th annual Linux Showcase & Conference - Volume 4, (2-2)
  2063. Mitra S and McCluskey E COMBINATIONAL LOGIC SYNTHESIS FOR DIVERSITY IN DUPLEX SYSTEMS Proceedings of the 2000 IEEE International Test Conference
  2064. Adamy U, Giesen J and John M New techniques for topologically correct surface reconstruction Proceedings of the conference on Visualization '00, (373-380)
  2065. ACM
    Sikka S and Varghese G (2000). Memory-efficient state lookups with fast updates, ACM SIGCOMM Computer Communication Review, 30:4, (335-347), Online publication date: 1-Oct-2000.
  2066. Solleti A and Christensen K (2000). Efficient transmission of stored video for improved management of network bandwidth, International Journal of Network Management, 10:5, (277-288), Online publication date: 18-Sep-2000.
  2067. Kriegel H, Pötke M and Seidl T Managing Intervals Efficiently in Object-Relational Databases Proceedings of the 26th International Conference on Very Large Data Bases, (407-418)
  2068. Asano T, Matsui T and Tokuyama T (2000). Optimal roundings of sequences and matrices, Nordic Journal of Computing, 7:3, (241-256), Online publication date: 1-Sep-2000.
  2069. Teahan W, McNab R, Wen Y and Witten I (2000). A compression-based algorithm for Chinese word segmentation, Computational Linguistics, 26:3, (375-393), Online publication date: 1-Sep-2000.
  2070. ACM
    Erkök L and Launchbury J (2000). Recursive monadic bindings, ACM SIGPLAN Notices, 35:9, (174-185), Online publication date: 1-Sep-2000.
  2071. ACM
    Sasano I, Hu Z, Takeichi M and Ogawa M (2000). Make it practical, ACM SIGPLAN Notices, 35:9, (137-149), Online publication date: 1-Sep-2000.
  2072. ACM
    Kelemen C, Tucker A, Henderson P, Astrachan O and Bruce K (2000). Has our curriculum become math-phobic? (an American perspective), ACM SIGCSE Bulletin, 32:3, (132-135), Online publication date: 1-Sep-2000.
  2073. ACM
    Erkök L and Launchbury J Recursive monadic bindings Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (174-185)
  2074. ACM
    Sasano I, Hu Z, Takeichi M and Ogawa M Make it practical Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, (137-149)
  2075. ACM
    Mohapatra P (2000). Public key cryptography, XRDS: Crossroads, The ACM Magazine for Students, 7:1, (14-22), Online publication date: 1-Sep-2000.
  2076. Theys M, Tan M, Beck N, Siegel H and Jurczyk M (2000). A Mathematical Model and Scheduling Heuristics for Satisfying Prioritized Data Requests in an Oversubscribed Communication Network, IEEE Transactions on Parallel and Distributed Systems, 11:9, (969-988), Online publication date: 1-Sep-2000.
  2077. Han C, Shin K and Yun S (2000). On Load Balancing in Multicomputer/Distributed Systems Equipped with Circuit or Cut-Through Switching Capability, IEEE Transactions on Computers, 49:9, (947-957), Online publication date: 1-Sep-2000.
  2078. Lakshminarayana G, Raghunathan A and Jha N (2000). Behavioral Synthesis of Fault Secure Controller/Datapaths Based on Aliasing Probability Analysis, IEEE Transactions on Computers, 49:9, (865-885), Online publication date: 1-Sep-2000.
  2079. Mooney V and Micheli G (2000). Hardware/Software Co-Design of Run-Time Schedulers for Real-Time Systems, Design Automation for Embedded Systems, 6:1, (89-144), Online publication date: 1-Sep-2000.
  2080. ACM
    Sikka S and Varghese G Memory-efficient state lookups with fast updates Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, (335-347)
  2081. Dogan A and Özgüner F Reliable Matching and Scheduling of Precedence-Constrained Tasks in Heterogeneous Distributed Computing Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
  2082. ACM
    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)
  2083. ACM
    Bodík R, Gupta R and Sarkar V ABCD Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (321-333)
  2084. ACM
    Cannarozzi D, Plezbert M and Cytron R Contaminated garbage collection Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (264-273)
  2085. ACM
    Wilken K, Liu J and Heffernan M Optimal instruction scheduling using integer programming Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (121-133)
  2086. ACM
    Cheng B and Hwu W Modular interprocedural pointer analysis using access paths Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation, (57-69)
  2087. ACM
    Beeferman D and Berger A Agglomerative clustering of a search engine query log Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, (407-416)
  2088. ACM
    Flake G, Lawrence S and Giles C Efficient identification of Web communities Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, (150-160)
  2089. Hosseini-Khayat S (2000). On Optimal Replacement of Nonuniform Cache Objects, IEEE Transactions on Computers, 49:8, (769-778), Online publication date: 1-Aug-2000.
  2090. Hsiao M and Chakradhar S (2000). Test Set and Fault Partitioning Techniques for Static Test Sequence Compaction for Sequential Circuits, Journal of Electronic Testing: Theory and Applications, 16:4, (329-338), Online publication date: 1-Aug-2000.
  2091. Tidhar D and Küssner U Learning to select a good translation Proceedings of the 18th conference on Computational linguistics - Volume 2, (843-849)
  2092. Quint J A formalism for universal segmentation of text Proceedings of the 18th conference on Computational linguistics - Volume 2, (656-662)
  2093. Eisner J Directional constraint evaluation in Optimality Theory Proceedings of the 18th conference on Computational linguistics - Volume 1, (257-263)
  2094. ACM
    Osborn S and Guo Y Modeling users in role-based access control Proceedings of the fifth ACM workshop on Role-based access control, (31-37)
  2095. ACM
    Bertino E, Bonatti P and Ferrari E TRBAC Proceedings of the fifth ACM workshop on Role-based access control, (21-30)
  2096. Shahabi C, Tian X and Zhao W TSA-Tree Proceedings of the 12th International Conference on Scientific and Statistical Database Management
  2097. ACM
    Bhola S and Ahamad M 1/k phase stamping for continuous shared data (extended abstract) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, (181-190)
  2098. ACM
    Kelemen C, Tucker A, Henderson P, Astrachan O and Bruce K Has our curriculum become math-phobic? (an American perspective) Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education, (132-135)
  2099. ACM
    Vishkin U A no-busy-wait balanced tree parallel algorithmic paradigm Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (147-155)
  2100. ACM
    Agesen O, Detlefs D, Flood C, Garthwaite A, Martin P, Shavit N and Steele G DCAS-based concurrent deques Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (137-146)
  2101. Avesani P, Perini A and Ricci F (2000). Interactive Case-Based Planning for Forest Fire Management, Applied Intelligence, 13:1, (41-57), Online publication date: 1-Jul-2000.
  2102. Renooij S, van der Gaag L, Parsons S and Green S Pivotal pruning of trade-offs in QPNs Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence, (515-522)
  2103. Brodský T, Fermüller C and Aloimonos Y (2000). Structure from Motion, International Journal of Computer Vision, 37:3, (231-258), Online publication date: 28-Jun-2000.
  2104. Palsberg J and Zhao T Efficient and Flexible Matching of Recursive Types Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
  2105. ACM
    Korkmaz T, Krunz M and Tragoudas S An efficient algorithm for finding a path subject to two additive constraints Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (318-327)
  2106. ACM
    Gao L and Rexford J Stable Internet routing without global coordination Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (307-317)
  2107. ACM
    Kodialam M, Lakshman T and Sengupta S Online multicast routing with bandwidth guarantees Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (296-306)
  2108. ACM
    Henry D, Kuszmaul B, Loh G and Sami R Circuits for wide-window superscalar processors Proceedings of the 27th annual international symposium on Computer architecture, (236-247)
  2109. ACM
    Korkmaz T, Krunz M and Tragoudas S (2000). An efficient algorithm for finding a path subject to two additive constraints, ACM SIGMETRICS Performance Evaluation Review, 28:1, (318-327), Online publication date: 1-Jun-2000.
  2110. ACM
    Gao L and Rexford J (2000). Stable Internet routing without global coordination, ACM SIGMETRICS Performance Evaluation Review, 28:1, (307-317), Online publication date: 1-Jun-2000.
  2111. ACM
    Kodialam M, Lakshman T and Sengupta S (2000). Online multicast routing with bandwidth guarantees, ACM SIGMETRICS Performance Evaluation Review, 28:1, (296-306), Online publication date: 1-Jun-2000.
  2112. ACM
    Sundararajan V, Sapatnekar S and Parhi K MINFLOTRANSIT Proceedings of the 37th Annual Design Automation Conference, (649-664)
  2113. ACM
    Pang Y, Balasa F, Lampaert K and Cheng C Block placement with symmetry constraints based on the O-tree non-slicing representation Proceedings of the 37th Annual Design Automation Conference, (464-467)
  2114. ACM
    Chou P and Borriello G Synthesis and optimization of coordination controllers for distributed embedded systems Proceedings of the 37th Annual Design Automation Conference, (410-415)
  2115. ACM
    McDonald C and Bryant R Symbolic timing simulation using cluster scheduling Proceedings of the 37th Annual Design Automation Conference, (254-259)
  2116. ACM
    Zhao M, Panda R, Sapatnekar S, Edwards T, Chaudhry R and Blaauw D Hierarchical analysis of power distribution networks Proceedings of the 37th Annual Design Automation Conference, (150-155)
  2117. ACM
    Moh C, Lim E and Ng W Re-engineering structures from Web documents Proceedings of the fifth ACM conference on Digital libraries, (67-76)
  2118. ACM
    Goldberg D and Matarić M Reward maximization in a non-stationary mobile robot environment Proceedings of the fourth international conference on Autonomous agents, (92-99)
  2119. ACM
    Cho J, Shivakumar N and Garcia-Molina H (2000). Finding replicated Web collections, ACM SIGMOD Record, 29:2, (355-366), Online publication date: 1-Jun-2000.
  2120. Bertossi A and Mei A (2000). Constant Time Dynamic Programming on Directed Reconfigurable Networks, IEEE Transactions on Parallel and Distributed Systems, 11:6, (529-536), Online publication date: 1-Jun-2000.
  2121. ACM
    Mukherjea S Organizing topic-specific web information Proceedings of the eleventh ACM on Hypertext and hypermedia, (133-141)
  2122. ACM
    Cho J, Shivakumar N and Garcia-Molina H Finding replicated Web collections Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (355-366)
  2123. ACM
    Pirvu M and Bhuyan L Hardware spatial forwarding for widely shared data Proceedings of the 14th international conference on Supercomputing, (264-273)
  2124. ACM
    Bodík R, Gupta R and Sarkar V (2000). ABCD, ACM SIGPLAN Notices, 35:5, (321-333), Online publication date: 1-May-2000.
  2125. ACM
    Cannarozzi D, Plezbert M and Cytron R (2000). Contaminated garbage collection, ACM SIGPLAN Notices, 35:5, (264-273), Online publication date: 1-May-2000.
  2126. ACM
    Wilken K, Liu J and Heffernan M (2000). Optimal instruction scheduling using integer programming, ACM SIGPLAN Notices, 35:5, (121-133), Online publication date: 1-May-2000.
  2127. ACM
    Cheng B and Hwu W (2000). Modular interprocedural pointer analysis using access paths, ACM SIGPLAN Notices, 35:5, (57-69), Online publication date: 1-May-2000.
  2128. ACM
    Henry D, Kuszmaul B, Loh G and Sami R (2000). Circuits for wide-window superscalar processors, ACM SIGARCH Computer Architecture News, 28:2, (236-247), Online publication date: 1-May-2000.
  2129. ACM
    Guibas L, Hershberger J, Suri S and Zhang L Kinetic connectivity for unit disks Proceedings of the sixteenth annual symposium on Computational geometry, (331-340)
  2130. ACM
    Gärtner B Pitfalls in computing with pseudorandom determinants Proceedings of the sixteenth annual symposium on Computational geometry, (148-155)
  2131. ACM
    Gärtner B and Welzl E Random sampling in geometric optimization Proceedings of the sixteenth annual symposium on Computational geometry, (91-99)
  2132. ACM
    Chen D and Xu J Shortest path queries in planar graphs Proceedings of the thirty-second annual ACM symposium on Theory of computing, (469-478)
  2133. ACM
    Kleinberg J, Papadimitriou C and Raghavan P Auditing Boolean attributes Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (86-91)
  2134. ACM
    Tang X and Wong D Planning buffer locations by network flows Proceedings of the 2000 international symposium on Physical design, (180-185)
  2135. ACM
    Pang Y, Cheng C and Yoshimura T An enhanced perturbing algorithm for floorplan design using the O-tree representation Proceedings of the 2000 international symposium on Physical design, (168-173)
  2136. ACM
    Jiang I, Pan S, Chang Y and Jou J Optimal reliable crosstalk-driven interconnect optimization Proceedings of the 2000 international symposium on Physical design, (128-133)
  2137. ACM
    Levitin A Design and analysis of algorithms reconsidered Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, (16-20)
  2138. Piskorski J and Neumann G An intelligent text extraction and navigation system Content-Based Multimedia Information Access - Volume 2, (1015-1032)
  2139. Teahan W Text classification and segmentation using minimum cross-entropy Content-Based Multimedia Information Access - Volume 2, (943-961)
  2140. Roerdink J and Meijster A (2000). The Watershed Transform: Definitions, Algorithms and Parallelization Strategies, Fundamenta Informaticae, 41:1,2, (187-228), Online publication date: 1-Apr-2000.
  2141. ACM
    Marsden G, Thimbleby H, Jones M and Gillary P Successful user interface design from efficient computer algorithms CHI '00 Extended Abstracts on Human Factors in Computing Systems, (181-182)
  2142. Izmailov R, Iwata A and Sengupta B (2000). ATM Routing Algorithms for Multimedia Trafficin Private ATM Networks, Journal of Heuristics, 6:1, (21-38), Online publication date: 1-Apr-2000.
  2143. van Noord G (2000). Treatment of epsilon moves in subset construction, Computational Linguistics, 26:1, (61-76), Online publication date: 1-Mar-2000.
  2144. ACM
    Levitin A (2000). Design and analysis of algorithms reconsidered, ACM SIGCSE Bulletin, 32:1, (16-20), Online publication date: 1-Mar-2000.
  2145. Paragios N and Deriche R (2000). Geodesic Active Contours and Level Sets for the Detection and Tracking of Moving Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:3, (266-280), Online publication date: 1-Mar-2000.
  2146. Buchsbaum A, Goldwasser M, Venkatasubramanian S and Westbrook J On external memory graph traversal Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (859-860)
  2147. Alstrup S, Brodal G and Rauhe T Pattern matching in dynamic texts Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (819-828)
  2148. Chan W, Chin F and Ting H Escaping a grid by edge-disjoint paths Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (726-734)
  2149. Chen T, Kao M, Tepel M, Rush J and Church G A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (389-398)
  2150. ACM
    Lemieux G, Leventis P and Lewis D Generating highly-routable sparse crossbars for PLDs Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays, (155-164)
  2151. ACM
    Huelsbergen L A representation for dynamic graphs in reconfigurable hardware and its application to fundamental graph algorithms Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays, (105-115)
  2152. Zitzler E, Teich J and Bhattacharyya S (2000). Multidimensional Exploration of Software Implementationsfor DSP Algorithms, Journal of VLSI Signal Processing Systems, 24:1, (83-98), Online publication date: 1-Feb-2000.
  2153. Ratan A, Grimson W and Wells W (2000). Object Detection and Localization by Dynamic Template Warping, International Journal of Computer Vision, 36:2, (131-147), Online publication date: 1-Feb-2000.
  2154. ACM
    Lee H and Wang T Feasible two-way circuit partitioning with complex resource constraints Proceedings of the 2000 Asia and South Pacific Design Automation Conference, (435-440)
  2155. ACM
    Dube R (2000). Scalable hierarchical coarse-grained timers, ACM SIGOPS Operating Systems Review, 34:1, (11-20), Online publication date: 1-Jan-2000.
  2156. ACM
    Liu Y and Stoller S From recursion to iteration Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (73-82)
  2157. Bertino E, Ferrari E and Stolf M (2000). MPGS, IEEE Transactions on Knowledge and Data Engineering, 12:1, (102-125), Online publication date: 1-Jan-2000.
  2158. Caseau Y and Laburthe F (2000). Solving Various Weighted Matching Problems with Constraints, Constraints, 5:1/2, (141-160), Online publication date: 1-Jan-2000.
  2159. Puri A (2000). Dynamical Properties of Timed Automata, Discrete Event Dynamic Systems, 10:1-2, (87-113), Online publication date: 1-Jan-2000.
  2160. Goodman J (1999). Semiring parsing, Computational Linguistics, 25:4, (573-605), Online publication date: 1-Dec-1999.
  2161. Rotenberg E and Smith J Control independence in trace processors Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture, (4-15)
  2162. Chao M, Wu G, Jiang I and Chang Y A clustering- and probability-based approach for time-multiplexed FPGA partitioning Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, (364-369)
  2163. Zhao M and Sapatnekar S Timing-driven partitioning for two-phase domino and mixed static/domino implementations Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, (107-110)
  2164. Muhammad K and Roy K A novel design methodology for high performance and low power digital filters Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, (80-83)
  2165. Iii V Path-Based Edge Activation for Dynamic Run-Time Scheduling Proceedings of the 12th international symposium on System synthesis
  2166. Muhammad K and Roy K A Graph Theoretic Approach for Design and Synthesis of Multiplierless FIR Filters Proceedings of the 12th international symposium on System synthesis
  2167. Mesman B, Pinto C and Koen Van Eijk Efficient Scheduling of DSP Code on Processors with Distributed Register Files Proceedings of the 12th international symposium on System synthesis
  2168. ACM
    Liu Y and Stoller S (1999). From recursion to iteration, ACM SIGPLAN Notices, 34:11, (73-82), Online publication date: 1-Nov-1999.
  2169. ACM
    Strijk T and van Kreveld M Practical extensions of point labeling in the slider model Proceedings of the 7th ACM international symposium on Advances in geographic information systems, (47-52)
  2170. Gyuris V and Sistla A (1999). On-the-Fly Model Checking Under Fairness that Exploits Symmetry, Formal Methods in System Design, 15:3, (217-238), Online publication date: 1-Nov-1999.
  2171. Burton L, Machiraju R and Reese D Dynamic view-dependent partitioning for structured grids with complex boundaries for object-order rendering techniques Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics, (89-96)
  2172. Chan T Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time Proceedings of the 40th Annual Symposium on Foundations of Computer Science
  2173. Frigo M, Leiserson C, Prokop H and Ramachandran S Cache-Oblivious Algorithms Proceedings of the 40th Annual Symposium on Foundations of Computer Science
  2174. ACM
    Lee L, Siek J and Lumsdaine A (1999). The generic graph component library, ACM SIGPLAN Notices, 34:10, (399-414), Online publication date: 1-Oct-1999.
  2175. ACM
    Ovlinger J and Wand M (1999). A language for specifying recursive traversals of object structures, ACM SIGPLAN Notices, 34:10, (70-81), Online publication date: 1-Oct-1999.
  2176. ACM
    Lee L, Siek J and Lumsdaine A The generic graph component library Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (399-414)
  2177. ACM
    Ovlinger J and Wand M A language for specifying recursive traversals of object structures Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (70-81)
  2178. Chakrabarti P (1999). Partial Precedence Constrained Scheduling, IEEE Transactions on Computers, 48:10, (1127-1130), Online publication date: 1-Oct-1999.
  2179. Khan M, Paul R, Ahmed I and Ghafoor A (1999). Intensive Data Management in Parallel Systems, Distributed and Parallel Databases, 7:4, (383-414), Online publication date: 1-Oct-1999.
  2180. Wainer J and Sandri S (1999). Fuzzy Temporal/Categorical Information in Diagnosis, Journal of Intelligent Information Systems, 13:1-2, (9-26), Online publication date: 1-Oct-1999.
  2181. Roy S (1999). Stereo Without Epipolar Lines, International Journal of Computer Vision, 34:2-3, (147-161), Online publication date: 1-Oct-1999.
  2182. Ghosh-Dastidar J, Das D and Touba N Fault Diagnosis in Scan-Based BIST Using Both Time and Space Information Proceedings of the 1999 IEEE International Test Conference
  2183. Geiger D, Liu T and Donahue M (1999). Sparse Representations for Image Decompositions, International Journal of Computer Vision, 33:2, (139-156), Online publication date: 2-Sep-1999.
  2184. ACM
    Faltin N (1999). Designing courseware on algorithms for active learning with virtual board games, ACM SIGCSE Bulletin, 31:3, (135-138), Online publication date: 1-Sep-1999.
  2185. ACM
    Lopes A (1999). Ada+SQL—an overview, ACM SIGAda Ada Letters, XIX:3, (157-162), Online publication date: 1-Sep-1999.
  2186. ACM
    Lopes A Ada+SQL—an overview Proceedings of the 1999 annual ACM SIGAda international conference on Ada, (157-162)
  2187. Ribarsky W, Katz J, Jiang F and Holland A (1999). Discovery Visualization Using Fast Clustering, IEEE Computer Graphics and Applications, 19:5, (32-39), Online publication date: 1-Sep-1999.
  2188. Pan P and Liu C (1999). Partial Scan with Preselected Scan Signals, IEEE Transactions on Computers, 48:9, (1000-1005), Online publication date: 1-Sep-1999.
  2189. Horváth T Arithmetic Design for Permutation Groups Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, (109-121)
  2190. ACM
    Rugina R and Rinard M (1999). Automatic parallelization of divide and conquer algorithms, ACM SIGPLAN Notices, 34:8, (72-83), Online publication date: 1-Aug-1999.
  2191. ACM
    Oates T Identifying distinctive subsequences in multivariate time series by clustering Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, (322-326)
  2192. ACM
    Aggarwal C, Wolf J, Wu K and Yu P Horting hatches an egg Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, (201-212)
  2193. Tallini L and Bose B (1999). Balanced Codes with Parallel Encoding and Decoding, IEEE Transactions on Computers, 48:8, (794-814), Online publication date: 1-Aug-1999.
  2194. Benini L, De Micheli G, Lioy A, Macii E, Odasso G and Poncino M (1999). Automatic Synthesis of Large Telescopic Units Based on Near-Minimum Timed Supersetting, IEEE Transactions on Computers, 48:8, (769-779), Online publication date: 1-Aug-1999.
  2195. Friedman N, Nachman I and Peér D Learning bayesian network structure from massive datasets Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, (206-215)
  2196. Boutilier C, Brafman R, Hoos H and Poole D Reasoning with conditional ceteris paribus preference statements Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence, (71-80)
  2197. Delgrande J, Gupta A and Van Allen T Point-based approaches to qualitative temporal reasoning Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence, (739-744)
  2198. ACM
    Allenberg C Individual sequence prediction—upper bounds and application for complexity Proceedings of the twelfth annual conference on Computational learning theory, (233-242)
  2199. ACM
    Mansour Y Reinforcement learning and mistake bounded algorithms Proceedings of the twelfth annual conference on Computational learning theory, (183-192)
  2200. ACM
    Gordon G Regret bounds for prediction problems Proceedings of the twelfth annual conference on Computational learning theory, (29-40)
  2201. ACM
    Brunick G, Green E, Heath L and Struble C Efficient construction of Drinfel'd doubles Proceedings of the 1999 international symposium on Symbolic and algebraic computation, (45-52)
  2202. Çam H and Fortes J (1999). Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks, IEEE Transactions on Parallel and Distributed Systems, 10:7, (733-741), Online publication date: 1-Jul-1999.
  2203. Zheng S and Sun M (1999). Constructing Optimal Search Trees in Optimal Time, IEEE Transactions on Computers, 48:7, (738-743), Online publication date: 1-Jul-1999.
  2204. Okasaki C (1999). Red-black trees in a functional setting, Journal of Functional Programming, 9:4, (471-477), Online publication date: 1-Jul-1999.
  2205. ACM
    Faltin N Designing courseware on algorithms for active learning with virtual board games Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education, (135-138)
  2206. Kiefer B, Krieger H, Carroll J and Malouf R A bag of useful techniques for efficient and robust parsing Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (473-480)
  2207. Kasper W, Kiefer B, Krieger H, Rupp C and Worm K Charting the depths of robust speech parsing Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (405-412)
  2208. Willis A and Manandhar S Two accounts of scope availability and semantic underspecification Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, (293-300)
  2209. ACM
    Chaudhuri S and Shim K (1999). Optimization of queries with user-defined predicates, ACM Transactions on Database Systems, 24:2, (177-228), Online publication date: 1-Jun-1999.
  2210. ACM
    Cong J, Li H and Wu C Simultaneous circuit partitioning/clustering with retiming for performance optimization Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (460-465)
  2211. ACM
    Johnson M, Somasekhar D and Roy K Leakage control with efficient use of transistor stacks in single threshold CMOS Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (442-445)
  2212. ACM
    Zhou H, Wong D, Liu I and Aziz A Simultaneous routing and buffer insertion with restrictions on buffer locations Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (96-99)
  2213. ACM
    Baptist L and Cormen T Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks (extended abstract) Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (242-250)
  2214. ACM
    Barve R and Vitter J A simple and efficient parallel disk mergesort Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (232-241)
  2215. ACM
    Kuszmaul B, Henry D and Loh G A comparison of scalable superscalar processors Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (126-137)
  2216. ACM
    Narlikar G Scheduling threads for low space requirement and good locality Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (83-95)
  2217. ACM
    Agbaria A, Ben-Asher Y and Newman I Communication-processor tradeoffs in limited resources PRAM Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (74-82)
  2218. ACM
    Busch C and Herlihy M Sorting and counting networks of small depth and arbitrary width Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (64-73)
  2219. ACM
    Lazarus F and Verroust A Level set diagrams of polyhedral objects Proceedings of the fifth ACM symposium on Solid modeling and applications, (130-140)
  2220. ACM
    Bush R and Sèquin C Synthesis of bent sheet metal parts from design features Proceedings of the fifth ACM symposium on Solid modeling and applications, (119-129)
  2221. ACM
    Han J and Han I Manufacturable feature recognition and its integration with process planning Proceedings of the fifth ACM symposium on Solid modeling and applications, (108-118)
  2222. Fiore P (1999). Parallel Multiplication Using Fast Sorting Networks, IEEE Transactions on Computers, 48:6, (640-645), Online publication date: 1-Jun-1999.
  2223. Bhattacharyya S, Murthy P and Lee E (1999). Synthesis of Embedded Software from Synchronous Dataflow Specifications, Journal of VLSI Signal Processing Systems, 21:2, (151-166), Online publication date: 1-Jun-1999.
  2224. Roth A and Sohi G Effective jump-pointer prefetching for linked data structures Proceedings of the 26th annual international symposium on Computer architecture, (111-121)
  2225. ACM
    Roth A and Sohi G (1999). Effective jump-pointer prefetching for linked data structures, ACM SIGARCH Computer Architecture News, 27:2, (111-121), Online publication date: 1-May-1999.
  2226. ACM
    Raman V Locality preserving dictionaries Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (337-345)
  2227. ACM
    Dawson S, De Capitani di Vimercati S, Lincoln P and Samarati P Minimal data upgrading to prevent inference and association attacks Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (114-125)
  2228. ACM
    Grant B, Philipose M, Mock M, Chambers C and Eggers S (1999). An evaluation of staged run-time optimizations in DyC, ACM SIGPLAN Notices, 34:5, (293-304), Online publication date: 1-May-1999.
  2229. ACM
    Foster J, Fähndrich M and Aiken A (1999). A theory of type qualifiers, ACM SIGPLAN Notices, 34:5, (192-203), Online publication date: 1-May-1999.
  2230. ACM
    Cooper K and McIntosh N (1999). Enhanced code compression for embedded RISC processors, ACM SIGPLAN Notices, 34:5, (139-149), Online publication date: 1-May-1999.
  2231. ACM
    Grant B, Philipose M, Mock M, Chambers C and Eggers S An evaluation of staged run-time optimizations in DyC Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (293-304)
  2232. ACM
    Foster J, Fähndrich M and Aiken A A theory of type qualifiers Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (192-203)
  2233. ACM
    Cooper K and McIntosh N Enhanced code compression for embedded RISC processors Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (139-149)
  2234. ACM
    King V and Sagert G A fully dynamic algorithm for maintaining the transitive closure Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (492-498)
  2235. ACM
    Zwick U All pairs lightest shortest paths Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (61-69)
  2236. ACM
    Rugina R and Rinard M Automatic parallelization of divide and conquer algorithms Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming, (72-83)
  2237. Cheng B, Choi K, Lee J and Wu J (1999). Increasing Constraint Propagation by Redundant Modeling, Constraints, 4:2, (167-192), Online publication date: 1-May-1999.
  2238. De A. Façanha R, Da Fonseca N and De Rezende P (1999). The S2 Piggybacking Policy, Multimedia Tools and Applications, 8:3, (371-383), Online publication date: 1-May-1999.
  2239. Benyamin D, Villasenor J and Luk W Optimizing FPGA-Based Vector Product Designs Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
  2240. Topcuoglu H, Hariri S and Wu M Task Scheduling Algorithms for Heterogeneous Processors Proceedings of the Eighth Heterogeneous Computing Workshop
  2241. Bakic A, Mutka M and Rover D An On-Line Performance Visualization Technology Proceedings of the Eighth Heterogeneous Computing Workshop
  2242. ACM
    Ganley J Efficient solution of systems of orientation constraints Proceedings of the 1999 international symposium on Physical design, (140-144)
  2243. ACM
    Kleinberg J Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes Proceedings of the third annual international conference on Computational molecular biology, (226-237)
  2244. Goodrich M, Mitchell J and Orletsky M (1999). Approximate Geometric Pattern Matching Under Rigid Motions, IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:4, (371-379), Online publication date: 1-Apr-1999.
  2245. Guéziec A (1999). Locally Toleranced Surface Simplification, IEEE Transactions on Visualization and Computer Graphics, 5:2, (168-189), Online publication date: 1-Apr-1999.
  2246. Benczúr A (1999). Parallel and fast sequential algorithms for undirected edge connectivity augmentation, Mathematical Programming: Series A and B, 84:3, (595-640), Online publication date: 1-Apr-1999.
  2247. Carvalho B, Gau C, Herman G and Kong T (1999). Algorithms for Fuzzy Segmentation, Pattern Analysis & Applications, 2:1, (73-81), Online publication date: 1-Apr-1999.
  2248. ACM
    Naps T and Chan E Using visualization to teach parallel algorithms The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (232-236)
  2249. ACM
    Goodrich M and Tamassia R Using randomization in the teaching of data structures and algorithms The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (53-57)
  2250. Henry D, Kuszmaul B and Viswanath V The Ultrascalar Processor-An Asymptotically Scalable Superscalar Microarchitecture Proceedings of the 20th Anniversary Conference on Advanced Research in VLSI
  2251. Aiello W, Busch C, Herlihy M, Mavronicolas M, Shavit N and Touitou D Supporting increment and decrement operations in balancing networks Proceedings of the 16th annual conference on Theoretical aspects of computer science, (393-403)
  2252. Nykänen M and Ukkonen E Finding paths with the right cost Proceedings of the 16th annual conference on Theoretical aspects of computer science, (345-355)
  2253. Wu B, Chao K and Tang C Constructing light spanning trees with small routing cost Proceedings of the 16th annual conference on Theoretical aspects of computer science, (334-344)
  2254. ACM
    Naps T and Chan E (1999). Using visualization to teach parallel algorithms, ACM SIGCSE Bulletin, 31:1, (232-236), Online publication date: 1-Mar-1999.
  2255. ACM
    Goodrich M and Tamassia R (1999). Using randomization in the teaching of data structures and algorithms, ACM SIGCSE Bulletin, 31:1, (53-57), Online publication date: 1-Mar-1999.
  2256. Avresky D (1999). Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes, IEEE Transactions on Parallel and Distributed Systems, 10:3, (211-222), Online publication date: 1-Mar-1999.
  2257. Hsiao M, Rudnick E and Patel J (1999). Fast Static Compaction Algorithms for Sequential Circuit Test Vectors, IEEE Transactions on Computers, 48:3, (311-322), Online publication date: 1-Mar-1999.
  2258. Van Noord G, Bouma G, Koeling R and Nederhof M (1999). Robust grammatical analysis for spoken dialogue systems, Natural Language Engineering, 5:1, (45-93), Online publication date: 1-Mar-1999.
  2259. Anthony S and Frisch A (1999). Cautious induction: An alternative to clause-at-a-time hypothesis construction in inductive logic programming, New Generation Computing, 17:1, (25-52), Online publication date: 1-Mar-1999.
  2260. Hunt G and Scott M The Coign automatic distributed partitioning system Proceedings of the third symposium on Operating systems design and implementation, (187-200)
  2261. ACM
    Ball T (1999). Paths between imperative and functional programming, ACM SIGPLAN Notices, 34:2, (21-25), Online publication date: 1-Feb-1999.
  2262. ACM
    Sidhu R, Mei A and Prasanna V String matching on multicontext FPGAs using self-reconfiguration Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays, (217-226)
  2263. Preneel B The State of Cryptographic Hash Functions Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998, (158-182)
  2264. Oldham J Combinatorial approximation algorithms for generalized flow problems Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (704-714)
  2265. ACM
    Gatlin K and Carter L Architecture-cognizant divide and conquer algorithms Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (25-es)
  2266. ACM
    Chang J and Pedram M Codex-dp Proceedings of the conference on Design, automation and test in Europe, (114-es)
  2267. ACM
    Tan X and Shi C Interpretable symbolic small-signal characterization of large analog circuits using determinant decision diagrams Proceedings of the conference on Design, automation and test in Europe, (94-es)
  2268. ACM
    Chatterjee R, Ryder B and Landi W Relevant context inference Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (133-146)
  2269. ACM
    Ramalingam G, Field J and Tip F Aggregate structure identification and its application to program analysis Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (119-132)
  2270. Puschner P (1999). Real-Time Performance of Sorting Algorithms, Real-Time Systems, 16:1, (63-79), Online publication date: 1-Jan-1999.
  2271. Kountouris A and Wolinski C False path analysis based on hierarchical control representation Proceedings of the 11th international symposium on System synthesis, (55-59)
  2272. Wehbeh J and Saab D (1998). Initialization of Sequential Circuits and its Application to ATPG, Journal of Electronic Testing: Theory and Applications, 13:3, (259-271), Online publication date: 1-Dec-1998.
  2273. Hightower J and Talkmitt M 3D in the Pines and on the Plains Proceedings of the 1998 ACM/IEEE conference on Supercomputing, (1-26)
  2274. Saukas E and Song S Efficient selection algorithms on distributed memory computers Proceedings of the 1998 ACM/IEEE conference on Supercomputing, (1-26)
  2275. ACM
    Buchsbaum A, Kaplan H, Rogers A and Westbrook J (1998). A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, 20:6, (1265-1296), Online publication date: 1-Nov-1998.
  2276. ACM
    Koeller A, Rundensteiner E and Hachem N Integrating the rewriting and ranking phases of view synchronization Proceedings of the 1st ACM international workshop on Data warehousing and OLAP, (60-65)
  2277. ACM
    Arya S, Mount D, Netanyahu N, Silverman R and Wu A (1998). An optimal algorithm for approximate nearest neighbor searching fixed dimensions, Journal of the ACM, 45:6, (891-923), Online publication date: 1-Nov-1998.
  2278. ACM
    Choi H, Hwang S, Kyung C and Park I Synthesis of application specific instructions for embedded DSP software Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (665-671)
  2279. ACM
    Kirovski D, Potkonjak M and Guerra L Functional debugging of systems-on-chip Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (525-528)
  2280. ACM
    Pinar A and Liu C Power invariant vector sequence compaction Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (473-476)
  2281. ACM
    Papaefthymiou M Asymptotically efficient retiming under setup and hold constraints Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (396-401)
  2282. ACM
    Zhao M and Sapatnekar S Technology mapping for domino logic Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, (248-251)
  2283. ACM
    Lane T and Brodley C Temporal sequence learning and data reduction for anomaly detection Proceedings of the 5th ACM conference on Computer and communications security, (150-158)
  2284. Yen T and Wolf W (1998). Performance Estimation for Real-Time Distributed Embedded Systems, IEEE Transactions on Parallel and Distributed Systems, 9:11, (1125-1136), Online publication date: 1-Nov-1998.
  2285. Tan M and Siegel H (1998). A Stochastic Model for Heterogeneous Computing and Its Application in Data Relocation Scheme Development, IEEE Transactions on Parallel and Distributed Systems, 9:11, (1088-1101), Online publication date: 1-Nov-1998.
  2286. Guéziec A, Taubin G, Lazarus F and Horn W Converting sets of polygons to manifold surfaces by cutting and stitching Proceedings of the conference on Visualization '98, (383-390)
  2287. ACM
    Gagvani N, Kenchammana-Hosekote D and Silver D Volume animation using the skeleton tree Proceedings of the 1998 IEEE symposium on Volume visualization, (47-53)
  2288. ACM
    Andersson A and Nilsson S (1998). Implementing radixsort, ACM Journal of Experimental Algorithmics, 3, (7-es), Online publication date: 1-Sep-1998.
  2289. ACM
    Yan Y and Zhang X (1998). Lock bypassing, ACM Journal of Experimental Algorithmics, 3, (3-es), Online publication date: 1-Sep-1998.
  2290. ACM
    Eyck J, Sampath G and Goldstone R (1998). Specification of an algorithm design system, ACM SIGCSE Bulletin, 30:3, (232-235), Online publication date: 1-Sep-1998.
  2291. Strumpen V (1998). Portable and Fault-Tolerant Software Systems, IEEE Micro, 18:5, (22-32), Online publication date: 1-Sep-1998.
  2292. Kapur D and Subramaniam M (1998). Mechanical Verification of Adder Circuits using Rewrite RuleLaboratory, Formal Methods in System Design, 13:2, (127-158), Online publication date: 1-Sep-1998.
  2293. Costeira J and Kanade T (1998). A Multibody Factorization Method for Independently Moving Objects, International Journal of Computer Vision, 29:3, (159-179), Online publication date: 1-Sep-1998.
  2294. Heinonen O Optimal multi-paragraph text segmentation by dynamic programming Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2, (1484-1486)
  2295. ACM
    Vo A and Moffat A Compressed inverted files with reduced decoding overheads Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, (290-297)
  2296. ACM
    Eyck J, Sampath G and Goldstone R Specification of an algorithm design system Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education, (232-235)
  2297. Hambrusch S and Khokhar A (1998). Scalable S-To-P Broadcasting on Message-Passing MPPs, IEEE Transactions on Parallel and Distributed Systems, 9:8, (758-768), Online publication date: 1-Aug-1998.
  2298. Pennock D Logarithmic time parallel Bayesian inference Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence, (431-438)
  2299. ACM
    Corrêa W, Jensen R, Thayer C and Finkelstein A Texture mapping for cel animation Proceedings of the 25th annual conference on Computer graphics and interactive techniques, (435-446)
  2300. ACM
    Awerbuch B and Kobourov S Polylogarithmic-overhead piecemeal graph exploration Proceedings of the eleventh annual conference on Computational learning theory, (280-286)
  2301. ACM
    Kaxiras S, Gjessing S and Goodman J A study of three dynamic approaches to handle widely shared data in shared-memory multiprocessors Proceedings of the 12th international conference on Supercomputing, (457-464)
  2302. ACM
    Kennedy K and Kremer U (1998). Automatic data layout for distributed-memory machines, ACM Transactions on Programming Languages and Systems, 20:4, (869-916), Online publication date: 1-Jul-1998.
  2303. Bertino E and Ferrari E (1998). Temporal Synchronization Models for Multimedia Data, IEEE Transactions on Knowledge and Data Engineering, 10:4, (612-631), Online publication date: 1-Jul-1998.
  2304. Small C and Seltzer M (1998). MiSFIT, IEEE Concurrency, 6:3, (34-41), Online publication date: 1-Jul-1998.
  2305. van Noord G Treatment of ε-moves in subset construction Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, (57-68)
  2306. ACM
    Har-Peled S An output sensitive algorithm for discrete convex hulls Proceedings of the fourteenth annual symposium on Computational geometry, (357-364)
  2307. ACM
    van Kreveld M, Strijk T and Wolff A Point set labeling with sliding labels Proceedings of the fourteenth annual symposium on Computational geometry, (337-346)
  2308. ACM
    Chan T Geometric applications of a randomized optimization technique Proceedings of the fourteenth annual symposium on Computational geometry, (269-278)
  2309. Droste S, Jansen T and Wegener I (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs, Evolutionary Computation, 6:2, (185-196), Online publication date: 1-Jun-1998.
  2310. ACM
    Ancona M and Cazzola W (1998). Static header as sentinel, ACM SIGPLAN Notices, 33:6, (61-64), Online publication date: 1-Jun-1998.
  2311. ACM
    Oskin M, Chong F and Sherwood T (1998). Active pages, ACM SIGARCH Computer Architecture News, 26:3, (192-203), Online publication date: 1-Jun-1998.
  2312. ACM
    Srinivasan V and Varghese G (1998). Faster IP lookups using controlled prefix expansion, ACM SIGMETRICS Performance Evaluation Review, 26:1, (1-10), Online publication date: 1-Jun-1998.
  2313. ACM
    Srinivasan V and Varghese G Faster IP lookups using controlled prefix expansion Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, (1-10)
  2314. ACM
    Hadjimitsis L and Mavronicolas M Contention in balancing networks resolved (extended abstract) Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, (41-50)
  2315. ACM
    Cheng G, Feng M, Leiserson C, Randall K and Stark A Detecting data races in Cilk programs that use locks Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (298-309)
  2316. ACM
    Laing A and Cypher R Deadlock-free routing in arbitrary networks via the flattest common supersequence method Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, (55-66)
  2317. ACM
    Guha S, Rastogi R and Shim K (1998). CURE, ACM SIGMOD Record, 27:2, (73-84), Online publication date: 1-Jun-1998.
  2318. ACM
    Guha S, Rastogi R and Shim K CURE Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (73-84)
  2319. Atallah M and Comer D (1998). Algorithms for Variable Length Subnet Address Assignment, IEEE Transactions on Computers, 47:6, (693-699), Online publication date: 1-Jun-1998.
  2320. Schwalb E and Vila L (1998). Temporal Constraints, Constraints, 3:2/3, (129-149), Online publication date: 1-Jun-1998.
  2321. Andersson M and Sandholm T Sequencing of Contract Types for Anytime Task Reallocation Selected Papers from the First International Workshop on Agent Mediated Electronic Trading on Agent Mediated Electronic Commerce, (54-69)
  2322. ACM
    Muscettola N, Morris P, Pell B and Smith B Issues in temporal reasoning for autonomous control systems Proceedings of the second international conference on Autonomous agents, (362-368)
  2323. ACM
    Xi H and Pfenning F (1998). Eliminating array bound checking through dependent types, ACM SIGPLAN Notices, 33:5, (249-257), Online publication date: 1-May-1998.
  2324. ACM
    Frigo M, Leiserson C and Randall K (1998). The implementation of the Cilk-5 multithreaded language, ACM SIGPLAN Notices, 33:5, (212-223), Online publication date: 1-May-1998.
  2325. ACM
    Clinger W (1998). Proper tail recursion and space efficiency, ACM SIGPLAN Notices, 33:5, (174-185), Online publication date: 1-May-1998.
  2326. ACM
    Xi H and Pfenning F Eliminating array bound checking through dependent types Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (249-257)
  2327. ACM
    Frigo M, Leiserson C and Randall K The implementation of the Cilk-5 multithreaded language Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (212-223)
  2328. ACM
    Clinger W Proper tail recursion and space efficiency Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (174-185)
  2329. ACM
    Anderson J and Brown S Technology mapping for large complex PLDs Proceedings of the 35th annual Design Automation Conference, (698-703)
  2330. ACM
    Culetu J, Amir C and MacDonald J A practical repeater insertion method in high speed VLSI circuits Proceedings of the 35th annual Design Automation Conference, (392-395)
  2331. ACM
    Zhou H and Wong D Global routing with crosstalk constraints Proceedings of the 35th annual Design Automation Conference, (374-377)
  2332. ACM
    Oh J and Pedram M Multi-pad power/ground network design for uniform distribution of ground bounce Proceedings of the 35th annual Design Automation Conference, (287-290)
  2333. ACM
    Shi W, Liu J, Kakani N and Yu T A fast hierarchical algorithm for 3-D capacitance extraction Proceedings of the 35th annual Design Automation Conference, (212-217)
  2334. ACM
    Durand D and Kahn P MAPA Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems, (66-76)
  2335. Candan K, Rangan P and Subrahmanian V (1998). Collaborative Multimedia Systems, IEEE Transactions on Knowledge and Data Engineering, 10:3, (433-457), Online publication date: 1-May-1998.
  2336. Jing N, Huang Y and Rundensteiner E (1998). Hierarchical Encoded Path Views for Path Query Processing, IEEE Transactions on Knowledge and Data Engineering, 10:3, (409-432), Online publication date: 1-May-1998.
  2337. Tallini L and Bose B (1998). Design of Balanced and Constant Weight Codes for VLSI Systems, IEEE Transactions on Computers, 47:5, (556-572), Online publication date: 1-May-1998.
  2338. Akra M and Bazzi L (1998). On the Solution of Linear Recurrence Equations, Computational Optimization and Applications, 10:2, (195-210), Online publication date: 1-May-1998.
  2339. Oskin M, Chong F and Sherwood T Active pages Proceedings of the 25th annual international symposium on Computer architecture, (192-203)
  2340. ACM
    Hu W, Ritter G and Schmalz M Approximating the longest approximate common subsequence problem Proceedings of the 36th annual Southeast regional conference, (166-172)
  2341. ACM
    Malerba J and Murthy N An optimal search tree Proceedings of the 36th annual Southeast regional conference, (173-177)
  2342. Yen T, Ishii A, Casavant A and Wolf W (1998). Efficient Algorithms for Interface Timing Verification, Formal Methods in System Design, 12:3, (241-265), Online publication date: 1-Apr-1998.
  2343. Theys M, Siegel H, Beck N, Ta M, n , Cisco Systems I and Jurczyk M A Mathematical Model, Heuristic, and Simulation Study for a Basic Data Staging Problem in a Heterogeneous Networking Environment Proceedings of the Seventh Heterogeneous Computing Workshop
  2344. Armstrong R, Hensgen D and Kidd T The Relative Performance of Various Mapping Algorithms is Independent of Sizable Variances in Run-time Predictions Proceedings of the Seventh Heterogeneous Computing Workshop
  2345. ACM
    Pruhs K (1998). How to design dynamic programming algorithms sans recursion, ACM SIGACT News, 29:1, (32-35), Online publication date: 1-Mar-1998.
  2346. ACM
    Swartz J, Betz V and Rose J A fast routability-driven router for FPGAs Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays, (140-149)
  2347. Maheshwari N and Sapatnekar S (1998). Efficient retiming of large circuits, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 6:1, (74-83), Online publication date: 1-Mar-1998.
  2348. Stelling P, Martel C, Oklobdzija V and Ravi R (1998). Optimal Circuits for Parallel Multipliers, IEEE Transactions on Computers, 47:3, (273-285), Online publication date: 1-Mar-1998.
  2349. ACM
    Kimm H Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system Proceedings of the 1998 ACM symposium on Applied Computing, (623-627)
  2350. Maheshwari N and Sapatnekar S Efficient minarea retiming of large level-clocked circuits Proceedings of the conference on Design, automation and test in Europe, (840-847)
  2351. Hsiao M and Chakradhar S State relaxation based subsequence removal for fast static compaction in sequential circuits Proceedings of the conference on Design, automation and test in Europe, (577-582)
  2352. Mesman B, Strik M, Timmer A, van Meerbergen J and Jess J A constraint driven approach to loop pipelining and register binding Proceedings of the conference on Design, automation and test in Europe, (377-383)
  2353. Barbehenn M (1998). A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices, IEEE Transactions on Computers, 47:2, (263), Online publication date: 1-Feb-1998.
  2354. Donaldson V and Ferrante J (1998). Analyzing Asynchronous Pipeline Schedules, International Journal of Parallel Programming, 26:1, (5-42), Online publication date: 1-Feb-1998.
  2355. Arge L, Procopiuc O, Ramaswamy S, Suel T and Vitter J Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (685-694)
  2356. Benczúr A and Karger D Augmenting undirected edge connectivity in Õ(n2) time Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (500-509)
  2357. Pan V Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (68-77)
  2358. Wu B, Lancia G, Bafna V, Chao K, Ravi R and Tang C A polynomial time approximation scheme for minimum routing cost spanning trees Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (21-32)
  2359. Calland P, Darte A and Robert Y (1998). Circuit Retiming Applied to Decomposed Software Pipelining, IEEE Transactions on Parallel and Distributed Systems, 9:1, (24-35), Online publication date: 1-Jan-1998.
  2360. Su S, Jawadi R, Cherukuri P, Li Q and Nartey R (1998). OSAM*.KBMS/P, IEEE Transactions on Knowledge and Data Engineering, 10:1, (55-75), Online publication date: 1-Jan-1998.
  2361. Kumar A, Tsotras V and Faloutsos C (1998). Designing Access Methods for Bitemporal Databases, IEEE Transactions on Knowledge and Data Engineering, 10:1, (1-20), Online publication date: 1-Jan-1998.
  2362. Stewart A (1998). Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications, IEEE Transactions on Visualization and Computer Graphics, 4:1, (82-93), Online publication date: 1-Jan-1998.
  2363. Liao S, Devadas S, Keutzer K, Tjiang S and Wang A (1998). Code Optimization Techniques in Embedded DSP Microprocessors, Design Automation for Embedded Systems, 3:1, (59-73), Online publication date: 1-Jan-1998.
  2364. Chen L (1997). Parallel simulation by multi-instruction, longest-path algorithms, Queueing Systems: Theory and Applications, 27:1/2, (37-54), Online publication date: 14-Dec-1997.
  2365. ACM
    Bugnion E, Devine S and Rosenblum M (1997). Disco, ACM SIGOPS Operating Systems Review, 31:5, (143-156), Online publication date: 1-Dec-1997.
  2366. Damerdji H, Henderson S and Glynn P Computational efficiency evaluation in output analysis Proceedings of the 29th conference on Winter simulation, (208-215)
  2367. ACM
    Prabhakar S, Agrawal D, El Abbadi A, Singh A and Smith T Browsing and placement of multiresolution images on parallel disks Proceedings of the fifth workshop on I/O in parallel and distributed systems, (102-113)
  2368. ACM
    Cormen T, Wegmann J and Nicol D Multiprocessor out-of-core FFTs with distributed memory and parallel disks (extended abstract) Proceedings of the fifth workshop on I/O in parallel and distributed systems, (68-78)
  2369. Mooney V and De Micheli G Real time analysis and priority scheduler generation for hardware-software systems with a synthesized run-time system Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (605-612)
  2370. Zhou H and Wong D An exact gate decomposition algorithm for low-power technology mapping Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (575-580)
  2371. Enos M, Hauck S and Sarrafzadeh M Replication for logic bipartitioning Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (342-349)
  2372. Mitra S, Avra L and McCluskey E An output encoding problem and a solution technique Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (304-307)
  2373. Kirovski D and Potkonjak M A quantitative approach to functional debugging Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (170-173)
  2374. Wang S and Gupta S DS-LFSR Proceedings of the 1997 IEEE International Test Conference
  2375. ACM
    Bruno J, Gabber E, Özden B and Silberschatz A Move-to-rear list scheduling Proceedings of the fifth ACM international conference on Multimedia, (63-73)
  2376. Hsu D and Wei D (1997). Efficient Routing and Sorting Schemes for de Bruijn Networks, IEEE Transactions on Parallel and Distributed Systems, 8:11, (1157-1170), Online publication date: 1-Nov-1997.
  2377. Fink S, Baden S, Huston C and Jansen K (1997). Parallel Cluster Identification for Multidimensional Lattices, IEEE Transactions on Parallel and Distributed Systems, 8:11, (1089-1097), Online publication date: 1-Nov-1997.
  2378. Saab Y (1997). Combinatorial Optimization by Dynamic Contraction, Journal of Heuristics, 3:3, (207-224), Online publication date: 1-Nov-1997.
  2379. Friedman N, Geiger D and Goldszmidt M (1997). Bayesian Network Classifiers, Machine Language, 29:2-3, (131-163), Online publication date: 1-Nov-1997.
  2380. Gross M, Sprenger T and Finger J Visualizing Informationon a Sphere Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
  2381. ACM
    Bogoiavlenski I, Clear A, Davies G, Flack H, Myers J, Rasala R, Goldweber M and Impagliazzo J (1997). Historical perspectives on the computing curriculum, ACM SIGCUE Outlook, 25:4, (94-111), Online publication date: 1-Oct-1997.
  2382. ACM
    Bugnion E, Devine S and Rosenblum M Disco Proceedings of the sixteenth ACM symposium on Operating systems principles, (143-156)
  2383. Fiduccia C and Hedrick P (1997). Edge Congestion of Shortest Path Systems for All-to-All Communication, IEEE Transactions on Parallel and Distributed Systems, 8:10, (1043-1054), Online publication date: 1-Oct-1997.
  2384. Ben-David S, Kushilevitz E and Mansour Y (1997). Online Learning versus Offline Learning, Machine Language, 29:1, (45-63), Online publication date: 1-Oct-1997.
  2385. ACM
    Berry J (1997). Improving discrete mathematics and algorithms curricula with LINK, ACM SIGCSE Bulletin, 29:3, (14-20), Online publication date: 1-Sep-1997.
  2386. Dutt S and Mahapatra N (1997). Node-covering, Error-correcting Codes and Multiprocessors with Very High Average Fault Tolerance, IEEE Transactions on Computers, 46:9, (997-1015), Online publication date: 1-Sep-1997.
  2387. Knapp M, Kindlmann P and Papaefthymiou M (1997). Design and Evaluation of Adiabatic Arithmetic Units, Analog Integrated Circuits and Signal Processing, 14:1-2, (71-79), Online publication date: 1-Sep-1997.
  2388. Dietterich T and Flann N (1997). Explanation-Based Learning and Reinforcement Learning, Machine Language, 28:2-3, (169-210), Online publication date: 1-Sep-1997.
  2389. Gerevini A and Cristani M On finding a solution in temporal constraint satisfaction problems Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2, (1460-1465)
  2390. Lee H and Fortes J Automatic generation of injective modular mappings Proceedings of the international Conference on Parallel Processing
  2391. Zhang N and Zhang W Fast value iteration for goal-directed Markov decision processes Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence, (489-494)
  2392. ACM
    Hershberger J and Suri S Efficient breakout routing in printed circuit boards Proceedings of the thirteenth annual symposium on Computational geometry, (460-462)
  2393. ACM
    Brönnimann H, Emiris I, Pan V and Pion S Computing exact geometric predicates using modular arithmetic with single precision Proceedings of the thirteenth annual symposium on Computational geometry, (174-182)
  2394. ACM
    Berretty R, Goldberg K, Overmars M and van der Stappen A On fence design and the complexity of push plans for orienting parts Proceedings of the thirteenth annual symposium on Computational geometry, (21-29)
  2395. ACM
    Malkhi D, Reiter M and Wright R Probabilistic quorum systems Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, (267-273)
  2396. Tan M, Siegel H, Antonio J and Li Y (1997). Minimizing the Application Execution Time Through Scheduling of Subtasks and Communication Traffic in a Heterogeneous Computing System, IEEE Transactions on Parallel and Distributed Systems, 8:8, (857-871), Online publication date: 1-Aug-1997.
  2397. Al-furiah I, Aluru S, Goil S and Ranka S (1997). Practical Algorithms for Selection on Coarse-Grained Parallel Computers, IEEE Transactions on Parallel and Distributed Systems, 8:8, (813-824), Online publication date: 1-Aug-1997.
  2398. Yannakakis M and Lee D (1997). An Efficient Algorithm for Minimizing Real-Time Transition Systems, Formal Methods in System Design, 11:2, (113-136), Online publication date: 1-Aug-1997.
  2399. Bhattacharyya S, Murthy P and Lee E Optimized software synthesis for synchronous dataflow Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
  2400. Wang Y and Waibel A Decoding algorithm in statistical machine translation Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics, (366-372)
  2401. Hsieh H, Liu W, Franzon P and Cavin R (1997). Clocking Optimization and Distribution in Digital Systems with Scheduled Skews, Journal of VLSI Signal Processing Systems, 16:2-3, (131-147), Online publication date: 1-Jul-1997.
  2402. Hsieh H, Liu W, Franzon P and Cavin R (1997). Clocking Optimization and Distribution in Digital Systemswith Scheduled Skews, Journal of VLSI Signal Processing Systems, 16:2-3, (131-147), Online publication date: 1-Jul-1997.
  2403. Mahapatra N and Dutt S (1997). Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search, IEEE Transactions on Parallel and Distributed Systems, 8:7, (738-756), Online publication date: 1-Jul-1997.
  2404. Murthy P, Bhattacharyya S and Lee E (1997). Joint Minimization of Code and Data for Synchronous DataflowPrograms, Formal Methods in System Design, 11:1, (41-70), Online publication date: 1-Jul-1997.
  2405. Marcoux Y and Sévigny M Querying hierarchical text and acyclic hypertext with generalized context-free grammars Computer-Assisted Information Searching on Internet, (546-561)
  2406. Small C A tool for constructing safe extensible C++ systems Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3, (13-13)
  2407. ACM
    Kirovski D and Potkonjak M System-level synthesis of low-power hard real-time systems Proceedings of the 34th annual Design Automation Conference, (697-702)
  2408. ACM
    Cong J and Wu C FPGA synthesis with retiming and pipelining for clock period minimization of sequential circuits Proceedings of the 34th annual Design Automation Conference, (644-649)
  2409. ACM
    Tirat-Gefen Y, Silva D and Parker A Incorporating imprecise computation into system-level design of application-specific heterogeneous multiprocessors Proceedings of the 34th annual Design Automation Conference, (58-63)
  2410. ACM
    Maheshwari N and Sapatnekar S An improved algorithm for minimum-area retiming Proceedings of the 34th annual Design Automation Conference, (2-7)
  2411. ACM
    Berry J Improving discrete mathematics and algorithms curricula with LINK Proceedings of the 2nd conference on Integrating technology into computer science education, (14-20)
  2412. ACM
    Goldweber M, Impagliazzo J, Bogoiavlenski I, Clear A, Davies G, Flack H, Myers J and Rasala R Historical perspectives on the computing curriculum (report of the ITiCSE '97 working group on historical perspectives in computing education) The supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, (94-111)
  2413. Mohri M (1997). Finite-state transducers in language and speech processing, Computational Linguistics, 23:2, (269-311), Online publication date: 1-Jun-1997.
  2414. ACM
    Datta S and Sitaraman R The performance of simple routing algorithms that drop packets Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (159-169)
  2415. ACM
    Chun B, Mainwaring A, Schleimer S and Wilkerson D System area network mapping Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (116-126)
  2416. ACM
    Kontogiannis S, Pantziou G and Spirakis P Efficient computations on fault-prone BSP machines Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (84-93)
  2417. ACM
    Feng M and Leiserson C Efficient detection of determinacy races in Cilk programs Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, (1-11)
  2418. ACM
    Maggs B and Vöcking B Improved routing and sorting on multibutterflies Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (517-530)
  2419. ACM
    Alon N, Dietzfelbinger M, Miltersen P, Petrank E and Tardos G Is linear hashing good? Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (465-474)
  2420. ACM
    Yut G and Chang T Assessing the feasibility of a process plan Proceedings of the fourth ACM symposium on Solid modeling and applications, (322-335)
  2421. ACM
    Han J On multiple interpretations Proceedings of the fourth ACM symposium on Solid modeling and applications, (311-321)
  2422. ACM
    Lopes H and Tavares G Structural operators for modeling 3-manifolds Proceedings of the fourth ACM symposium on Solid modeling and applications, (10-18)
  2423. ACM
    Scheufele W and Moerkotte G On the complexity of generating optimal plans with cross products (extended abstract) Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (238-248)
  2424. Hsiao M, Rudnick E and Patel J Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors Proceedings of the 15th IEEE VLSI Test Symposium
  2425. Suri S, Varghese G and Chandranmenon G Leap Forward Virtual Clock Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
  2426. ACM
    Gudivada V, Bhuyan J and Adusumilli R A retrieval technique for virtual reality databases Proceedings of the 1997 ACM symposium on Applied computing, (328-333)
  2427. ACM
    Cong J, Kahng A and Leung K Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design Proceedings of the 1997 international symposium on Physical design, (88-95)
  2428. Silva C and Mitchell J (1997). The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids, IEEE Transactions on Visualization and Computer Graphics, 3:2, (142-157), Online publication date: 1-Apr-1997.
  2429. Ku H and Hayes J (1997). Systematic Design of Fault-Tolerant Multiprocessors with Shared Buses, IEEE Transactions on Computers, 46:4, (439-455), Online publication date: 1-Apr-1997.
  2430. 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.
  2431. 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.
  2432. Jha P and Dutt N Library Mapping for Memories Proceedings of the 1997 European conference on Design and Test
  2433. Sriram S and Lee E (1997). Determining the Order of Processor Transactions in StaticallyScheduled Multiprocessors, Journal of VLSI Signal Processing Systems, 15:3, (207-220), Online publication date: 1-Mar-1997.
  2434. ACM
    Mallozzi J (1997). Binary trees á laSTL, ACM SIGCSE Bulletin, 29:1, (159-163), Online publication date: 1-Mar-1997.
  2435. ACM
    Mallozzi J Binary trees á laSTL Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education, (159-163)
  2436. ACM
    Keen J and Dally W (1997). Extended ephemeral logging, ACM Transactions on Database Systems, 22:1, (1-42), Online publication date: 1-Mar-1997.
  2437. Sitaraman M, Weide B and Ogden W (1997). On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations, IEEE Transactions on Software Engineering, 23:3, (157-170), Online publication date: 1-Mar-1997.
  2438. Hakkoymaz V and Özsoyoglu G (1997). A Constraint-Driven Approach to Automate the Organization andPlayout of Presentations in Multimedia Databases, Multimedia Tools and Applications, 4:2, (171-197), Online publication date: 1-Mar-1997.
  2439. Madsen J, Grode J, Knudsen P, Petersen M and Haxthausen A (1997). LYCOS, Design Automation for Embedded Systems, 2:2, (195-235), Online publication date: 1-Mar-1997.
  2440. ACM
    Vahid F I/O and performance tradeoffs with the FunctionBus during multi-FPGA partitioning Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays, (27-34)
  2441. ACM
    Candan K, Prabhakaran B and Subrahmanian V CHIMP Proceedings of the fourth ACM international conference on Multimedia, (329-340)
  2442. ACM
    Zimmer R and Lengauer T Fast and numerically stable parametric alignment of biosequences Proceedings of the first annual international conference on Computational molecular biology, (344-353)
  2443. ACM
    Xu Y and Uberbacher E Reference-based gene model prediction on DNA contigs (extended abstract) Proceedings of the first annual international conference on Computational molecular biology, (330-336)
  2444. ACM
    Schwikowski B and Vingron M The deferred path heuristic for the generalized tree alignment problem Proceedings of the first annual international conference on Computational molecular biology, (257-266)
  2445. ACM
    Myers G, Selznick S, Zhang Z and Miller W Progressive multiple alignment with constraints Proceedings of the first annual international conference on Computational molecular biology, (220-225)
  2446. ACM
    Ishii A, Leiserson C and Papaefthymiou M (1997). Optimizing two-phase, level-clocked circuitry, Journal of the ACM, 44:1, (148-199), Online publication date: 15-Jan-1997.
  2447. ACM
    Miller G, Teng S, Thurston W and Vavasis S (1997). Separators for sphere-packings and nearest neighbor graphs, Journal of the ACM, 44:1, (1-29), Online publication date: 15-Jan-1997.
  2448. Frederickson G and Solis-Oba R Efficient algorithms for robustness in matroid optimization Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (659-668)
  2449. Salman F, Cheriyan J, Ravi R and Subramanian S Buy-at-bulk network design Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (619-628)
  2450. Chan W and Chin F Efficient algorithms for finding disjoint paths in grids Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (454-463)
  2451. Jiang T and Karp R Mapping clones with a given ordering or interleaving Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (400-409)
  2452. Finkler U and Mehlhorn K Runtime prediction of real programs on real machines Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (380-389)
  2453. Chekuri C, Goldberg A, Karger D, Levine M and Stein C Experimental study of minimum cut algorithms Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (324-333)
  2454. Amato G, Cattaneo G and Italiano G Experimental analysis of dynamic minimum spanning tree algorithms Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (314-323)
  2455. Wilson D Determinant algorithms for random planar structures Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (258-267)
  2456. Cohen E and Zwick U All-pairs small-stretch paths Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (93-102)
  2457. Cherkassky B, Goldberg A and Silverstein C Buckets, heaps, lists, and monotone priority queues Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (83-92)
  2458. Dahlhaus E, Gustedt J and McConnell R Efficient and practical modular decomposition Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (26-35)
  2459. Young C, Casinovi G, Fowler J and Kerstetter P An algorithm for power estimation in switched-capacitor circuits Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (450-454)
  2460. ACM
    Bozkaya T, Yazdani N and Özsoyoğlu M Matching and indexing sequences of different lengths Proceedings of the sixth international conference on Information and knowledge management, (128-135)
  2461. ACM
    Alberts D, Cattaneo G and Italiano G (1997). An empirical study of dynamic graph algorithms, ACM Journal of Experimental Algorithmics, 2, (5-es), Online publication date: 1-Jan-1997.
  2462. ACM
    Buchsbaum A and Giancarlo R (1997). Algorithmic aspects in speech recognition, ACM Journal of Experimental Algorithmics, 2, (1-es), Online publication date: 1-Jan-1997.
  2463. ACM
    Fradet P and Le Métayer D Shape types Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (27-39)
  2464. Bhattacharyya S, Murthy P and Lee E (1997). APGAN and RPMC, Design Automation for Embedded Systems, 2:1, (33-60), Online publication date: 1-Jan-1997.
  2465. Fernández-Baca D, Slutzki G and Eppstein D (1996). Using sparsification for parametric minimum spanning tree problems, Nordic Journal of Computing, 3:4, (352-366), Online publication date: 1-Dec-1996.
  2466. Pramanik S and Jung S (1996). Description and Identification of Distributed Fragments of Recursive Relations, IEEE Transactions on Knowledge and Data Engineering, 8:6, (1002-1016), Online publication date: 1-Dec-1996.
  2467. Raghavan V (1996). Weighted Diagnosis with Asymmetric Invalidation, IEEE Transactions on Computers, 45:12, (1435-1438), Online publication date: 1-Dec-1996.
  2468. Huss-Lederman S, Jacobson E, Tsao A, Turnbull T and Johnson J Implementation of Strassen's algorithm for matrix multiplication Proceedings of the 1996 ACM/IEEE conference on Supercomputing, (32-es)
  2469. ACM
    Jing N, Huang Y and Rundensteiner E Hierarchical optimization of optimal path finding for transportation applications Proceedings of the fifth international conference on Information and knowledge management, (261-268)
  2470. Rousseau F A Codesign Experiment in Acoustic Echo Cancellation Proceedings of the 9th international symposium on System synthesis
  2471. Vahid , Le and Hsu A Comparison of Functional and Structural Partitioning Proceedings of the 9th international symposium on System synthesis
  2472. Sitaraman M (1996). Impact of performance considerations on formal specification design, Formal Aspects of Computing, 8:6, (716-736), Online publication date: 1-Nov-1996.
  2473. Gao L and Rosenberg A (1996). Toward Efficient Scheduling of Evolving Computations on Rings of Processors, Journal of Parallel and Distributed Computing, 38:1, (92-100), Online publication date: 10-Oct-1996.
  2474. Silva C, Mitchell J and Kaufman A Fast rendering of irregular grids Proceedings of the 1996 symposium on Volume visualization, (15-ff.)
  2475. ACM
    Cooperman G and Tselman M New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique Proceedings of the 1996 international symposium on Symbolic and algebraic computation, (155-160)
  2476. Bennour I and Albouhamid E (1996). Lower bounds on the iteration time and the initiation interval of functional pipelining and loop folding, Design Automation for Embedded Systems, 1:4, (333-355), Online publication date: 1-Oct-1996.
  2477. ACM
    Ben-Ari M (1996). Structure exits, not loops, ACM SIGCSE Bulletin, 28:3, (51), Online publication date: 1-Sep-1996.
  2478. ACM
    Mitzenmacher M (1996). Designing stimulating programming assignments for an algorithms course, ACM SIGCSE Bulletin, 28:3, (29-36), Online publication date: 1-Sep-1996.
  2479. Meyers A, Yangarber R and Grishman R Alignment of shared forests for bilingual corpora Proceedings of the 16th conference on Computational linguistics - Volume 1, (460-465)
  2480. Knobbe A and Adriaans P Analysing binary associations Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, (311-314)
  2481. Becker A and Geiger D A sufficiently fast algorithm for finding close to optimal junction trees Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence, (81-89)
  2482. ACM
    Andersson A and Brodnik A (1996). Comment on “self-indexed sort”, ACM SIGPLAN Notices, 31:8, (40-41), Online publication date: 1-Aug-1996.
  2483. Guo S, Sun W and Weiss M (1996). On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems, IEEE Transactions on Knowledge and Data Engineering, 8:4, (604-616), Online publication date: 1-Aug-1996.
  2484. Ehrenburg H Improved directed acyclic graph evaluation and the combine operator in genetic programming Proceedings of the 1st annual conference on genetic programming, (285-290)
  2485. ACM
    Benczúr A and Karger D Approximating s-t minimum cuts in Õ(n2) time Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (47-55)
  2486. ACM
    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)
  2487. Saad Y (1996). ILUM, SIAM Journal on Scientific Computing, 17:4, (830-847), Online publication date: 1-Jul-1996.
  2488. Satta G and Brill E Efficient transformation-based parsing Proceedings of the 34th annual meeting on Association for Computational Linguistics, (255-262)
  2489. ACM
    Blumofe R, Frigo M, Joerg C, Leiserson C and Randall K An analysis of dag-consistent distributed shared-memory algorithms Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures, (297-308)
  2490. Lee T, Bozkaya T, Kuo H, Özsoyoglu G and Özsoyoglu Z A Scientific Multimedia Database System for Polymer Science Experiments Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, (86-95)
  2491. Yazdani N and Özsoyoglu Z Sequence Matching of Images Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, (53-62)
  2492. Diks K and Pelc A (1996). Fault-tolerant linear broadcasting, Nordic Journal of Computing, 3:2, (188-201), Online publication date: 1-Jun-1996.
  2493. ACM
    Bamji C and Malavasi E Enhanced network flow algorithm for yield optimization Proceedings of the 33rd annual Design Automation Conference, (746-751)
  2494. ACM
    Liou H and Lin T Area efficient pipelined pseudo-exhaustive testing with retiming Proceedings of the 33rd annual Design Automation Conference, (274-279)
  2495. ACM
    Chen C and Gupta S A satisfiability-based test generator for path delay faults in combinational circuits Proceedings of the 33rd annual Design Automation Conference, (209-214)
  2496. ACM
    Guo S, Sun W and Weiss M (1996). Solving satisfiability and implication problems in database systems, ACM Transactions on Database Systems, 21:2, (270-293), Online publication date: 1-Jun-1996.
  2497. Agarwal P and Kreveld M (1996). Connected component and simple polygon intersection searching, Algorithmica, 15:6, (626-660), Online publication date: 1-Jun-1996.
  2498. Smith D and Peot M Suspending recursion in causal-link planning Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, (182-190)
  2499. Doan A Modeling probabilistic actions for practical decision-theoretic planning Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, (62-69)
  2500. ACM
    Aggarwal C, Wolf J and Yu P On optimal piggyback merging policies for video-on-demand systems Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (200-209)
  2501. ACM
    Aggarwal C, Wolf J and Yu P (1996). On optimal piggyback merging policies for video-on-demand systems, ACM SIGMETRICS Performance Evaluation Review, 24:1, (200-209), Online publication date: 15-May-1996.
  2502. ACM
    Bilardi G and Pingali K (1996). A framework for generalized control dependence, ACM SIGPLAN Notices, 31:5, (291-300), Online publication date: 1-May-1996.
  2503. ACM
    Ramalingam G (1996). Data flow frequency analysis, ACM SIGPLAN Notices, 31:5, (267-277), Online publication date: 1-May-1996.
  2504. ACM
    Lynch N, Shavit N, Shvartsman A and Touitou D Counting networks are practically linearizable Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, (280-289)
  2505. ACM
    Bilardi G and Pingali K A framework for generalized control dependence Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, (291-300)
  2506. ACM
    Ramalingam G Data flow frequency analysis Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, (267-277)
  2507. Symvonis A and Tidswell J (1996). An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method, IEEE Transactions on Computers, 45:5, (619-625), Online publication date: 1-May-1996.
  2508. Frederickson G (1996). Searching among intervals and compact routing tables, Algorithmica, 15:5, (448-466), Online publication date: 1-May-1996.
  2509. Bader D and JáJá J Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection Proceedings of the 10th International Parallel Processing Symposium, (292-301)
  2510. Bhattacharyya S, Sriram S and Lee E Self-Timed Resynchronization Proceedings of the 10th International Parallel Processing Symposium, (199-205)
  2511. ACM
    Eisenberg M The thin glass line Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (181-188)
  2512. Cancela H and Khadiri M A Simulation Algorithm for Source Terminal Communication Network Reliability Proceedings of the 29th Annual Simulation Symposium (SS '96)
  2513. ACM
    Lee Y, Yoo S, Yoon K and Berra P Index structures for structured documents Proceedings of the first ACM international conference on Digital libraries, (91-99)
  2514. Musoll E and Cortadella J Optimizing CMOS Circuits for Low Power Using Transistor Reordering Proceedings of the 1996 European conference on Design and Test
  2515. Chen Y and Wong D An Algorithm for Zero-Skew Clock Tree Routing with Buffer Insertion Proceedings of the 1996 European conference on Design and Test
  2516. ACM
    Berman A and Duvall R (1996). Thinking about binary trees in an object-oriented world, ACM SIGCSE Bulletin, 28:1, (185-189), Online publication date: 1-Mar-1996.
  2517. ACM
    Berman A and Duvall R Thinking about binary trees in an object-oriented world Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education, (185-189)
  2518. ACM
    Blelloch G (1996). Programming parallel algorithms, Communications of the ACM, 39:3, (85-97), Online publication date: 1-Mar-1996.
  2519. Sherbrooke E, Patrikalakis N and Brisson E (1996). An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids, IEEE Transactions on Visualization and Computer Graphics, 2:1, (44-61), Online publication date: 1-Mar-1996.
  2520. ACM
    Lee P, Huang F, Huang C and Chen H Efficient implementations of two variant subset sum problems Proceedings of the 1996 ACM symposium on Applied Computing, (230-237)
  2521. ACM
    Hoelting C, Schoenefeld D and Wainwright R Finding investigator tours in telecommunication networks using genetic algorithms Proceedings of the 1996 ACM symposium on Applied Computing, (82-87)
  2522. Stojmenovic I (1996). Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals, IEEE Transactions on Parallel and Distributed Systems, 7:2, (218-224), Online publication date: 1-Feb-1996.
  2523. Herlihy M, Shavit N and Waarts O (1996). Linearizable counting networks, Distributed Computing, 9:4, (193-203), Online publication date: 1-Feb-1996.
  2524. Wang H and Agarwal P Approximation algorithms for curvature-constrained shortest paths Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (409-418)
  2525. Balakrishnan A and Chakradhar S Sequential Circuits with combinational Test Generation Complexity Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
  2526. Katkoori S, Roy J and Vemuri R A Hierarchical Register Optimization Algorithm for Behavioral Synthesis Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
  2527. ACM
    Dutt S and Trinh N Are there advantages to high-dimension architectures?: Analysis of k-ary n-cubes for the class of parallel divide-and-conquer algorithms Proceedings of the 10th international conference on Supercomputing, (398-406)
  2528. ACM
    Calland P, Darte A and Robert Y A new guaranteed heuristic for the software pipelining problem Proceedings of the 10th international conference on Supercomputing, (261-269)
  2529. ACM
    Kaxiras S and Goodman J The GLOW cache coherence protocol extensions for widely shared data Proceedings of the 10th international conference on Supercomputing, (35-43)
  2530. ACM
    LaMarca A and Ladner R (1996). The influence of caches on the performance of heaps, ACM Journal of Experimental Algorithmics, 1, (4-es), Online publication date: 1-Jan-1996.
  2531. ACM
    Cheyney M, Gloor P, Johnson D, Makedon F, Matthews J and Metaxas P (1996). Toward multimedia conference proceedings, Communications of the ACM, 39:1, (50-59), Online publication date: 1-Jan-1996.
  2532. Palis M, Liou J and Wei D (1996). Task Clustering and Scheduling for Distributed Memory Parallel Architectures, IEEE Transactions on Parallel and Distributed Systems, 7:1, (46-55), Online publication date: 1-Jan-1996.
  2533. Kagaris D and Tragoudas S (1996). Retiming-Based Partial Scan, IEEE Transactions on Computers, 45:1, (74-87), Online publication date: 1-Jan-1996.
  2534. ACM
    Ng W and Ravishankar C Information synthesis in statistical databases Proceedings of the fourth international conference on Information and knowledge management, (355-361)
  2535. Chou P, Ortega R and Borriello G Interface co-synthesis techniques for embedded systems Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, (280-287)
  2536. Jones R, Dill D and Burch J Efficient validity checking for processor verification Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, (2-6)
  2537. ACM
    Baeza-Yates R (1995). Teaching algorithms, ACM SIGACT News, 26:4, (51-59), Online publication date: 1-Dec-1995.
  2538. ACM
    Sherbrooke E, Patrikalakis N and Brisson E Computation of the Medial Axis Transform of 3-D polyhedra Proceedings of the third ACM symposium on Solid modeling and applications, (187-200)
  2539. ACM
    Shivakumar N and Widom J User profile replication for faster location lookup in mobile environments Proceedings of the 1st annual international conference on Mobile computing and networking, (161-169)
  2540. Guéziec A and Hummel R (1995). Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition, IEEE Transactions on Visualization and Computer Graphics, 1:4, (328-342), Online publication date: 1-Dec-1995.
  2541. Brönnimann H and Goodrich M (1995). Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, 14:4, (463-479), Online publication date: 1-Dec-1995.
  2542. Goodrich M (1995). Efficient piecewise-linear function approximation using the uniform metric, Discrete & Computational Geometry, 14:4, (445-462), Online publication date: 1-Dec-1995.
  2543. ACM
    Church K and Rau L (1995). Commercial applications of natural language processing, Communications of the ACM, 38:11, (71-79), Online publication date: 1-Nov-1995.
  2544. Gupta S and Lempel M (1995). Zero-Aliasing for Modeled Faults, IEEE Transactions on Computers, 44:11, (1283-1295), Online publication date: 1-Nov-1995.
  2545. Kao M, Teng S and Toyama K (1995). An optimal parallel algorithm for planar cycle separators, Algorithmica, 14:5, (398-408), Online publication date: 1-Nov-1995.
  2546. ACM
    Shreedhar M and Varghese G (1995). Efficient fair queueing using deficit round robin, ACM SIGCOMM Computer Communication Review, 25:4, (231-242), Online publication date: 1-Oct-1995.
  2547. ACM
    Chandranmenon G and Varghese G (1995). Trading packet headers for packet processing, ACM SIGCOMM Computer Communication Review, 25:4, (162-173), Online publication date: 1-Oct-1995.
  2548. ACM
    Shreedhar M and Varghese G Efficient fair queueing using deficit round robin Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, (231-242)
  2549. ACM
    Chandranmenon G and Varghese G Trading packet headers for packet processing Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, (162-173)
  2550. Khuller S, Raghavachari B and Young N (1995). Balancing minimum spanning trees and shortest-path trees, Algorithmica, 14:4, (305-321), Online publication date: 1-Oct-1995.
  2551. Routing multicast connections with optimal network cost in ATM networks Proceedings of the 4th International Conference on Computer Communications and Networks
  2552. ACM
    Edelsbrunner H and Waupotitsch R A combinatorial approach to cartograms Proceedings of the eleventh annual symposium on Computational geometry, (98-108)
  2553. Robins G and Salowe J (1995). Low-degree minimum spanning trees, Discrete & Computational Geometry, 14:2, (151-165), Online publication date: 1-Sep-1995.
  2554. ACM
    Shavit N and Touitou D Software transactional memory Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, (204-213)
  2555. ACM
    Kennedy K, Nedeljkovic N and Sethi A (1995). A linear-time algorithm for computing the memory access sequence in data-parallel programs, ACM SIGPLAN Notices, 30:8, (102-111), Online publication date: 1-Aug-1995.
  2556. ACM
    Kennedy K, Nedeljkovic N and Sethi A A linear-time algorithm for computing the memory access sequence in data-parallel programs Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, (102-111)
  2557. ACM
    Cormen T and Bruhl K Don't be too clever Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (288-297)
  2558. ACM
    Leiserson C and Randall K Parallel algorithms for the circuit value update problem Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (13-20)
  2559. ACM
    Blelloch G, Gibbons P and Matias Y Provably efficient scheduling for languages with fine-grained parallelism Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, (1-12)
  2560. Bhuyan L and Chang Y (1995). A Combinatorial Analysis of Subcube Reliability in Hypercubes, IEEE Transactions on Computers, 44:7, (952-956), Online publication date: 1-Jul-1995.
  2561. Wilson D, Sullivan G and Masson G (1995). Certification of Computational Results, IEEE Transactions on Computers, 44:7, (833-847), Online publication date: 1-Jul-1995.
  2562. Dutt S and Mahapatra N Node Covering, Error Correcting Codes and Multiprocessors with Very High Average Fault Tolerance Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
  2563. Bright J On-Line Error Monitoring for Several Data Structures Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
  2564. ACM
    Pingali K and Bilardi G APT Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, (32-46)
  2565. ACM
    Bernecky R (1995). The role of dynamic programming & control structures in performance, ACM SIGAPL APL Quote Quad, 25:4, (11-19), Online publication date: 8-Jun-1995.
  2566. ACM
    Bernecky R The role of dynamic programming & control structures in performance Proceedings of the international conference on Applied programming languages, (11-19)
  2567. ACM
    Pingali K and Bilardi G (1995). APT, ACM SIGPLAN Notices, 30:6, (32-46), Online publication date: 1-Jun-1995.
  2568. Edelsbrunner H (1995). The union of balls and its dual shape, Discrete & Computational Geometry, 13:3-4, (415-440), Online publication date: 1-Jun-1995.
  2569. Aharonson E and Attiya H (1995). Counting networks with arbitrary fan-out, Distributed Computing, 8:4, (163-169), Online publication date: 1-Jun-1995.
  2570. ACM
    Farach M and Thorup M String matching in Lempel-Ziv compressed strings Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (703-712)
  2571. ACM
    Ferragina P and Grossi R A fully-dynamic data structure for external substring search Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (693-702)
  2572. ACM
    Khuller S and Raghavachari B Improved approximation algorithms for uniform connectivity problems Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (1-10)
  2573. ACM
    Chung J, Kao D, Cheng C and Lin T Optimization of power dissipation and skew sensitivity in clock buffer synthesis Proceedings of the 1995 international symposium on Low power design, (179-184)
  2574. ACM
    Martin J and Winklmann K (1995). AIgorithms, ACM SIGART Bulletin, 6:2, (39-41), Online publication date: 1-Apr-1995.
  2575. Karinthi R, Srinivas K and Almasi G (1995). A Parallel Algorithm for Computing Polygon Set Operations, Journal of Parallel and Distributed Computing, 26:1, (85-98), Online publication date: 1-Apr-1995.
  2576. ACM
    Li K Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations Proceedings of the 33rd annual on Southeast regional conference, (219-226)
  2577. ACM
    Toll W (1995). Decision points in the introduction of parallel processing into the undergraduate curriculum, ACM SIGCSE Bulletin, 27:1, (136-140), Online publication date: 15-Mar-1995.
  2578. ACM
    Toll W Decision points in the introduction of parallel processing into the undergraduate curriculum Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (136-140)
  2579. Jha P and Dutt N Design reuse through high-level library mapping Proceedings of the 1995 European conference on Design and Test
  2580. ACM
    Jannink J (1995). Implementing deletion in B+-trees, ACM SIGMOD Record, 24:1, (33-38), Online publication date: 1-Mar-1995.
  2581. ACM
    Berson D, Gupta R and Soffa M (1995). GURRR, ACM SIGPLAN Notices, 30:3, (23-34), Online publication date: 1-Mar-1995.
  2582. ACM
    Berson D, Gupta R and Soffa M GURRR Papers from the 1995 ACM SIGPLAN workshop on Intermediate representations, (23-34)
  2583. Fortes J and Cam H (1995). A Fast VLSI-Efficient Self-Routing Permutation Network, IEEE Transactions on Computers, 44:3, (448-453), Online publication date: 1-Mar-1995.
  2584. ACM
    Ravada S, Park E and Makki K Automatic detection of errors in distributed systems Proceedings of the 1995 ACM 23rd annual conference on Computer science, (30-35)
  2585. Rangarajan S, Dahbura A and Ziegler E (1995). A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies, IEEE Transactions on Computers, 44:2, (312-334), Online publication date: 1-Feb-1995.
  2586. ACM
    King D and Launchbury J Structuring depth-first search algorithms in Haskell Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (344-354)
  2587. ACM
    Brookes S and Dancanet D Sequential algorithms, deterministic parallelism, and intensional expressiveness Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (13-24)
  2588. Berger B and Wilson D Improved algorithms for protein motif recognition Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, (58-67)
  2589. ACM
    Mehlhorn K and Näher S (1995). LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, 38:1, (96-102), Online publication date: 2-Jan-1995.
  2590. ACM
    Liao S, Devadas S, Keutzer K, Tjiang S and Wang A Code optimization techniques for embedded DSP microprocessors Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (599-604)
  2591. ACM
    Mak W and Wong D On optimal board-level routing for FPGA-based logic emulation Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (552-556)
  2592. ACM
    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)
  2593. ACM
    Lalgudi K and Papaefthymiou M DELAY Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (304-309)
  2594. ACM
    Manne S, Pardo A, Bahar R, Hachtel G, Somenzi F, Macii E and Poncino M Computing the maximum power cycles of a sequential circuit Proceedings of the 32nd annual ACM/IEEE Design Automation Conference, (23-28)
  2595. Helman D and JáJá J (1995). Efficient Image Processing Algorithms on the Scan Line Array Processor, IEEE Transactions on Pattern Analysis and Machine Intelligence, 17:1, (47-56), Online publication date: 1-Jan-1995.
  2596. Weld D (1994). An Introduction to Least Commitment Planning, AI Magazine, 15:4, (27-61), Online publication date: 1-Dec-1994.
  2597. Pach J and TörźCsik J (1994). Some geometric applications of Dilworth's theorem, Discrete & Computational Geometry, 12:1, (1-7), Online publication date: 1-Dec-1994.
  2598. ACM
    Ghandeharizadeh S and Ierardi D Management of disk space with REBATE Proceedings of the third international conference on Information and knowledge management, (304-311)
  2599. Yu Q and Sechen C Approximate symbolic analysis of large analog integrated circuits Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, (664-671)
  2600. Chung J and Cheng C Skew sensitivity minimization of buffered clock tree Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, (280-283)
  2601. ACM
    Ghandeharizadeh S and Shahabi C On multimedia repositories, personal computers, and hierarchical storage systems Proceedings of the second ACM international conference on Multimedia, (407-416)
  2602. Willman N A prototype information retrieval system to perform a best-match search for names Intelligent Multimedia Information Retrieval Systems and Management - Volume 1, (751-761)
  2603. Chakrabarty K and Hayes J Efficient test response compression for multiple-output circuits Proceedings of the 1994 international conference on Test, (501-510)
  2604. Wahbeh J and Saab D On the initialization of sequential circuits Proceedings of the 1994 international conference on Test, (233-239)
  2605. Sosic R and Gu J (1994). Efficient Local Search with Conflict Minimization, IEEE Transactions on Knowledge and Data Engineering, 6:5, (661-668), Online publication date: 1-Oct-1994.
  2606. Jantsch A, Ellervee P, Hemani A, Öberg J and Tenhunen H Hardware/software partitioning and minimizing memory interface traffic Proceedings of the conference on European design automation, (226-231)
  2607. Yen T, Wolf W, Casavant A and Ishii A Efficient algorithms for interface timing verification Proceedings of the conference on European design automation, (34-39)
  2608. Weide B, Ogden W and Sitaraman M (1994). Recasting Algorithms to Encourage Reuse, IEEE Software, 11:5, (80-88), Online publication date: 1-Sep-1994.
  2609. Bixby R, Kennedy K and Kremer U Automatic Data Layout Using 0-1 Integer Programming Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, (111-122)
  2610. Rickel J and Porter B Automated modeling for answering prediction questions Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (1191-1198)
  2611. Grubb L and Dannenberg R Automated accompaniment of musical ensembles Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (94-99)
  2612. ACM
    Buy U and Sloan R Analysis of real-time programs with simple time Petri nets Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, (228-239)
  2613. ACM
    Leoncini M How much can we speedup Gaussian elimination with pivoting? Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, (290-297)
  2614. ACM
    Schwabe E and Sutherland I Improved parity-declustered layouts for disk arrays Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, (76-84)
  2615. Hsu C and Knoblock C Rule induction for semantic query optimization Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, (311-322)
  2616. Becker A Approximation algorithms for the loop cutset problem Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, (60-68)
  2617. ACM
    Gillman D and Sipser M Inference and minimization of hidden Markov chains Proceedings of the seventh annual conference on Computational learning theory, (147-158)
  2618. Mardin A (1994). Neural Network Learning and Expert Systems, AI Communications, 7:3-4, (238-240), Online publication date: 1-Jul-1994.
  2619. ACM
    Goodrich M Efficient piecewise-linear function approximation using the uniform metric Proceedings of the tenth annual symposium on Computational geometry, (322-331)
  2620. ACM
    Brönnimann H and Goodrich M Almost optimal set covers in finite VC-dimension Proceedings of the tenth annual symposium on Computational geometry, (293-302)
  2621. ACM
    Robins G and Salowe J On the maximum degree of minimum spanning trees Proceedings of the tenth annual symposium on Computational geometry, (250-258)
  2622. ACM
    Atallah M, Goodrich M and Ramaiyer K Biased finger trees and three-dimensional layers of maxima Proceedings of the tenth annual symposium on Computational geometry, (150-159)
  2623. ACM
    Goodrich M, Mitchell J and Orletsky M Practical methods for approximate geometric pattern matching under rigid motions Proceedings of the tenth annual symposium on Computational geometry, (103-112)
  2624. ACM
    Vittal A and Marek-Sadowska M Minimal delay interconnect design using alphabetic trees Proceedings of the 31st annual Design Automation Conference, (392-396)
  2625. ACM
    Kannan L, Suaris P and Fang H A methodology and algorithms for post-placement delay optimization Proceedings of the 31st annual Design Automation Conference, (327-332)
  2626. ACM
    Potkonjak M, Srivastava M and Chandrakasan A Efficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching Proceedings of the 31st annual Design Automation Conference, (189-194)
  2627. ACM
    Madhwapathy S, Sherwani N, Bhingarde S and Panyam A A unified approach to multilayer over-the-cell routing Proceedings of the 31st annual Design Automation Conference, (182-187)
  2628. ACM
    Aloqeely M and Chen C Sequencer-based data path synthesis of regular iterative algorithms Proceedings of the 31st annual Design Automation Conference, (155-160)
  2629. ACM
    Nielsen C and Kishinevsky M Performance analysis based on timing simulation Proceedings of the 31st annual Design Automation Conference, (70-76)
  2630. Satta G (1994). Tree-adjoining grammar parsing and boolean matrix multiplication, Computational Linguistics, 20:2, (173-191), Online publication date: 1-Jun-1994.
  2631. ACM
    Cole R and Graefe G (1994). Optimization of dynamic query evaluation plans, ACM SIGMOD Record, 23:2, (150-160), Online publication date: 1-Jun-1994.
  2632. ACM
    Raman R (1994). A simpler analysis of algorithm 65 (find), ACM SIGACT News, 25:2, (86-89), Online publication date: 1-Jun-1994.
  2633. Chien M and Yavuz Oruc A (1994). Adaptive Binary Sorting Schemes and Associated Interconnection Networks, IEEE Transactions on Parallel and Distributed Systems, 5:6, (561-572), Online publication date: 1-Jun-1994.
  2634. Gu J (1994). Global Optimization for Satisfiability (SAT) Problem, IEEE Transactions on Knowledge and Data Engineering, 6:3, (361-381), Online publication date: 1-Jun-1994.
  2635. ACM
    Cole R and Graefe G Optimization of dynamic query evaluation plans Proceedings of the 1994 ACM SIGMOD international conference on Management of data, (150-160)
  2636. ACM
    Chen L and Rotem D Optimal response time retrieval of replicated data (extended abstract) Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (36-44)
  2637. ACM
    Alon N, Yuster R and Zwick U Color-coding Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (326-335)
  2638. ACM
    Klein P, Rao S, Rauch M and Subramanian S Faster shortest-path algorithms for planar graphs Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (27-37)
  2639. ACM
    Cohen E Polylog-time and near-linear work approximation scheme for undirected shortest paths Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (16-26)
  2640. Ponnusamy R, Mansour N, Choudhary A and Fox G (1994). Graph contraction for mapping data on parallel computers, Scientific Programming, 3:1, (73-82), Online publication date: 1-May-1994.
  2641. ACM
    Ebling M and Satyanarayanan M (1994). SynRGen: an extensible file reference generator, ACM SIGMETRICS Performance Evaluation Review, 22:1, (108-117), Online publication date: 1-May-1994.
  2642. ACM
    Ebling M and Satyanarayanan M SynRGen: an extensible file reference generator Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, (108-117)
  2643. ACM
    Heck P (1994). Dynamic programming for pennies a day, ACM SIGCSE Bulletin, 26:1, (213-217), Online publication date: 12-Mar-1994.
  2644. ACM
    Heck P Dynamic programming for pennies a day Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (213-217)
  2645. Johnson M (1994). Computing with features as formulae, Computational Linguistics, 20:1, (1-25), Online publication date: 1-Mar-1994.
  2646. ACM
    Gupta R, Smolka S and Bhaskar S (1994). On randomization in sequential and distributed algorithms, ACM Computing Surveys, 26:1, (7-86), Online publication date: 1-Mar-1994.
  2647. Li J (1994). Multiscattering on the cube-connected cycles, Parallel Computing, 20:3, (313-324), Online publication date: 1-Mar-1994.
  2648. Choi J, Cytron R and Ferrante J (1994). On the Efficient Engineering of Ambitious Program Analysis, IEEE Transactions on Software Engineering, 20:2, (105-114), Online publication date: 1-Feb-1994.
  2649. Alon N, Blum M, Fiat A, Kannan S, Naor M and Ostrovsky R Matching nuts and bolts Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (690-696)
  2650. Goldberg A and Karzanov A Path problems in skew-symmetric graphs Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (526-535)
  2651. Cherkassky B, Goldberg A and Radzik T Shortest paths algorithms Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (516-525)
  2652. Khuller S, Raghavachari B and Young N Approximating the minimum equivalent digraph Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (177-186)
  2653. ACM
    Lee A, Rendensteiner E, Thomas S and Lafortune S An information model for genome map representation and assembly Proceedings of the second international conference on Information and knowledge management, (75-84)
  2654. ACM
    Biernat M (1993). Teaching tools for data structures and algorithms, ACM SIGCSE Bulletin, 25:4, (9-12), Online publication date: 1-Dec-1993.
  2655. Bern M, Edelsbrunner H, Eppstein D, Mitchell S and Tan T (1993). Edge insertion for optimal triangulations, Discrete & Computational Geometry, 10:1, (47-65), Online publication date: 1-Dec-1993.
  2656. Zhu K, Wong D and Chang Y Switch module design with application to two-dimensional segmentation design Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, (480-485)
  2657. 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)
  2658. Florissi D and Yemini Y Isochronets Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1, (54-63)
  2659. Narayanan S, Gupta R and Breuer M (1993). Optimal Configuring of Multiple Scan Chains, IEEE Transactions on Computers, 42:9, (1121-1131), Online publication date: 1-Sep-1993.
  2660. ACM
    Mansour N, Ponnusamy R, Choudhary A and Fox G Graph contraction for physical optimization methods Proceedings of the 7th international conference on Supercomputing, (1-10)
  2661. ACM
    Sheffler T Implementing the multiprefix operation on parallel and vector computers Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures, (377-386)
  2662. ACM
    Reps T Scan grammars Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures, (367-376)
  2663. ACM
    Cohen E Efficient parallel shortest-paths in digraphs with a separator decomposition Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures, (57-67)
  2664. Hsu C and Knoblock C Learning database abstractions for query reformulation Proceedings of the 2nd International Conference on Knowledge Discovery in Databases, (276-290)
  2665. Lam W and Bacchus F Using causal information and local measures to learn Bayesian networks Proceedings of the Ninth international conference on Uncertainty in artificial intelligence, (243-250)
  2666. ACM
    Manjikian N and Loucks W (1993). High performance parallel logic simulations on a network of workstations, ACM SIGSIM Simulation Digest, 23:1, (76-84), Online publication date: 1-Jul-1993.
  2667. ACM
    Goodrich M and Tamassia R Dynamic ray shooting and shortest paths via balanced geodesic triangulations Proceedings of the ninth annual symposium on Computational geometry, (318-327)
  2668. ACM
    Pach J and Tőrőcsik J Some geometric applications of Dilworth's theorem Proceedings of the ninth annual symposium on Computational geometry, (264-269)
  2669. ACM
    Delfinado C and Edelsbrunner H An incremental algorithm for Betti numbers of simplicial complexes Proceedings of the ninth annual symposium on Computational geometry, (232-239)
  2670. ACM
    Edelsbrunner H The union of balls and its dual shape Proceedings of the ninth annual symposium on Computational geometry, (218-231)
  2671. ACM
    Goodrich M Geometric partitioning made easier, even in parallel Proceedings of the ninth annual symposium on Computational geometry, (73-82)
  2672. ACM
    Manjikian N and Loucks W High performance parallel logic simulations on a network of workstations Proceedings of the seventh workshop on Parallel and distributed simulation, (76-84)
  2673. ACM
    Papaefthymiou M and Randall K TIM Proceedings of the 30th international Design Automation Conference, (497-502)
  2674. ACM
    Pan P, Dong S and Liu C Optimal graph constraint reduction for symbolic layout compaction Proceedings of the 30th international Design Automation Conference, (401-406)
  2675. ACM
    Rajaraman R and Wong D Optimal clustering for delay minimization Proceedings of the 30th international Design Automation Conference, (309-314)
  2676. ACM
    Kagaris D and Tragoudas S Partial scan with retiming Proceedings of the 30th international Design Automation Conference, (249-254)
  2677. ACM
    Gerevini A, Schubert L and Schaeffer S (1993). Temporal reasoning in Timegraph I–II, ACM SIGART Bulletin, 4:3, (21-25), Online publication date: 1-Jul-1993.
  2678. ACM
    Stillman J, Arthur R and Deitsch A (1993). Tachyon, ACM SIGART Bulletin, 4:3, (1-4), Online publication date: 1-Jul-1993.
  2679. Tsoukalas M, Duran J and Ntafos S (1993). On some reliability estimation problems in random and partition testing, IEEE Transactions on Software Engineering, 19:7, (687-697), Online publication date: 1-Jul-1993.
  2680. ACM
    Keen J and Dally W (1993). Performance evaluation of ephemeral logging, ACM SIGMOD Record, 22:2, (187-196), Online publication date: 1-Jun-1993.
  2681. ACM
    Keen J and Dally W Performance evaluation of ephemeral logging Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (187-196)
  2682. ACM
    Dwork C, Herlihy M and Waarts O Contention in shared memory algorithms Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (174-183)
  2683. ACM
    Farach M, Kannan S and Warnow T A robust model for finding optimal evolutionary trees Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (137-145)
  2684. ACM
    Paxton J, Ross R and Starkey D An integrated, breadth-first computer science curriculum based on Computing Curricula 1991 Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education, (68-72)
  2685. ACM
    Velez-Sosa A and Gloor P Animating hashing algorithms for computer science education Proceedings of the 1993 ACM conference on Computer science, (201-208)
  2686. ACM
    Paxton J, Ross R and Starkey D (1993). An integrated, breadth-first computer science curriculum based on Computing Curricula 1991, ACM SIGCSE Bulletin, 25:1, (68-72), Online publication date: 1-Mar-1993.
  2687. ACM
    Strate S and Wainwright R Load balancing techniques for dynamic programming algorithms on hypercube multiprocessors Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (562-569)
  2688. Sarkar S and Boyer K (1993). Integration, Inference, and Management of Spatial Information Using Bayesian Networks, IEEE Transactions on Pattern Analysis and Machine Intelligence, 15:3, (256-274), Online publication date: 1-Mar-1993.
  2689. Matias Y, Vitter J and Ni W Dynamic generation of discrete random variates Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (361-370)
  2690. Khuller S, Raghavachari B and Young N Balancing minimum spanning and shortest path trees Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (243-250)
  2691. Goldberg A Scaling algorithms for the shortest paths problem Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (222-231)
  2692. Galperin I and Rivest R Scapegoat trees Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (165-174)
  2693. Matoušek J, Mount D and Netanyahu N Efficient randomized algorithms for the repeated median line estimator Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (74-82)
  2694. Simpson W and Sheppard J (1993). Fault Isolation in an Integrated Diagnostic Environment, IEEE Design & Test, 10:1, (52-66), Online publication date: 1-Jan-1993.
  2695. Thearling K and Smith S An improved supercomputer sorting benchmark Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (14-19)
  2696. ACM
    Devroye L Generation of random objects Proceedings of the 24th conference on Winter simulation, (270-279)
  2697. ACM
    Edelsbrunner H and Mücke E Three-dimensional alpha shapes Proceedings of the 1992 workshop on Volume visualization, (75-82)
  2698. Narayanan S, Gupta R and Breuer M Configuring multiple scan chains for minimum test time Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (4-8)
  2699. ACM
    Lippe E and van Oosterom N (1992). Operation-based merging, ACM SIGSOFT Software Engineering Notes, 17:5, (78-87), Online publication date: 1-Nov-1992.
  2700. ACM
    Lippe E and van Oosterom N Operation-based merging Proceedings of the fifth ACM SIGSOFT symposium on Software development environments, (78-87)
  2701. ACM
    Ramanathan S and Lloyd E (1992). Scheduling algorithms for multi-hop radio networks, ACM SIGCOMM Computer Communication Review, 22:4, (211-222), Online publication date: 1-Oct-1992.
  2702. ACM
    Ramanathan S and Lloyd E Scheduling algorithms for multi-hop radio networks Conference proceedings on Communications architectures & protocols, (211-222)
  2703. Moser W and Adlassnig K (1992). Consistency checking of binary categorical relationships in a medical knowledge base, Artificial Intelligence in Medicine, 4:5, (389-407), Online publication date: 1-Oct-1992.
  2704. Mitchell J and Suri S Separation and approximation of polyhedral objects Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (296-306)
  2705. Aharonson E and Attiya H Counting networks with arbitrary fan-out Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (104-113)
  2706. ACM
    Alt H and Godau M Measuring the resemblance of polygonal curves Proceedings of the eighth annual symposium on Computational geometry, (102-109)
  2707. ACM
    Edelsbrunner H and Tan T An upper bound for conforming Delaunay triangulations Proceedings of the eighth annual symposium on Computational geometry, (53-62)
  2708. ACM
    Klugerman M and Plaxton C Small-depth counting networks Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (417-428)
  2709. Edelsbrunner H, Tan T and Waupotitsch R (1992). An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation, SIAM Journal on Scientific and Statistical Computing, 13:4, (994-1008), Online publication date: 1-Jul-1992.
  2710. ACM
    Podgurski A and Pierce L Behavior sampling Proceedings of the 14th international conference on Software engineering, (349-361)
  2711. ACM
    Herlihy M, Lim B and Shavit N Low contention load balancing on large-scale multiprocessors Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, (219-227)
  2712. ACM
    Hightower W, Prins J and Reif J Implementations of randomized sorting on large parallel machines Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, (158-167)
  2713. ACM
    Stricker T Supporting the hypercube programming model on mesh architectures Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, (148-157)
  2714. ACM
    Gu J (1992). Efficient local search for very large-scale satisfiability problems, ACM SIGART Bulletin, 3:1, (8-12), Online publication date: 1-Jan-1992.
  2715. ACM
    Podgurski A Reliability, sampling, and algorithmic randomness Proceedings of the symposium on Testing, analysis, and verification, (11-20)
  2716. ACM
    Zagha M and Blelloch G Radix sort for vector multiprocessors Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (712-721)
  2717. ACM
    Dutt D and Lo C On minimal closure constraint generation for symbolic cell assembly Proceedings of the 28th ACM/IEEE Design Automation Conference, (736-739)
  2718. ACM
    Papaefthymiou M Understanding retiming through maximum average-weight cycles Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, (338-348)
  2719. ACM
    Blelloch G, Leiserson C, Maggs B, Plaxton C, Smith S and Zagha M A comparison of sorting algorithms for the connection machine CM-2 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, (3-16)
  2720. ACM
    Tokuyama T and Nakano J Geometric algorithms for a minimum cost assignment problem Proceedings of the seventh annual symposium on Computational geometry, (262-271)
  2721. ACM
    Roy S Semantic complexity of classes of relational queries and query independent data partitioning Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (259-267)
  2722. Cole R Tight bounds on the complexity of the Boyer-Moore string matching algorithm Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (224-233)
  2723. Dietz P and Raman R Persistence, amortization and randomization Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (78-88)
  2724. ACM
    Johnsonbaugh R and Kalin M (1991). A graph generation software package, ACM SIGCSE Bulletin, 23:1, (151-154), Online publication date: 1-Mar-1991.
  2725. ACM
    Johnsonbaugh R and Kalin M A graph generation software package Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (151-154)
  2726. ACM
    Aspnes J, Herlihy M and Shavit N Counting networks and multi-processor coordination Proceedings of the twenty-third annual ACM symposium on Theory of Computing, (348-358)
  2727. Sun X, Hashimoto K, Hamamoto S, Koizumi A, Matsuzawa T, Teramachi T and Takanishi A Trajectory generation for ladder climbing motion with separated path and time planning 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (5782-5788)
  2728. Tang Y, Cheung M and Lok T Trajectory Design for UAV Assisted Wireless Networks 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
  2729. Chang B, Zhao G, Chen Z, Li P and Li L D2D Transmission Scheme in URLLC Enabled Real-Time Wireless Control Systems for Tactile Internet 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
  2730. Hu X and Liao J Co-evolutionary path optimization by ripple-spreading algorithm 2016 IEEE Congress on Evolutionary Computation (CEC), (4535-4542)
  2731. Sun X, Hashimoto K, Koizumi A, Hamamoto S, Matsuzawa T, Teramachi T and Takanishi A Path-time independent trajectory planning of ladder climbing with shortest path length for a four-limbed robot 2016 6th IEEE International Conference on Biomedical Robotics and Biomechatronics (BioRob), (188-194)
  2732. Liu Z, Seo H, Sinha Roy S, Großschädl J, Kim H and Verbauwhede I Efficient Ring-LWE Encryption on 8-Bit AVR Processors Cryptographic Hardware and Embedded Systems -- CHES 2015, (663-682)
Contributors
  • Dartmouth College
  • Massachusetts Institute of Technology
  • MIT Computer Science & Artificial Intelligence Laboratory

Recommendations

Daniele Gardy

Each of the algorithms presented in this book includes pseudocode and an analysis of its running time. The authors say that “this book is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.” The book is bigger than most books on this subject and covers more topics. The emphasis is on algorithms and the analysis of their running time. The reader should have some programming experience and knowledge of simple data structures and some basic mathematics (elementary calculus and induction). Because of the wealth of subjects it presents, the book could be used to teach several types of introductory or advanced courses on algorithms. The book's 37 chapters are organized into seven parts. Part 1, “Mathematical Foundations,” presents the basic mathematical results needed for any theoretical study of an algorithm: growth of functions, summations, recurrences, sets, relations, graphs and trees, and basic probability theory. Part 2, “Sorting and Order Statistics,” presents three sorting algorithms—heapsort, quicksort, and radix sort—and then gives algorithms for finding the minimum and maximum of a set and for selection of the k th element. Part 3, “Data Structures,” deals with elementary structures: lists, hash tables, binary search trees, and red-black trees. It also includes a chapter on augmenting a data structure, which presents interval trees as an example. Part 4 covers “Advanced Design and Analysis Techniques.” The authors present three design techniques: dynamic programming, greedy algorithms (partially unified by the theory of matroids), and amortized analysis, which they see as “a way of thinking about the design of algorithms.” Part 5, “Advanced Data Structures,” contains data structures for representing disjoint sets and variations on trees (B-trees and binomial and Fibonacci heaps). Part 6, “Graph Algorithms,” begins with a chapter on the representation of graphs that covers elementary algorithms such as breadth-first and depth-first search. It then deals with classical algorithms for minimum spanning trees, shortest-path problems (single source and all pairs), and maximum flow. Each of the ten chapters in Part 7, “Selected Topics,” deals with a different subject. The authors cover sorting networks, arithmetic circuits, algorithms for parallel computers, matrix operations (including Strassen's algorithm for multiplication and systems of linear equations), polynomials and the fast Fourier transform, number-theoretic algorithms (such as GCD, primality testing, integer factorization, and the RSA cryptosystem), string matching, computational geometry (intersection of segments, convex hull, and closest pair of points), and an introduction to NP-completeness and approximation algorithms. Each chapter is followed by exercises and problems, which range from the simple to the complex. The index is quite detailed and the bibliography lists over 200 references, from classic books to unpublished reports. The bibliographic notes that follow the chapters give basic information, but are far from exhausting the field. The book contains many algorithms, some of which are in unexpected places. For example, the chapter on computational geometry does not present algorithms for triangulating a polygon; instead, the triangulation of a convex polygon is included in the chapter on dynamic programming. This odd arrangement is probably due to the large number of topics covered, which are organized in three different ways: by data structures, by design methods, and by types of problems. The choice of material presented differs from that of most books. This work is a good reference and should find its place among general textbooks on algorithms.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.