BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × Canada
1 × Cyprus
1 × Czech Republic
1 × Finland
1 × Germany
1 × Italy
1 × Japan
1 × Portugal
1 × Switzerland
1 × USA
Collaborated with:
I.V.Ramakrishnan ∅ M.Rusinowitch S.Blackshear W.Yu S.Behl S.Senanayake P.Narendran D.Lugiez R.Ramesh K.Thirunarayan S.Basu M.Mukund C.R.Ramakrishnan
Talks about:
sup (4) rewrit (3) term (3) constraint (2) algorithm (2) parallel (2) automata (2) program (2) visual (2) system (2)

Person: Rakesh M. Verma

DBLP DBLP: Verma:Rakesh_M=

Contributed to:

SAC 20102010
SAC 20082008
ITiCSE 20052005
SIGIR 20022002
ICLP 20012001
RTA 19991999
CSL 19981998
RTA 19981998
RTA 19931993
ICALP 19901990
CADE 19881988
ICALP 19871987

Wrote 12 papers:

SAC-2010-BlackshearV
R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks (SB, RMV), pp. 1985–1992.
SAC-2008-YuV #programming #rule-based #visualisation
Visualization of rule-based programming (WY, RMV), pp. 1258–1259.
ITiCSE-2005-Verma #automaton #interactive #visual notation
A visual and interactive automata theory course emphasizing breadth of automata (RMV), pp. 325–329.
SIGIR-2002-VermaB #named #performance #query
K-tree/forest: efficient indexes for boolean queries (RMV, SB), pp. 433–434.
ICLP-2001-BasuMRRV #bisimulation #constraints #logic programming #using
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming (SB, MM, CRR, IVR, RMV), pp. 166–180.
RTA-1999-VermaS #agile #graph grammar #named
LarrowR2: A Laboratory fro Rapid Term Graph Rewriting (RMV, SS), pp. 252–255.
CSL-1998-NarendranRV #constraints #theorem proving
RPO Constraint Solving Is in NP (PN, MR, RMV), pp. 385–398.
RTA-1998-VermaRL #algorithm #problem #reduction
Algorithms and Reductions for Rewriting Problems (RMV, MR, DL), pp. 166–180.
RTA-1993-Verma #equation #named
Smaran: A Congruence-Closure Based System for Equational Computations (RMV), pp. 457–461.
ICALP-1990-VermaR #algorithm #normalisation #term rewriting
Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems (RMV, IVR), pp. 370–385.
CADE-1988-VermaR #bound #parallel
Optimal Time Bounds for Parallel Term Matching (RMV, IVR), pp. 694–703.
ICALP-1987-RameshVKR #parallel
Term Matching on Parallel Computers (RR, RMV, KT, IVR), pp. 336–346.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.