Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

S. Srinivasa Rao 0001

◀ ▶ joint publications with Jyrki Katajainen

> Home > Persons > S. Srinivasa Rao 0001

Publications

2014
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ElmasryJKS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ElmasryJKS14
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554: 64-73 (2014)
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ElmasryJKS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ElmasryJKS14
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. CoRR abs/1407.3342 (2014)
2013
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/ElmasryJKS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/ElmasryJKS13
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from Read-Only Memory with Limited Workspace. COCOON 2013: 147-157
2010
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/KatajainenR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/KatajainenR10
Jyrki Katajainen, S. Srinivasa Rao:
A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23): 1061-1066 (2010)

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.