Complexitate în timp (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Complexitate în timp" in Romanian language version.

refsWebsite
Global rank Romanian rank
2nd place
3rd place
741st place
687th place

doi.org

  • Mehlhorn, Kurt; Naher, Stefan (). „Bounded ordered dictionaries in O(log log N) time and O(n) space”. Information Processing Letters. 35 (4): 183–189. doi:10.1016/0020-0190(90)90022-P. 
  • Kumar, Ravi; Rubinfeld, Ronitt (). „Sublinear time algorithms” (PDF). SIGACT News. 34 (4): 57–67. doi:10.1145/954092.954103. 

princeton.edu

cs.princeton.edu