Seymour Ginsburg

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
1999
104Automatic Data Restructuring. Seymour Ginsburg, Nan C. Shu, Dan A. Simovici. J. UCS (5): 243-286 (1999). Web SearchBibTeXDownload
1998
103Regular Sequence Operations and Their Use in Database Queries. Seymour Ginsburg, Xiaoyang Sean Wang. J. Comput. Syst. Sci. (56): 1-26 (1998). Web SearchBibTeXDownload
1995
102On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components. Guozhu Dong, Seymour Ginsburg. J. Log. Program. (23): 203-236 (1995). Web SearchBibTeXDownload
101Interval Queries on Object Histories. Seymour Ginsburg, Katsumi Tanaka. Theor. Comput. Sci. (145): 291-316 (1995). Cited by 10Web SearchBibTeXDownload
1993
100Content-Related Interval Queries on Object Histories. Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang. Inf. Comput. (103): 30-67 (1993). Web SearchBibTeXDownload
99Object and Spreadsheet Histories. Seymour Ginsburg. Temporal Databases 1993, 271-293. Web SearchBibTeX
1992
98Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. Seymour Ginsburg, Xiaoyang Sean Wang. PODS 1992, 293-300. Cited by 54Web SearchBibTeX
1991
97Localizable Constraints for Object Histories. Guozhu Dong, Seymour Ginsburg. Theor. Comput. Sci. (90): 391-432 (1991). Web SearchBibTeX
1990
96Input-Dependent-Only Object Histories. Seymour Ginsburg, Dan Tian. J. Comput. Syst. Sci. (40): 346-375 (1990). Web SearchBibTeXDownload
95On the Decomposition of Datalog Program Mappings. Guozhu Dong, Seymour Ginsburg. Theor. Comput. Sci. (76): 143-177 (1990). Web SearchBibTeXDownload
1989
94Decision Problems of Object histories. Yongkyun Cho, Seymour Ginsburg. Inf. Comput. (83): 245-263 (1989). Web SearchBibTeXDownload
93Cohesion of Object Histories. Seymour Ginsburg, Chang-jie Tang. Theor. Comput. Sci. (63): 63-90 (1989). Web SearchBibTeXDownload
1988
92Object-History and Spreadsheet P-Simulation. Seymour Ginsburg, Stephen Kurtzman. ICDT 1988, 383-395. Web SearchBibTeXDownload
1987
91Object Histories Which Avoid Certain Subsequences. Seymour Ginsburg, Marc Gyssens. Inf. Comput. (73): 174-206 (1987). Web SearchBibTeXDownload
90Canonical Forms for Interval Functions. Seymour Ginsburg, Chang-jie Tang. Theor. Comput. Sci. (54): 299-313 (1987). Web SearchBibTeXDownload
1986
89Computation-Tuple Sequences and Object Histories. Seymour Ginsburg, Katsumi Tanaka. ACM Trans. Database Syst. (11): 186-212 (1986). Cited by 19Web SearchBibTeXDownload
88Tuple sequences and lexicographic indexes. Serge Abiteboul, Seymour Ginsburg. J. ACM (33): 409-422 (1986). Cited by 11Web SearchBibTeXDownload
87Sort sets in the relational model. Seymour Ginsburg, Richard Hull. J. ACM (33): 465-488 (1986). Cited by 24Web SearchBibTeXDownload
86Projection of Object Histories. Seymour Ginsburg, Chang-jie Tang. Theor. Comput. Sci. (48): 297-328 (1986). Web SearchBibTeXDownload
85Localizable Constraints for Object Histories. Guozhu Dong, Seymour Ginsburg. XP7.52 Workshop on Database Theory 1986. Web SearchBibTeX
84Cohesion of Object Histories. Seymour Ginsburg, Chang-jie Tang. XP7.52 Workshop on Database Theory 1986. Web SearchBibTeX
1985
83Computation-Tuple Sequences and Object Histories: Extended Abstract. Seymour Ginsburg, Katsumi Tanaka. FODO 1985, 333-343. Web SearchBibTeX
82Projection of Object Histories. Seymour Ginsburg, Chang-jie Tang. FODO 1985, 345-358. Web SearchBibTeX
81On Completing Tables to Satisfy Functional Dependencies. Seymour Ginsburg, Edwin H. Spanier. Theor. Comput. Sci. (39): 309-317 (1985). Web SearchBibTeXDownload
1984
80Tuple Sequences and Indexes. Serge Abiteboul, Seymour Ginsburg. ICALP 1984, 41-50. Web SearchBibTeXDownload
79Interval Queries on Object Histories: Extended Abstract. Seymour Ginsburg, Katsumi Tanaka. VLDB 1984, 208-217. Web SearchBibTeX
1983
78On the Equality of Grammatical Families. Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier. J. Comput. Syst. Sci. (26): 171-196 (1983). Web SearchBibTeXDownload
77Sort Sets in the Relational Model. Seymour Ginsburg, Richard Hull. PODS 1983, 332-339. Web SearchBibTeX
76Order Dependency in the Relational Model. Seymour Ginsburg, Richard Hull. Theor. Comput. Sci. (26): 149-195 (1983). Cited by 44Web SearchBibTeXDownload
75Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. Seymour Ginsburg, Richard Hull. Theor. Comput. Sci. (26): 243-286 (1983). Web SearchBibTeXDownload
1982
74Properties of functional-dependency families. Seymour Ginsburg, Sami Mohammed Zaiddan. J. ACM (29): 678-698 (1982). Web SearchBibTeXDownload
73A Prime Decomposition Theorem for Grammatical Families. Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier. J. Comput. Syst. Sci. (24): 315-361 (1982). Web SearchBibTeXDownload
72Position-Restricted Grammar Forms and Grammars. Meera Blattner, Seymour Ginsburg. Theor. Comput. Sci. (17): 1-27 (1982). Web SearchBibTeXDownload
1981
71Strict Interpretations of Deterministic Pushdown Acceptors. Seymour Ginsburg, Chandra M. R. Kintala. Mathematical Systems Theory (14): 229-240 (1981). Web SearchBibTeXDownload
70Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. Seymour Ginsburg, Richard Hull. XP2 Workshop on Relational Database Theory 1981. Cited by 10Web SearchBibTeX
69Ordered Attribute Domains in the Relational Model. Seymour Ginsburg, Richard Hull. XP2 Workshop on Relational Database Theory 1981. Cited by 5Web SearchBibTeX
1979
68On Strict Interpretations of Grammar Forms. Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke. Mathematical Systems Theory (12): 233-252 (1979). Web SearchBibTeXDownload
1978
67Precedence Relations in Grammar Forms. Seymour Ginsburg, Derick Wood. Acta Inf. (11): 79-88 (1978). Web SearchBibTeXDownload
66Dynamic Syntax Specification Using Grammar Forms. Seymour Ginsburg, Erica M. Rounds. IEEE Trans. Software Eng. (4): 44-55 (1978). Web SearchBibTeXDownload
1977
65A survey of grammar forms - 1977. Seymour Ginsburg. Acta Cybern. (3): 269-280 (1977). Web SearchBibTeX
64Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. Meera Blattner, Seymour Ginsburg. FCT 1977, 49-53. Web SearchBibTeXDownload
63The Structure of Context-Free Grammatical Families. Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier. J. Comput. Syst. Sci. (15): 262-279 (1977). Web SearchBibTeXDownload
62Derivation Complexity in Context-Free Grammar Forms. Seymour Ginsburg, Nancy A. Lynch. SIAM J. Comput. (6): 123-138 (1977). Web SearchBibTeXDownload
61Pushdown Acceptor Forms. Seymour Ginsburg, Edwin H. Spanier. Theor. Comput. Sci. (5): 307-320 (1977). Web SearchBibTeXDownload
1976
60On strongly equivalent context-free grammar forms. Seymour Ginsburg, Hermann A. Maurer. Computing (16): 281-290 (1976). Web SearchBibTeXDownload
59Size complexity in context-free grammars forms. Seymour Ginsburg, Nancy A. Lynch. J. ACM (23): 582-598 (1976). Web SearchBibTeXDownload
58On Strict Interpretations of Grammar Forms. Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke. MFCS 1976, 294-298. Web SearchBibTeXDownload
57Some Uniformly Erasable Families of Languages. Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. Theor. Comput. Sci. (2): 29-44 (1976). Web SearchBibTeXDownload
1975
56Substitution of Grammar Forms. Seymour Ginsburg, Edwin H. Spanier. Acta Inf. (5): 377-386 (1975). Web SearchBibTeXDownload
55TOL Schemes and Control Sets. Seymour Ginsburg, Grzegorz Rozenberg. Information and Control (27): 109-125 (1975). Web SearchBibTeXDownload
54Uniformly Erasable AFL. Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. J. Comput. Syst. Sci. (10): 165-182 (1975). Web SearchBibTeXDownload
53Context-Free Grammar Forms. Armin B. Cremers, Seymour Ginsburg. J. Comput. Syst. Sci. (11): 86-117 (1975). Web SearchBibTeXDownload
52Comparative Complexity of Grammar Forms. Seymour Ginsburg, Nancy A. Lynch. STOC 1975, 153-158. Web SearchBibTeXDownload
1974
51Context-Free Grammar Forms. Armin B. Cremers, Seymour Ginsburg. ICALP 1974, 364-382. Web SearchBibTeXDownload
50On the Periodicity of Word-Length in DOL Languages. Seymour Ginsburg, Branislav Rovan. Information and Control (26): 34-44 (1974). Web SearchBibTeXDownload
49Grammar Schemata. Armen Gabrielian, Seymour Ginsburg. J. ACM (21): 213-226 (1974). Web SearchBibTeXDownload
48On Incomparable Abstract Family of Languages (AFL). Seymour Ginsburg, Edwin H. Spanier. J. Comput. Syst. Sci. (9): 88-108 (1974). Web SearchBibTeXDownload
47The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. Seymour Ginsburg, Gene F. Rose. J. Comput. Syst. Sci. (8): 243-269 (1974). Web SearchBibTeXDownload
46Characterization of Context-Free Grammatical Families. Armin B. Cremers, Seymour Ginsburg. SWAT (FOCS) 1974, 199-204. Web SearchBibTeXDownload
1973
45Intersection-Closed Full AFL and the Recursively Enumerable Languages. Seymour Ginsburg, Jonathan Goldstine. Information and Control (22): 201-231 (1973). Web SearchBibTeXDownload
44On AFL Generators for Finitely Encoded AFA. Seymour Ginsburg, Sheila A. Greibach. J. Comput. Syst. Sci. (7): 1-27 (1973). Web SearchBibTeXDownload
43Substitution and (Semi-)AFL. Seymour Ginsburg. MFCS 1973, 65-69. Web SearchBibTeX
1972
42Structured-Storage AFA (Abstract). Armen Gabrielian, Seymour Ginsburg. Formal Aspects of Cognitive Processes 1972, 70-71. Web SearchBibTeXDownload
41Multitape AFA. Seymour Ginsburg, Sheila A. Greibach. J. ACM (19): 193-221 (1972). Web SearchBibTeXDownload
40On the Largest Full SubAFL of an AFL. Seymour Ginsburg, Jonathan Goldstine. Mathematical Systems Theory (6): 241-242 (1972). Web SearchBibTeX
39Uniformly Erasable AFL. Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach. STOC 1972, 207-213. Web SearchBibTeXDownload
1971
38AFL with the Semilinear Property. Seymour Ginsburg, Edwin H. Spanier. J. Comput. Syst. Sci. (5): 365-396 (1971). Web SearchBibTeXDownload
37Images of AFL under Certain Families of Homomorphisms. Seymour Ginsburg, John E. Hopcroft. Mathematical Systems Theory (5): 216-227 (1971). Web SearchBibTeXDownload
36Intersection-Closed full AFL and the Recursively Enumerable Languages. Seymour Ginsburg, Jonathan Goldstine. STOC 1971, 121-131. Web SearchBibTeXDownload
1970
35On the Closure of AFL under Reversal. Seymour Ginsburg, Michael A. Harrison. Information and Control (17): 395-409 (1970). Web SearchBibTeXDownload
34On the existence of generators for certain AFL. Seymour Ginsburg, Gene F. Rose. Inf. Sci. (2): 431-446 (1970). Web SearchBibTeXDownload
33Two-way balloon automata and AFL. Seymour Ginsburg, John E. Hopcroft. J. ACM (17): 3-13 (1970). Web SearchBibTeXDownload
32Principal AFL. Seymour Ginsburg, Sheila A. Greibach. J. Comput. Syst. Sci. (4): 308-338 (1970). Web SearchBibTeXDownload
1969
31A Mathematical Model of Transformational Grammars. Seymour Ginsburg, Barbara Partee. Information and Control (15): 297-334 (1969). Web SearchBibTeXDownload
1968
30Derivation-Bounded Languages. Seymour Ginsburg, Edwin H. Spanier. FOCS (2): 228-250 (1968). Web SearchBibTeXDownload
29A Note on Preservation of Languages by Transducers. Seymour Ginsburg, Gene F. Rose. Information and Control (12): 549-552 (1968). Web SearchBibTeXDownload
28On the Elimination of Endmarkers. Seymour Ginsburg, Michael A. Harrison. Information and Control (12): 103-115 (1968). Web SearchBibTeXDownload
27One-way nondeterministic real-time list-storage languages. Seymour Ginsburg, Michael A. Harrison. J. ACM (15): 428-446 (1968). Web SearchBibTeXDownload
26Control Sets on Grammars. Seymour Ginsburg, Edwin H. Spanier. Mathematical Systems Theory (2): 159-177 (1968). Web SearchBibTeXDownload
25Two-Way Balloon Automata and AFL. Seymour Ginsburg, John E. Hopcroft. SWAT (FOCS) 1968, 292-297. Web SearchBibTeXDownload
1967
24One-way stack automata. Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. J. ACM (14): 389-418 (1967). Web SearchBibTeXDownload
23Stack automata and compiling. Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. J. ACM (14): 172-201 (1967). Web SearchBibTeXDownload
22Bracketed Context-Free Languages. Seymour Ginsburg, Michael A. Harrison. J. Comput. Syst. Sci. (1): 1-23 (1967). Web SearchBibTeXDownload
21Abstract Families of Languages. Seymour Ginsburg, Sheila A. Greibach. SWAT (FOCS) 1967, 128-139. Web SearchBibTeXDownload
1966
20Preservation of Languages by Transducers. Seymour Ginsburg, Gene F. Rose. Information and Control (9): 153-176 (1966). Web SearchBibTeXDownload
19Mappings which Preserve Context Sensitive Languages. Seymour Ginsburg, Sheila A. Greibach. Information and Control (9): 563-582 (1966). Web SearchBibTeX
18Deterministic Context Free Languages. Seymour Ginsburg, Sheila A. Greibach. Information and Control (9): 620-648 (1966). Web SearchBibTeX
17Preservation of unambiguity and inherent ambiguity in context-free languages. Seymour Ginsburg, Joseph S. Ullian. J. ACM (13): 364-368 (1966). Web SearchBibTeXDownload
16Ambiguity in context free languages. Seymour Ginsburg, Joseph S. Ullian. J. ACM (13): 62-89 (1966). Web SearchBibTeXDownload
15One-Way Stack Automata (Extended Abstract). Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison. SWAT (FOCS) 1966, 47-52. Web SearchBibTeXDownload
1965
14Mappings of languages by two-tape devices. Seymour Ginsburg, Edwin H. Spanier. J. ACM (12): 423-434 (1965). Web SearchBibTeXDownload
13Deterministic context free languages. Seymour Ginsburg, Sheila A. Greibach. SWCT (FOCS) 1965, 203-220. Web SearchBibTeXDownload
1964
12Solvability of Machine Mappings of Regular Sets to Regular Sets. Seymour Ginsburg, Thomas N. Hibbard. J. ACM (11): 302-312 (1964). Web SearchBibTeXDownload
11Mappings of languages by two-tape devices. Seymour Ginsburg, Edwin H. Spanier. SWCT (FOCS) 1964, 57-67. Web SearchBibTeXDownload
1963
10Operations Which Preserve Definability in Languages. Seymour Ginsburg, Gene F. Rose. J. ACM (10): 175-195 (1963). Web SearchBibTeXDownload
9Quotients of Context-Free Languages. Seymour Ginsburg, Edwin H. Spanier. J. ACM (10): 487-492 (1963). Web SearchBibTeXDownload
8Some Recursively Unsolvable Problems in ALGOL-Like Languages. Seymour Ginsburg, Gene F. Rose. J. ACM (10): 29-47 (1963). Web SearchBibTeXDownload
1962
7Two Families of Languages Related to ALGOL. Seymour Ginsburg, H. Gordon Rice. J. ACM (9): 350-371 (1962). Web SearchBibTeXDownload
1961
6Theory of abstract machines. Seymour Ginsburg. Commun. ACM (4): 195 (1961). Web SearchBibTeXDownload
5Sets of Tapes Accepted by Different Types of Automata. Seymour Ginsburg. J. ACM (8): 81-86 (1961). Web SearchBibTeXDownload
4Compatibility of States in Input-Independent Machines. Seymour Ginsburg. J. ACM (8): 400-403 (1961). Web SearchBibTeXDownload
1960
3Connective Properties Preserved in Minimal State Machines. Seymour Ginsburg. J. ACM (7): 311-325 (1960). Web SearchBibTeXDownload
1959
2On the Reduction of Superfluous States in a Sequential Machine. Seymour Ginsburg. J. ACM (6): 259-282 (1959). Web SearchBibTeXDownload
1958
1On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. Seymour Ginsburg. J. ACM (5): 266-280 (1958). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research