Skip header Section
Skip Bibliometrics Section
Computer Algorithms: C++May 1996
Abstract
No abstract available.
Cited By
- Yang Y, Zhu S and Cao G (2016). Improving sensor network immunity under worm attacks, Ad Hoc Networks, 47:C, (26-40), Online publication date: 1-Sep-2016.
- Verma M and Shukla K (2015). Application of fuzzy optimization to the orienteering problem, Advances in Fuzzy Systems, 2015, (8-8), Online publication date: 1-Jan-2015.
- Yerion K (2012). Alan Turing, animal spots, and algorithms, Journal of Computing Sciences in Colleges, 28:1, (169-176), Online publication date: 1-Oct-2012.
- Zuo Y (2008). Prompt damage identification for system survivability, International Journal of Information and Computer Security, 2:4, (411-433), Online publication date: 1-Jan-2009.
- Yang Y, Zhu S and Cao G Improving sensor network immunity under worm attacks Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, (149-158)
- Sheu P and Chen S (2007). On the Hardness of Approximating the Multicast Delay Variation Problem, IEEE Transactions on Computers, 56:11, (1575-1577), Online publication date: 1-Nov-2007.
- Chowdhury R and Ramachandran V Cache-oblivious dynamic programming Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (591-600)
- Weigang L and Fracari Branco V (2018). A web information system for determining the controllers of financial entities in central bank of Brazil, Web Intelligence and Agent Systems, 4:1, (99-116), Online publication date: 1-Jan-2006.
- 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.
- Rajasekaran S (2005). Efficient Parallel Hierarchical Clustering Algorithms, IEEE Transactions on Parallel and Distributed Systems, 16:6, (497-502), Online publication date: 1-Jun-2005.
- Liu S, Bryant B, Gray J, Raje R, Olson A and Auguston M Two-level assurance of QoS requirements for distributed real-time and embedded systems Proceedings of the 2005 ACM symposium on Applied computing, (903-904)
- Eu Jan G and Lin M (2005). Concentration, load balancing, partial permutation routing, and superconcentration on cube-connected cycles parallel computers, Journal of Parallel and Distributed Computing, 65:12, (1471-1482), Online publication date: 1-Dec-2005.
- Rajasekaran S and Davila J (2005). Packet routing and selection on the POPS network, Journal of Parallel and Distributed Computing, 65:8, (927-933), Online publication date: 1-Aug-2005.
- Lee S, Ho H and Mai W (2019). An Efficient Scheduling Algorithm for Information Delivery on VoD System, The Journal of Supercomputing, 28:1, (27-41), Online publication date: 1-Apr-2004.
- 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.
- Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J and Toussaint G (2004). Space-efficient planar convex hull algorithms, Theoretical Computer Science, 321:1, (25-40), Online publication date: 16-Jun-2004.
- Sequeira K, Zaki M, Szymanski B and Carothers C Improving spatial locality of programs via data mining Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, (649-654)
- Venkataraman G, Sahni S and Mukhopadhyaya S (2018). A blocked all-pairs shortest-paths algorithm, Journal of Experimental Algorithmics (JEA), 8, (2.2-es), Online publication date: 31-Dec-2004.
- Horowitz E Algorithms, design and classification of Encyclopedia of Computer Science, (45-51)
- Branco V, Weigang L, Abad M and Denzinger J An algorithm for determining the controllers of supervised entities at the first and second levels Proceedings of the 2003 international conference on Computational science and its applications: PartIII, (148-157)
- Kwon T, Choi Y and Das S (2019). Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks, Wireless Personal Communications: An International Journal, 22:3, (337-357), Online publication date: 1-Sep-2002.
- Levitin A and Papalaskari M Using puzzles in teaching algorithms Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (292-296)
- Levitin A and Papalaskari M (2002). Using puzzles in teaching algorithms, ACM SIGCSE Bulletin, 34:1, (292-296), Online publication date: 1-Mar-2002.
- Rajasekaran S Sorting and selection on parallel disk models Handbook of massive data sets, (875-892)
- Levitin A Design and analysis of algorithms reconsidered Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, (16-20)
- Levitin A (2000). Design and analysis of algorithms reconsidered, ACM SIGCSE Bulletin, 32:1, (16-20), Online publication date: 1-Mar-2000.
- Levitin A Do we teach the right algorithm design techniques? The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (179-183)
- Kwon T, Park I, Choi Y and Das S Bandwidth adaption algorithms with multi-objectives for adaptive multimedia services in wireless/mobile networks Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia, (51-59)
- Levitin A (1999). Do we teach the right algorithm design techniques?, ACM SIGCSE Bulletin, 31:1, (179-183), Online publication date: 1-Mar-1999.
- Rajasekaran S and Sahni S (1998). Randomized Routing, Selection, and Sorting on the OTIS-Mesh, IEEE Transactions on Parallel and Distributed Systems, 9:9, (833-840), Online publication date: 1-Sep-1998.
- Rajasekaran S and Wei D Designing Efficient Distributed Algorithms Using Sampling Techniques Proceedings of the 11th International Symposium on Parallel Processing, (397-401)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Designing Computer Games to Teach Algorithms
ITNG '10: Proceedings of the 2010 Seventh International Conference on Information Technology: New GenerationsData structures and algorithms are important foundation topics in computer science education. However, they are often complex and hard to understand. Therefore, we introduce a new learning strategy that benefits from computer games’ popularity and ...
Careers in computer graphics
Information is unquestionably today's most important commodity. Computer graphics, as a means of expressing that information, now appears in virtually every application area. When we began gathering information for this article, we intended to describe ...