Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Martin Crane

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Tai Tan Mai

> Home > Persons > Martin Crane

Publications

2023
[j24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/MaiCB23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/MaiCB23
Tai Tan Mai, Martin Crane, Marija Bezbradica:
Students' Learning Behaviour in Programming Education Analysis: Insights from Entropy and Community Detection. Entropy 25(8): 1225 (2023)
2022
[j23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/NguyenMBC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/NguyenMBC22
An Pham Ngoc Nguyen, Tai Tan Mai, Marija Bezbradica, Martin Crane:
The Cryptocurrency Market in Transition before and after COVID-19: An Opportunity for Investors? Entropy 24(9): 1317 (2022)
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/MaiBC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/MaiBC22
Tai Tan Mai, Marija Bezbradica, Martin Crane:
Learning behaviours data in programming education: Community analysis and outcome prediction with cleaned data. Future Gener. Comput. Syst. 127: 42-55 (2022)

a service of

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.