The following pages link to Tiko Kameda (Q799129):
Displaying 24 items.
- Multi-version concurrency control scheme for a database system (Q799131) (← links)
- Searching a polygonal region by a group of stationary \(k\)-searchers (Q834883) (← links)
- A cautious scheduler for multistep transactions (Q1101210) (← links)
- File space utilization in database conversion (Q1108069) (← links)
- A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control (Q1208453) (← links)
- Simple bounds on the convergence rate of an ergodic Markov chain (Q1209327) (← links)
- Canonical cactus representation for miminum cuts (Q1343494) (← links)
- Max- and Min-neighborhood monopolies (Q1849375) (← links)
- Optimal amortized distributed consensus (Q1898481) (← links)
- (Q2722008) (← links)
- Transformations on Regular Nondominated Coteries and Their Applications (Q2753532) (← links)
- Cautious transaction schedulers with admission control (Q3685242) (← links)
- Design of Minimum-Cost Deadlock-Free Systems (Q3763583) (← links)
- How to learn an unknown environment. I (Q3841650) (← links)
- Testing Deadlock-Freedom of Computer Systems (Q3868745) (← links)
- An improved third normal form for relational databases (Q3907124) (← links)
- (Q4331290) (← links)
- A Study on <i>r</i>-Configurations---A Resource Assignment Problem on Graphs (Q4490782) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- (Q4703444) (← links)
- (Q4767210) (← links)
- Efficient generation of all regular non-dominated coteries (Q5176789) (← links)
- CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK (Q5284939) (← links)
- A resource assignment problem on graphs (Q6487990) (← links)
