LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Name
Royal Holloway Research
Type
Institutional Repository
Items
5053 Publications
Compatibility
OpenAIRE Basic (DRIVER OA)
OAI-PMH
http://repository.royalholloway.ac.uk/p/oai
More information
Detailed data provider information (OpenDOAR)

 

  • Historiography

    Napier, Christopher (2009)
    The chapter reviews various debates as to how best to undertake research in accounting history. It distinguishes "history of accounting" - where the object of research is accounting ideas, methods, organisations, etc. - from "socio-historical accounting research" - where the object of research is how accounting has impacted on individuals, organisations and society in the past.

    Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments

    Bang-Jensen, J.; Huang, J.; Yeo, A. (2004)
    Given a k-arc-strong tournament T, we estimate the minimum number of arcs possible in a k-arc-strong spanning subdigraph of T. We give a construction which shows that for each k 2, there are tournaments T on n vertices such that every k-arc-strong spanning subdigraph of T contains at least arcs. In fact, the tournaments in our construction have the property that every spanning subdigraph with minimum in- and out-degree at least k has arcs. This is best possible since it can be shown that e...

    Algebraic Precomputations in Differential and Integral Cryptanalysis

    Albrecht, Martin; Cid, Carlos; Dullien, Thomas; Faugere, Jean-Charles; Perret, Ludovic (2010)
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark