2008 |
38 | EE | Kenneth J. Goldman,
Paul Gross,
Cinda Heeren,
Geoffrey Herman,
Lisa C. Kaczmarczyk,
Michael C. Loui,
Craig B. Zilles:
Identifying important and difficult concepts in introductory computing courses using a delphi process: selective compression of unicode arrays in java.
SIGCSE 2008: 256-260 |
37 | EE | Michael C. Loui,
Keith W. Miller:
Ethics and Professional Responsibility in Computing.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
2006 |
36 | EE | Sung-il Pae,
Michael C. Loui:
Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution.
IEEE Transactions on Information Theory 52(11): 4965-4976 (2006) |
2005 |
35 | EE | Sung-il Pae,
Michael C. Loui:
Optimal random number generation from a biased coin.
SODA 2005: 1079-1088 |
2004 |
34 | EE | Ryan Chmiel,
Michael C. Loui:
Debugging: from novice to expert.
SIGCSE 2004: 17-21 |
2001 |
33 | EE | B. Das,
Michael C. Loui:
Reconstructing a Minimum Spanning Tree after Deletion of Any Node.
Algorithmica 31(4): 530-547 (2001) |
1998 |
32 | EE | Daniel Lin,
Michael C. Loui:
Taking the byte out of cookies: privacy, consent, and the Web.
ACM Policy 1998: 39-51 |
1997 |
31 | | Michael C. Loui:
Complexity Theory.
The Computer Science and Engineering Handbook 1997: 250-276 |
1996 |
30 | | Michael C. Loui:
Computational Complexity Theory.
ACM Comput. Surv. 28(1): 47-49 (1996) |
29 | | Michael C. Loui:
Strategic Directions in Research in Theory of Computing.
ACM Comput. Surv. 28(4): 575-590 (1996) |
1995 |
28 | EE | Erini Doss,
Michael C. Loui:
Ethics and the Privacy of Electronic Mail.
Inf. Soc. 11(3): (1995) |
1994 |
27 | | Nancy M. Amato,
Michael C. Loui:
Checking Linked Data Structures.
FTCS 1994: 164-173 |
26 | | Jerry L. Trahan,
Vijaya Ramachandran,
Michael C. Loui:
Parallel Random Access Machines with both Multiplication and Shifts
Inf. Comput. 110(1): 96-118 (1994) |
1993 |
25 | | James E. Burns,
Rolando I. Cruz,
Michael C. Loui:
Generalized Agreement Between Concurrent Fail-Stop Processes.
WDAG 1993: 84-98 |
24 | | David R. Luginbuhl,
Michael C. Loui:
Hierarchies and Space Measures for Pointer Machines
Inf. Comput. 104(2): 253-270 (1993) |
1992 |
23 | | Michael C. Loui,
David R. Luginbuhl:
The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines.
Mathematical Systems Theory 25(4): 293-308 (1992) |
22 | | Michael C. Loui,
David R. Luginbuhl:
Optimal On-Line Simulations of Tree Machines by Random Access Machines.
SIAM J. Comput. 21(5): 959-971 (1992) |
21 | | Jerry L. Trahan,
Michael C. Loui,
Vijaya Ramachandran:
Multiplication, Division and Shift Instructions in Parallel Random Access Machines.
Theor. Comput. Sci. 100(1): 1-44 (1992) |
1990 |
20 | | Michael M. Wu,
Michael C. Loui:
An Efficient Distributed Algorithm for Maximum Matching in General Graphs.
Algorithmica 5(3): 383-406 (1990) |
19 | | Michael C. Loui,
Milind A. Sohoni:
An Algorithm for Load Balancing in Multiprocessor Systems.
Inf. Process. Lett. 35(5): 223-228 (1990) |
1989 |
18 | | Jerry L. Trahan,
Michael C. Loui,
Vijaya Ramachandran:
The Power of Parallel Random Access Machines with Augmented Instruction Sets.
Structure in Complexity Theory Conference 1989: 97-103 |
1988 |
17 | | Paul A. Peterson,
Michael C. Loui:
The General Maximum Matching Algorithm of Micali and Vazirani.
Algorithmica 3: 511-533 (1988) |
16 | | Michael C. Loui,
Teresa A. Matsushita,
Douglas B. West:
Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett. 28(6): 327 (1988) |
15 | | A. Scottedward Hodel,
Michael C. Loui:
Optimal Dynamic Embedding of X-Trees Into Arrays.
Theor. Comput. Sci. 59: 259-276 (1988) |
1987 |
14 | | Alan M. Schwartz,
Michael C. Loui:
Dictionary Machines on Cube-Class Networks.
IEEE Trans. Computers 36(1): 100-105 (1987) |
1986 |
13 | | Michael C. Loui,
Teresa A. Matsushita,
Douglas B. West:
Election in a Complete Network with a Sense of Direction.
Inf. Process. Lett. 22(4): 185-187 (1986) |
12 | | Joseph Y. Halpern,
Michael C. Loui,
Albert R. Meyer,
Daniel Weise:
On Time versus Space III.
Mathematical Systems Theory 19(1): 13-28 (1986) |
1985 |
11 | | Alan M. Schwartz,
Michael C. Loui:
Dictionary Machines on Cube-Class Networks.
ICPP 1985: 210-216 |
10 | | Errol L. Lloyd,
Michael C. Loui:
On the Worst Case Performance of Buddy Systems.
Acta Inf. 22(4): 451-473 (1985) |
1984 |
9 | | Michael C. Loui:
The Complexity of Sorting on Distributed Systems
Information and Control 60(1-3): 70-85 (1984) |
8 | | Michael C. Loui:
Minimizing Access Pointers into Trees and Arrays.
J. Comput. Syst. Sci. 28(3): 359-378 (1984) |
1983 |
7 | | Michael C. Loui:
Optimal Dynamic Embedding of Trees into Arrays.
SIAM J. Comput. 12(3): 463-472 (1983) |
1982 |
6 | | Michael C. Loui:
Simulations Among Multidimensional Turing Machines.
Theor. Comput. Sci. 21: 145-161 (1982) |
1981 |
5 | | Michael C. Loui:
Simulations among Multidimensional Turing Machines (Preliminary Version)
FOCS 1981: 58-67 |
4 | | Leonard M. Adleman,
Michael C. Loui:
Space-Bounded Simulation of Multitape Turing Machines.
Mathematical Systems Theory 14: 215-222 (1981) |
3 | | Michael C. Loui:
A Space Bound for One-Tape Multidimensional Turing Machines.
Theor. Comput. Sci. 15: 311-320 (1981) |
1980 |
2 | | Michael C. Loui:
A Note on the Pebble Game.
Inf. Process. Lett. 11(1): 24-26 (1980) |
1976 |
1 | | Michael C. Loui:
Weighted Derivation Trees.
Commun. ACM 19(9): 509-513 (1976) |