default search action

combined dblp search
author search
venue search
publication search

ask others

"Formally Analyzing Expected Time Complexity of Algorithms Using Theorem ..."

Osman Hasan, Sofiène Tahar (2010)

> Home

Details and statistics

DOI: 10.1007/S11390-010-9407-0

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcst/HasanT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/HasanT10
Osman Hasan, Sofiène Tahar:
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving. J. Comput. Sci. Technol. 25(6): 1305-1320 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.