Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Richard F. Geary

> Home > Persons

Person information

affiliation: University of Leicester, UK

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2006
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/GearyRR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/GearyRR06
Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2(4): 510-534 (2006)
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/GearyRRR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GearyRRR06
Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3): 231-246 (2006)
2004
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cpm/GearyRRR04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/GearyRRR04
Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses. CPM 2004: 159-172
[c1]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/GearyRR04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GearyRR04
Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. SODA 2004: 1-10

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.