Publication Information

{'id': 'https://openalex.org/W1550948656', 'doi': None, 'title': "Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings", 'display_name': "Automata, Languages and Programming: 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings", 'publication_year': 1996, 'publication_date': '1996-01-15', 'ids': {'openalex': 'https://openalex.org/W1550948656', 'mag': '1550948656'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/ncid/BA2792422X', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book', 'type_crossref': 'book', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5109961260', 'display_name': 'Friedhelm Meyer auf der Heide', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'F. Meyer auf der Heide', 'raw_affiliation_strings': [], 'affiliations': []}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5086678348', 'display_name': 'Burkhard Monien', 'orcid': 'https://orcid.org/0000-0003-2334-6795'}, 'institutions': [], 'countries': [], 'is_corresponding': False, 'raw_author_name': 'Burkhard Monien', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 1, 'citation_normalized_percentile': {'value': 0.208609, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 54, 'max': 62}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T11567', 'display_name': 'semigroups and automata theory', 'score': 0.9986, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, 'topics': [{'id': 'https://openalex.org/T11567', 'display_name': 'semigroups and automata theory', 'score': 0.9986, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12029', 'display_name': 'DNA and Biological Computing', 'score': 0.9934, 'subfield': {'id': 'https://openalex.org/subfields/1312', 'display_name': 'Molecular Biology'}, 'field': {'id': 'https://openalex.org/fields/13', 'display_name': 'Biochemistry, Genetics and Molecular Biology'}, 'domain': {'id': 'https://openalex.org/domains/1', 'display_name': 'Life Sciences'}}, {'id': 'https://openalex.org/T11269', 'display_name': 'Algorithms and Data Compression', 'score': 0.9927, 'subfield': {'id': 'https://openalex.org/subfields/1702', 'display_name': 'Artificial Intelligence'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/nondeterministic-algorithm', 'display_name': 'Nondeterministic algorithm', 'score': 0.5039074}, {'id': 'https://openalex.org/keywords/tree-automaton', 'display_name': 'Tree automaton', 'score': 0.43371162}, {'id': 'https://openalex.org/keywords/monadic-predicate-calculus', 'display_name': 'Monadic predicate calculus', 'score': 0.41315734}], 'concepts': [{'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.5928243}, {'id': 'https://openalex.org/C153269930', 'wikidata': 'https://www.wikidata.org/wiki/Q430001', 'display_name': 'Decidability', 'level': 2, 'score': 0.59038764}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.5413009}, {'id': 'https://openalex.org/C176181172', 'wikidata': 'https://www.wikidata.org/wiki/Q3490301', 'display_name': 'Nondeterministic algorithm', 'level': 2, 'score': 0.5039074}, {'id': 'https://openalex.org/C154690210', 'wikidata': 'https://www.wikidata.org/wiki/Q1668499', 'display_name': 'Rewriting', 'level': 2, 'score': 0.47452918}, {'id': 'https://openalex.org/C2778583254', 'wikidata': 'https://www.wikidata.org/wiki/Q2872598', 'display_name': 'Tree automaton', 'level': 3, 'score': 0.43371162}, {'id': 'https://openalex.org/C124656256', 'wikidata': 'https://www.wikidata.org/wiki/Q6897882', 'display_name': 'Monadic predicate calculus', 'level': 4, 'score': 0.41315734}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.3271328}, {'id': 'https://openalex.org/C112505250', 'wikidata': 'https://www.wikidata.org/wiki/Q787116', 'display_name': 'Automaton', 'level': 2, 'score': 0.28435743}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.24352667}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.16543123}, {'id': 'https://openalex.org/C169896238', 'wikidata': 'https://www.wikidata.org/wiki/Q1644136', 'display_name': 'Higher-order logic', 'level': 3, 'score': 0.0}, {'id': 'https://openalex.org/C102993220', 'wikidata': 'https://www.wikidata.org/wiki/Q387196', 'display_name': 'Description logic', 'level': 2, 'score': 0.0}, {'id': 'https://openalex.org/C199360897', 'wikidata': 'https://www.wikidata.org/wiki/Q9143', 'display_name': 'Programming language', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'http://ci.nii.ac.jp/ncid/BA2792422X', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W628979560', 'https://openalex.org/W626491378', 'https://openalex.org/W623577274', 'https://openalex.org/W604668415', 'https://openalex.org/W420489366', 'https://openalex.org/W2111669295', 'https://openalex.org/W1904075281', 'https://openalex.org/W1877933577', 'https://openalex.org/W1600939987', 'https://openalex.org/W1599600353', 'https://openalex.org/W1593919000', 'https://openalex.org/W1590911192', 'https://openalex.org/W1574276522', 'https://openalex.org/W1552571984', 'https://openalex.org/W1552324588', 'https://openalex.org/W1550568949', 'https://openalex.org/W1514759120', 'https://openalex.org/W1499605354', 'https://openalex.org/W1498064541', 'https://openalex.org/W1493746159'], 'abstract_inverted_index': {'Saturation-based': [0], 'theorem': [1, 39], 'proving': [2], '(abstract).-': [3], 'Bandwidth': [4], 'efficient': [5], 'parallel': [6, 334], 'computation.-': [7], 'Variable-length': [8], 'maximal': [9], 'codes.-': [10, 235], 'Lower': [11, 249, 262], 'bounds': [12, 192, 242, 250, 263], 'for': [13, 40, 47, 55, 68, 93, 134, 147, 183, 243, 251, 264, 274, 376, 383, 395], 'prepositional': [14], 'proofs': [15], 'and': [16, 88, 119, 127, 141, 234, 241, 324], 'independence': [17], 'results': [18], 'in': [19, 34, 73, 297, 346], 'bounded': [20], 'arithmetic.-': [21], 'Algebraic': [22], 'characterizations': [23], 'of': [24, 59, 78, 85, 97, 173, 178, 196, 204, 210, 271, 280, 294, 305, 336, 339, 389], 'decorated': [25], 'trace': [26], 'equivalences': [27], 'over': [28], 'tree-like': [29], 'structures.-': [30], 'Fast': [31, 355], 'asynchronous': [32, 366], 'systems': [33], 'dense': [35], 'time.-': [36], 'A': [37, 64, 361, 373, 392], 'hierarchy': [38], 'the': [41, 48, 194, 208, 269, 369, 387], '?-calculus.-': [42, 51], 'An': [43], 'effective': [44], 'tableau': [45], 'system': [46, 299], 'linear': [49], 'time': [50, 328], 'Characterizing': [52], 'fairness': [53], 'implementability': [54], 'multiparty': [56], 'interaction.-': [57], 'Termination': [58], 'context-sensitive': [60], 'rewriting': [61], 'by': [62, 202, 226], 'rewriting.-': [63], 'complete': [65], 'gentzen-style': [66], 'axiomatization': [67], 'set': [69], 'constraints.-': [70], 'Fatal': [71], 'errors': [72], 'conditional': [74], 'expressions.-': [75], 'Different': [76], 'types': [77], 'arrow': [79], 'between': [80], 'logical': [81], 'frameworks.-': [82], 'Effective': [83], 'models': [84], 'polymorphism,': [86], 'subtyping': [87], 'recursion': [89], '(extended': [90], 'abstract).-': [91], 'Regularity': [92], 'a': [94, 107, 159, 289, 337, 352], 'large': [95], 'class': [96, 338], 'context-free': [98, 114], 'processes': [99, 287], 'is': [100], 'decidable.-': [101], 'On': [102, 207, 218, 232, 236, 246, 268, 386], 'infinite': [103], 'transition': [104, 298], 'graphs': [105], 'having': [106], 'decidable': [108], 'monadic': [109], 'theory.-': [110], 'Semi-groups': [111], 'acting': [112], 'on': [113, 139, 151, 254, 351], 'graphs.-': [115, 143, 157], 'Hard': [116], 'sets': [117, 215], 'method': [118, 122], 'semilinear': [120], 'reservoir': [121], 'with': [123, 164, 229, 256, 288, 309, 317, 368], 'applications.-': [124, 325], 'Random': [125], 'polynomials': [126], 'polynomial': [128], 'factorization.-': [129], 'Optimal': [130, 326], 'grobner': [131], 'base': [132], 'algorithms': [133, 382], 'binomial': [135], 'ideals.-': [136], 'Minimum': [137], 'fill-in': [138], 'circle': [140], 'circular-arc': [142], 'Practical': [144], 'approximation': [145, 335], 'schemes': [146], 'maximum': [148], 'induced-subgraph': [149], 'problems': [150, 273], 'K': [152, 155], '3,3-free': [153], 'or': [154], '5-free': [156], 'Searching': [158], 'fixed': [160], 'graph.-': [161], 'Improved': [162, 333, 380], 'sampling': [163], 'applications': [165, 310], 'to': [166, 193, 284, 311], 'dynamic': [167, 362], 'graph': [168], 'algorithms.-': [169], 'The': [170, 292], 'expressive': [171], 'power': [172, 209], 'existential': [174], 'first': [175], 'order': [176], 'sentences': [177], "buchi's": [179], 'sequential': [180], 'calculus.-': [181], 'Fixpoints': [182], 'rabin': [184], 'tree': [185, 331], 'automata': [186], 'make': [187], 'complementation': [188], 'easy.-': [189], 'New': [190], 'upper': [191], 'limitedness': [195], 'distance': [197], 'automata.-': [198], 'Recognizing': [199], 'regular': [200], 'expressions': [201], 'means': [203], 'dataflow': [205], 'networks.-': [206, 348], 'randomized': [211, 329], 'branching': [212], 'programs.-': [213, 379], 'Hitting': [214], 'derandomize': [216], 'BPP.-': [217], 'type-2': [219], 'probabilistic': [220], 'quantifiers.-': [221], 'Speeding-up': [222], 'single-tape': [223], 'nondeterministic': [224], 'computations': [225], 'single': [227], 'alternation,': [228], 'separation': [230], 'results.-': [231], '?-generators': [233], 'standard': [237], 'Sturmian': [238], 'morphisms.-': [239], 'Constructions': [240], 'visual': [244], 'cryptography.-': [245], 'capital': [247], 'investment.-': [248], 'static': [252], 'dictionaries': [253], 'RAMs': [255], 'bit': [257], 'operations': [258], 'but': [259], 'no': [260], 'multiplication.-': [261], 'row': [265], 'minima': [266], 'searching.-': [267], 'complexity': [270, 388], 'relational': [272], 'finite': [275], 'state': [276], 'processes.-': [277], 'Deciding': [278], 'finiteness': [279], 'Petri': [281], 'nets': [282], 'up': [283], 'bisimulation.-': [285], 'Mobile': [286], 'distributed': [290], 'environment.-': [291], 'meaning': [293], 'negative': [295], 'premises': [296], 'specifications': [300], 'II.-': [301], 'Average': [302], 'case': [303], 'analyses': [304], 'list': [306], 'update': [307], 'algorithms,': [308, 323], 'data': [312, 315], 'compression.-': [313], 'Self-organizing': [314], 'structures': [316], 'dependent': [318], 'accesses.-': [319], 'Lopsided': [320], 'trees:': [321], 'Analyses,': [322], 'logarithmic': [327], 'suffix': [330], 'construction.-': [332], 'integer': [340], 'programming': [341], 'problems.-': [342], 'Efficient': [343, 365], 'collective': [344], 'communication': [345], 'optical': [347], 'Shared-memory': [349], 'simulations': [350], 'faulty-memory': [353], 'DMM.-': [354], 'deterministic': [356], 'backtrack': [357], 'search.-': [358], 'Agent': [359], 'rendezvous:': [360], 'symmetry-breaking': [363], 'problem.-': [364], 'consensus': [367], 'value-oblivious': [370], 'adversary': [371], 'scheduler.-': [372], 'formal': [374], 'framework': [375], 'evaluating': [377], 'heuristic': [378], 'scheduling': [381], 'minsum': [384], 'criteria.-': [385], 'string': [390], 'folding.-': [391], 'polynomial-time': [393], 'algorithm': [394], 'near-perfect': [396], 'phylogeny.': [397]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1550948656', 'counts_by_year': [{'year': 2024, 'cited_by_count': 1}], 'updated_date': '2024-12-14T11:08:11.912952', 'created_date': '2016-06-24'}