Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Rosenberg, Burton - Department of Computer Science, University of Miami
1. Introduction This paper presents a survey of research in NC computable functions. The class NC is "the class of
Simplex Range Reporting on a Pointer Machine Bernard Chazelle
Simplex Range Reporting on a Pointer Machine Bernard Chazelle
Computing Partial Sums in Multidimensional Arrays (Detailed Abstract)
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
The Web Learning Pages Burton Rosenberg
Simulating a stack by queues Burton Rosenberg
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
A secretary problem with two decision makers Robert W. Chen, University of Miami
On the first occurrence of strings Robert W. Chen
Optimal exercise of russian options in the binomial model
Inferring model parameters in markets with Robert W. Chen1
Inferring model parameters in markets with collars (full paper)
Fast nondeterministic recognition of context-free languages using two queues
A secretary problem with two decision makers Robert W. Chen, University of Miami
Fast nondeterministic recognition of context-free languages using two queues
