1928 - 2004
List of publications from the DBLP Bibliography Server - FAQ| 1999 | ||
|---|---|---|
| j78 | Seymour Ginsburg, Nan C. Shu, Dan A. Simovici: Automatic Data Restructuring. J. UCS 5(4): 243-286 (1999) | |
| 1998 | ||
| j77 | Seymour Ginsburg, Xiaoyang Sean Wang: Regular Sequence Operations and Their Use in Database Queries. J. Comput. Syst. Sci. 56(1): 1-26 (1998) | |
| 1995 | ||
| j76 | Guozhu Dong, Seymour Ginsburg: On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components. J. Log. Program. 23(3): 203-236 (1995) | |
| j75 | Seymour Ginsburg, Katsumi Tanaka: Interval Queries on Object Histories. Theor. Comput. Sci. 145(1&2): 291-316 (1995) | |
| 1993 | ||
| j74 | Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang: Content-Related Interval Queries on Object Histories. Inf. Comput. 103(1): 30-67 (1993) | |
| p1 | ||
| 1992 | ||
| c26 | Seymour Ginsburg, Xiaoyang Sean Wang: Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. PODS 1992: 293-300 | |
| 1991 | ||
| j73 | Guozhu Dong, Seymour Ginsburg: Localizable Constraints for Object Histories. Theor. Comput. Sci. 90(2): 391-432 (1991) | |
| 1990 | ||
| j72 | Seymour Ginsburg, Dan Tian: Input-Dependent-Only Object Histories. J. Comput. Syst. Sci. 40(3): 346-375 (1990) | |
| j71 | Guozhu Dong, Seymour Ginsburg: On the Decomposition of Datalog Program Mappings. Theor. Comput. Sci. 76(1): 143-177 (1990) | |
| 1989 | ||
| j70 | Yongkyun Cho, Seymour Ginsburg: Decision Problems of Object histories. Inf. Comput. 83(2): 245-263 (1989) | |
| j69 | Seymour Ginsburg, Chang-jie Tang: Cohesion of Object Histories. Theor. Comput. Sci. 63(1): 63-90 (1989) | |
| 1988 | ||
| c25 | ||
| 1987 | ||
| j68 | Seymour Ginsburg, Marc Gyssens: Object Histories Which Avoid Certain Subsequences. Inf. Comput. 73(2): 174-206 (1987) | |
| j67 | Seymour Ginsburg, Chang-jie Tang: Canonical Forms for Interval Functions. Theor. Comput. Sci. 54: 299-313 (1987) | |
| 1986 | ||
| j66 | Serge Abiteboul, Seymour Ginsburg: Tuple sequences and lexicographic indexes. J. ACM 33(3): 409-422 (1986) | |
| j65 | ||
| j64 | Seymour Ginsburg, Chang-jie Tang: Projection of Object Histories. Theor. Comput. Sci. 48(3): 297-328 (1986) | |
| j63 | Seymour Ginsburg, Katsumi Tanaka: Computation-Tuple Sequences and Object Histories. ACM Trans. Database Syst. 11(2): 186-212 (1986) | |
| c24 | Guozhu Dong, Seymour Ginsburg: Localizable Constraints for Object Histories. XP7.52 Workshop on Database Theory 1986 | |
| c23 | Seymour Ginsburg, Chang-jie Tang: Cohesion of Object Histories. XP7.52 Workshop on Database Theory 1986 | |
| 1985 | ||
| j62 | Seymour Ginsburg, Edwin H. Spanier: On Completing Tables to Satisfy Functional Dependencies. Theor. Comput. Sci. 39: 309-317 (1985) | |
| c22 | Seymour Ginsburg, Katsumi Tanaka: Computation-Tuple Sequences and Object Histories: Extended Abstract. FODO 1985: 333-343 | |
| c21 | ||
| 1984 | ||
| c20 | ||
| c19 | Seymour Ginsburg, Katsumi Tanaka: Interval Queries on Object Histories: Extended Abstract. VLDB 1984: 208-217 | |
| 1983 | ||
| j61 | Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier: On the Equality of Grammatical Families. J. Comput. Syst. Sci. 26(2): 171-196 (1983) | |
| j60 | Seymour Ginsburg, Richard Hull: Order Dependency in the Relational Model. Theor. Comput. Sci. 26: 149-195 (1983) | |
| j59 | Seymour Ginsburg, Richard Hull: Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. Theor. Comput. Sci. 26: 243-286 (1983) | |
| c18 | ||
| 1982 | ||
| j58 | Seymour Ginsburg, Sami Mohammed Zaiddan: Properties of functional-dependency families. J. ACM 29(3): 678-698 (1982) | |
| j57 | Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier: A Prime Decomposition Theorem for Grammatical Families. J. Comput. Syst. Sci. 24(3): 315-361 (1982) | |
| j56 | Meera Blattner, Seymour Ginsburg: Position-Restricted Grammar Forms and Grammars. Theor. Comput. Sci. 17: 1-27 (1982) | |
| 1981 | ||
| j55 | Seymour Ginsburg, Chandra M. R. Kintala: Strict Interpretations of Deterministic Pushdown Acceptors. Mathematical Systems Theory 14: 229-240 (1981) | |
| c17 | Seymour Ginsburg, Richard Hull: Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. XP2 Workshop on Relational Database Theory 1981 | |
| c16 | Seymour Ginsburg, Richard Hull: Ordered Attribute Domains in the Relational Model. XP2 Workshop on Relational Database Theory 1981 | |
| 1980 | ||
| e2 | Raymond E. Miller, Seymour Ginsburg, Walter A. Burkhard, Richard J. Lipton (Eds.): Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA. ACM 1980 | |
| 1979 | ||
| j54 | Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke: On Strict Interpretations of Grammar Forms. Mathematical Systems Theory 12: 233-252 (1979) | |
| 1978 | ||
| j53 | ||
| j52 | Seymour Ginsburg, Erica M. Rounds: Dynamic Syntax Specification Using Grammar Forms. IEEE Trans. Software Eng. 4(1): 44-55 (1978) | |
| 1977 | ||
| j51 | ||
| j50 | Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier: The Structure of Context-Free Grammatical Families. J. Comput. Syst. Sci. 15(3): 262-279 (1977) | |
| j49 | Seymour Ginsburg, Nancy A. Lynch: Derivation Complexity in Context-Free Grammar Forms. SIAM J. Comput. 6(1): 123-138 (1977) | |
| j48 | Seymour Ginsburg, Edwin H. Spanier: Pushdown Acceptor Forms. Theor. Comput. Sci. 5(3): 307-320 (1977) | |
| c15 | Meera Blattner, Seymour Ginsburg: Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. FCT 1977: 49-53 | |
| 1976 | ||
| j47 | Seymour Ginsburg, Hermann A. Maurer: On strongly equivalent context-free grammar forms. Computing 16(3): 281-290 (1976) | |
| j46 | Seymour Ginsburg, Nancy A. Lynch: Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976) | |
| j45 | Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach: Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976) | |
| c14 | ||
| 1975 | ||
| j44 | ||
| j43 | Seymour Ginsburg, Grzegorz Rozenberg: TOL Schemes and Control Sets. Information and Control 27(2): 109-125 (1975) | |
| j42 | Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach: Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975) | |
| j41 | Armin B. Cremers, Seymour Ginsburg: Context-Free Grammar Forms. J. Comput. Syst. Sci. 11(1): 86-117 (1975) | |
| c13 | ||
| 1974 | ||
| j40 | Seymour Ginsburg, Branislav Rovan: On the Periodicity of Word-Length in DOL Languages. Information and Control 26(1): 34-44 (1974) | |
| j39 | ||
| j38 | Seymour Ginsburg, Gene F. Rose: The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. J. Comput. Syst. Sci. 8(2): 243-269 (1974) | |
| j37 | Seymour Ginsburg, Edwin H. Spanier: On Incomparable Abstract Family of Languages (AFL). J. Comput. Syst. Sci. 9(1): 88-108 (1974) | |
| c12 | Armin B. Cremers, Seymour Ginsburg: Characterization of Context-Free Grammatical Families. SWAT (FOCS) 1974: 199-204 | |
| c11 | ||
| 1973 | ||
| j36 | Seymour Ginsburg, Jonathan Goldstine: Intersection-Closed Full AFL and the Recursively Enumerable Languages. Information and Control 22(3): 201-231 (1973) | |
| j35 | Seymour Ginsburg, Sheila A. Greibach: On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973) | |
| c10 | ||
| 1972 | ||
| j34 | ||
| j33 | Seymour Ginsburg, Jonathan Goldstine: On the Largest Full SubAFL of an AFL. Mathematical Systems Theory 6(3): 241-242 (1972) | |
| c9 | Armen Gabrielian, Seymour Ginsburg: Structured-Storage AFA (Abstract). Formal Aspects of Cognitive Processes 1972: 70-71 | |
| c8 | Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine: Uniformly Erasable AFL. STOC 1972: 207-213 | |
| 1971 | ||
| j32 | Seymour Ginsburg, Edwin H. Spanier: AFL with the Semilinear Property. J. Comput. Syst. Sci. 5(4): 365-396 (1971) | |
| j31 | Seymour Ginsburg, John E. Hopcroft: Images of AFL under Certain Families of Homomorphisms. Mathematical Systems Theory 5(3): 216-227 (1971) | |
| c7 | Seymour Ginsburg, Jonathan Goldstine: Intersection-Closed full AFL and the Recursively Enumerable Languages. STOC 1971: 121-131 | |
| 1970 | ||
| j30 | Seymour Ginsburg, Michael A. Harrison: On the Closure of AFL under Reversal. Information and Control 17(4): 395-409 (1970) | |
| j29 | Seymour Ginsburg, Gene F. Rose: On the existence of generators for certain AFL. Inf. Sci. 2(4): 431-446 (1970) | |
| j28 | ||
| j27 | ||
| 1969 | ||
| j26 | Seymour Ginsburg, Barbara Partee: A Mathematical Model of Transformational Grammars. Information and Control 15(4): 297-334 (1969) | |
| e1 | Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison (Eds.): Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA. ACM 1969 | |
| 1968 | ||
| j25 | Seymour Ginsburg, Michael A. Harrison: On the Elimination of Endmarkers. Information and Control 12(2): 103-115 (1968) | |
| j24 | Seymour Ginsburg, Gene F. Rose: A Note on Preservation of Languages by Transducers. Information and Control 12(5/6): 549-552 (1968) | |
| j23 | Seymour Ginsburg, Michael A. Harrison: One-way nondeterministic real-time list-storage languages. J. ACM 15(3): 428-446 (1968) | |
| j22 | Seymour Ginsburg, Edwin H. Spanier: Derivation-Bounded Languages. J. Comput. Syst. Sci. 2(3): 228-250 (1968) | |
| j21 | Seymour Ginsburg, Edwin H. Spanier: Control Sets on Grammars. Mathematical Systems Theory 2(2): 159-177 (1968) | |
| c6 | ||
| c5 | ||
| 1967 | ||
| j20 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: Stack automata and compiling. J. ACM 14(1): 172-201 (1967) | |
| j19 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: One-way stack automata. J. ACM 14(2): 389-418 (1967) | |
| j18 | Seymour Ginsburg, Michael A. Harrison: Bracketed Context-Free Languages. J. Comput. Syst. Sci. 1(1): 1-23 (1967) | |
| c4 | ||
| 1966 | ||
| j17 | Seymour Ginsburg, Gene F. Rose: Preservation of Languages by Transducers. Information and Control 9(2): 153-176 (1966) | |
| j16 | Seymour Ginsburg, Sheila A. Greibach: Mappings which Preserve Context Sensitive Languages. Information and Control 9(6): 563-582 (1966) | |
| j15 | Seymour Ginsburg, Sheila A. Greibach: Deterministic Context Free Languages. Information and Control 9(6): 620-648 (1966) | |
| j14 | ||
| j13 | Seymour Ginsburg, Joseph S. Ullian: Preservation of unambiguity and inherent ambiguity in context-free languages. J. ACM 13(3): 364-368 (1966) | |
| c3 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: One-Way Stack Automata (Extended Abstract). SWAT (FOCS) 1966: 47-52 | |
| 1965 | ||
| j12 | Seymour Ginsburg, Edwin H. Spanier: Mappings of languages by two-tape devices. J. ACM 12(3): 423-434 (1965) | |
| c2 | Seymour Ginsburg, Sheila A. Greibach: Deterministic context free languages. SWCT (FOCS) 1965: 203-220 | |
| 1964 | ||
| j11 | Seymour Ginsburg, Thomas N. Hibbard: Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11(3): 302-312 (1964) | |
| c1 | Seymour Ginsburg, Edwin H. Spanier: Mappings of languages by two-tape devices. SWCT (FOCS) 1964: 57-67 | |
| 1963 | ||
| j10 | Seymour Ginsburg, Gene F. Rose: Some Recursively Unsolvable Problems in ALGOL-Like Languages. J. ACM 10(1): 29-47 (1963) | |
| j9 | Seymour Ginsburg, Gene F. Rose: Operations Which Preserve Definability in Languages. J. ACM 10(2): 175-195 (1963) | |
| j8 | Seymour Ginsburg, Edwin H. Spanier: Quotients of Context-Free Languages. J. ACM 10(4): 487-492 (1963) | |
| 1962 | ||
| j7 | Seymour Ginsburg, H. Gordon Rice: Two Families of Languages Related to ALGOL. J. ACM 9(3): 350-371 (1962) | |
| 1961 | ||
| j6 | ||
| j5 | ||
| j4 | Seymour Ginsburg: Compatibility of States in Input-Independent Machines. J. ACM 8(3): 400-403 (1961) | |
| 1960 | ||
| j3 | Seymour Ginsburg: Connective Properties Preserved in Minimal State Machines. J. ACM 7(4): 311-325 (1960) | |
| 1959 | ||
| j2 | Seymour Ginsburg: On the Reduction of Superfluous States in a Sequential Machine. J. ACM 6(2): 259-282 (1959) | |
| 1958 | ||
| j1 | Seymour Ginsburg: On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. J. ACM 5(3): 266-280 (1958) | |
Colors in the list of coauthors
Last update Sun May 26 09:24:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page