| 2007 |
24 | | A. Palagin,
N. Alishov,
George Markowsky,
Anatoly Sachenko,
Volodymyr Turchenko:
Security Tools for GRID- Systems.
Security and Management 2007: 467-473 |
23 | | George Markowsky,
Linda Markowsky:
Survey of Supercomputer Cluster Security Issues.
Security and Management 2007: 474-480 |
22 | | George Markowsky:
RF Eavesdropping Beowulf Clusters.
Security and Management 2007: 481-488 |
| 2004 |
21 | | Iryna V. Turchenko,
Volodymyr Turchenko,
Volodymyr Kochan,
Pavlo E. Bykovy,
Anatoly Sachenko,
George Markowsky:
Database design for CAD system optimising distributed sensor networks for perimeter security.
IASTED Conf. on Software Engineering and Applications 2004: 59-64 |
| 1996 |
20 | | George Markowsky:
Introduction To Algorithmic Information Theory.
J. UCS 2(5): 245-299 (1996) |
| 1991 |
19 | | George Markowsky:
Bounding fault detection probabilities in combinational circuits.
J. Electronic Testing 2(4): 315-323 (1991) |
| 1988 |
18 | | Alfredo De Santis,
George Markowsky,
Mark N. Wegman:
Learning Probabilistic Prediction Functions.
COLT 1988: 312-328 |
17 | | Alfredo De Santis,
George Markowsky,
Mark N. Wegman:
Learning Probabilistic Prediction Functions (Extended Abstract)
FOCS 1988: 110-119 |
| 1987 |
16 | | George Markowsky:
Bounding Signal Probabilities in Combinational Circuits.
IEEE Trans. Computers 36(10): 1247-1251 (1987) |
| 1983 |
15 | | Ashok K. Chandra,
Lawrence T. Kou,
George Markowsky,
Shmuel Zaks:
On Sets of Boolean n -Projections Surjective.
Acta Inf. 20: 103-111 (1983) |
| 1981 |
14 | | Zeev Barzilai,
Jacob Savir,
George Markowsky,
Merlin G. Smith:
VLSI Self-Testing Based on Syndrome Techniques.
ITC 1981: 102-109 |
13 | | Lawrence T. Kou,
George Markowsky,
Leonard Berman:
A Fast Algorithm for Steiner Trees.
Acta Inf. 15: 141-145 (1981) |
12 | | George Markowsky:
Best Huffman Trees.
Acta Inf. 16: 363-370 (1981) |
11 | | Zeev Barzilai,
Jacob Savir,
George Markowsky,
Merlin G. Smith:
The Weighted Syndrome Sums Approach to VLSI Testing.
IEEE Trans. Computers 30(12): 996-1000 (1981) |
10 | | George Markowsky:
Syndrome-Testability Can be Achieved by Circuit Modification.
IEEE Trans. Computers 30(8): 604-606 (1981) |
| 1980 |
9 | | Shu Lin,
George Markowsky:
On a Class of One-Step Majority-Logic Decodable Cyclic Codes.
IBM Journal of Research and Development 24(1): 56-63 (1980) |
| 1979 |
8 | | George Markowsky:
Diagnosing Single Faults in Fanout-Free Combinational Circuits.
IEEE Trans. Computers 28(11): 863-864 (1979) |
7 | | H. Raymond Strong,
George Markowsky,
Ashok K. Chandra:
Search within a Page.
J. ACM 26(3): 457-482 (1979) |
| 1978 |
6 | | George Markowsky,
Larry Carter,
Mark N. Wegman:
Analysis of a Universal Class of Hash Functions.
MFCS 1978: 345-354 |
5 | | Larry Carter,
Robert W. Floyd,
John Gill,
George Markowsky,
Mark N. Wegman:
Exact and Approximate Membership Testers
STOC 1978: 59-65 |
4 | | H. Raymond Strong,
Irving L. Traiger,
George Markowsky:
Slide Search.
IBM Research Report RJ2274: (1978) |
| 1977 |
3 | | Lawrence T. Kou,
George Markowsky:
Multidimensional Bin Packing Algorithms.
IBM Journal of Research and Development 21(5): 443-448 (1977) |
2 | | George Markowsky:
Categories of Chain-Complete Posets.
Theor. Comput. Sci. 4(2): 125-135 (1977) |
| 1975 |
1 | | George Markowsky,
Barry K. Rosen:
Bases for Chain-Complete Posets
FOCS 1975: 34-47 |