The following pages link to Francine Berman (Q1156481):
Displaying 9 items.
- Propositional dynamic logic is weaker without tests (Q1156482) (← links)
- Representing graph families with edge grammars (Q1801468) (← links)
- Using moldability to improve the performance of supercomputer jobs (Q1867351) (← links)
- (Q3674630) (← links)
- Collections of Functions for Perfect Hashing (Q3719841) (← links)
- (Q3790619) (← links)
- (Q3956914) (← links)
- Semantics of looping programs in Propositional Dynamic Logic (Q3960666) (← links)
- USING STOCHASTIC INFORMATION TO PREDICT APPLICATION BEHAVIOR ON CONTENDED RESOURCES (Q5249262) (← links)
