The following pages link to Desh Ranjan (Q293363):
Displaying 35 items.
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- Upper and lower I/O bounds for pebbling \(r\)-pyramids (Q450538) (← links)
- Improving known solutions is hard (Q687508) (← links)
- (Q818120) (redirect page) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- The Level-Ancestor problem on pure pointer machines (Q1007543) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- A tool for the analysis of manipulation (Q1209335) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Space-filling curves and their use in the design of geometric data structures (Q1391294) (← links)
- Data structures for order-sensitive predicates in parallel nondeterministic systems (Q1581897) (← links)
- The temporal precedence problem (Q1587780) (← links)
- A simple optimal solution for the temporal precedence problem on pure pointer machines (Q1764426) (← links)
- Identity orientation of complete bipartite graphs (Q1772415) (← links)
- An optimal data structure to handle dynamic environments in non-deterministic computations (Q1869983) (← links)
- Upper and Lower I/O Bounds for Pebbling r-Pyramids (Q3000499) (← links)
- (Q3044332) (← links)
- An Optimal Algorithm for Finding NCA on Pure Pointer Machines (Q3046520) (← links)
- Strong I/O Lower Bounds for Binomial and FFT Computation Graphs (Q3087945) (← links)
- Positive Influence and Negative Dependence (Q3429739) (← links)
- (Q3975135) (← links)
- (Q4005200) (← links)
- (Q4036579) (← links)
- (Q4268460) (← links)
- (Q4506393) (← links)
- Balls and bins: A study in negative dependence (Q4705326) (← links)
- (Q4712652) (← links)
- VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH (Q4902887) (← links)
- Structural complexity theory: Recent surprises (Q5056087) (← links)
- Space filling curves and their use in the design of geometric data structures (Q5096322) (← links)
- On the complexity of incremental computation (Q5096828) (← links)
- Logic Programming (Q5191490) (← links)
- Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees (Q5387831) (← links)
