The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Introduction to algorithms: 4. Turtle graphics
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1980) · Medical Entomology and Zoology · Cited by 7,534
Turtle Geometry: The Computer as a Medium for Exploring Mathematics
Abelson, H., & diSessa, A. (1981) · The MIT Press eBooks · doi:10.7551/mitpress/6933.001.0001 · Cited by 434
Turtle Geometry. The Computer as a Medium for Exploring Mathematics.
Francis, G. K., Abelson, H., & diSessa, A. (1983) · The American Mathematical Monthly · doi:10.2307/2975591 · Cited by 175
Cited by
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Automated generation and analysis of attack graphs
Sheyner, O., Haines, J., Jha, S., Lippmann, R., & Wing, J. M. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004377 · Cited by 1,293
Rethinking Attention with Performers
Choromanski, K., Likhosherstov, V., Dohan, D., Song, X., Gane, A., Sarlos, T., Hawkins, P., Davis, J., Mohiuddin, A., Kaiser, L., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.14794 · Cited by 695
Autism as a neural systems disorder: A theory of frontal-posterior underconnectivity
Just, M. A., Keller, T. A., Malave, V. L., Kana, R. K., & Varma, S. (2012) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2012.02.007 · Cited by 578
Wang, L., & Liu, H. (2006) · International Journal of Geographical Information Science · doi:10.1080/13658810500433453 · Cited by 506
Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment
Deng, Y., Chen, Y., Zhang, Y., & Mahadevan, S. (2012) · Applied Soft Computing · doi:10.1016/j.asoc.2011.11.011 · Cited by 466
GPUTeraSort: high performance graphics co-processor sorting for large database management
Govindaraju, N., Gray, J., Kumar, R., & Manocha, D. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142511 · Cited by 418
Multi-constrained optimal path selection
Korkmaz, T., & Krunz, M. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916274 · Cited by 399
Motion texture: a two-level statistical model for character motion synthesis
Li, Y., Wang, T., & Shum, H.-Y. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566604 · Cited by 392
DBSMOTE: Density-Based Synthetic Minority Over-sampling TEchnique
Bunkhumpornpat, C., Sinapiromsaran, K., & Lursinsap, C. (2012) · Applied Intelligence · doi:10.1007/s10489-011-0287-y · Cited by 390
Canhoto, A. I., & Clear, F. (2020) · Business Horizons · doi:10.1016/j.bushor.2019.11.003 · Cited by 375
TASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Eclipse Attacks on Overlay Networks: Threats and Defenses
Singh, A., Ngan, T.-W., Druschel, P., & Wallach, D. S. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.231 · Cited by 317
Security of public-key cryptosystems based on Chebyshev polynomials
Bergamo, P., D'Arco, P., De Santis, A., & Kocarev, L. (2005) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2005.851701 · Cited by 316
A survey of application-layer multicast protocols
Hosseini, M., Ahmed, D. T., Shirmohammadi, S., & Georganas, N. D. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317616 · Cited by 283
An End-to-End Neural Network for Polyphonic Piano Music Transcription
Sigtia, S., Benetos, E., & Dixon, S. (2016) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2016.2533858 · Cited by 280
Stability of persistence diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064133 · Cited by 251
A barcode shape descriptor for curve point cloud data
Collins, A., Zomorodian, A., Carlsson, G., & Guibas, L. J. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.015 · Cited by 132
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
Buluc, A., & Gilbert, J. R. (2008) · 2008 37th International Conference on Parallel Processing · doi:10.1109/icpp.2008.45 · Cited by 112
Toward an artificial intelligence physicist for unsupervised learning
Wu, T., & Tegmark, M. (2019) · Physical Review E · doi:10.1103/physreve.100.033311 · Cited by 99
“Our approach complements other work on automatic program learning, such as neural program synthesis/induction [7–12] and symbolic program induction [13– 17] and builds on prior machine-learning work on divide-and-conquer [18–20], network simplification [21–26] and continuous learning [27–30].”
MethodAutomated generation of control skeletons for use in animation
Wade, L., & Parent, R. E. (2002) · The Visual Computer · doi:10.1007/s003710100139 · Cited by 96
Towards Revealing the Mystery behind Chain of Thought: a Theoretical Perspective
Feng, G., Zhang, B., Gu, Y., Ye, H., He, D., & Wang, L. (2023) · arXiv · doi:10.48550/arxiv.2305.15408 · Cited by 69
“As examples, the longest increasing subsequence (LIS) and edit distance (ED) are two well-known DP problems presented in the “Introduction to Algorithms” book [14] (see Appendix F.”
BackgroundInfluentialEfficient computation of the shapley value for centrality in networks
Aadithya, K. V., Ravindran, B., Michalak, T. P., & Jennings, N. R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17572-5_1 · Cited by 59
Dominant Reaction Pathways by Quantum Computing
Hauke, P., Mattiotti, G., & Faccioli, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.028104 · Cited by 20
Graph-based terrain relative navigation with optimal landmark database selection
Steiner, T. J., Brady, T. M., & Hoffman, J. A. (2015) · 2015 IEEE Aerospace Conference · doi:10.1109/aero.2015.7119053 · Cited by 16
Private routing and ride-sharing using homomorphic encryption
Farokhi, F., Shames, I., & Johansson, K. H. (2020) · IET Cyber-Physical Systems: Theory & Applications · doi:10.1049/iet-cps.2019.0042 · Cited by 8
Metadata
- Authors
- Shyamasundar, R. K.
- Venue
- Resonance
- Published
- 1996-09
- Volume
- 1
- Issue
- 9
- Pages
- 14-24
- ISSN
- 0971-8044 (ISSN-L)
- 0973-712X
- OpenAlex
- W2946046356
- Cited by
- 1,467
- References
- 3
- FWCI
- 19.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.